• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.898-908
• /
• 2004

In this paper, we propose a high speed preamble searcher feasible for RACH(Random Access Channel) preamble structure in WCDMA reverse link receiver. Unlike IS-95, WCDMA system uses AISMA(Acquisition Indication Sense Multiple Access) process. Because of the time limit between RACH preamble transmission and AI(Acquisition Indicators), and the restriction on the number of RACH signatures assigned to RACH preamble, fast acquisition indication is required for efficient operation. The preamble searcher proposed in this paper is based on 2-antenna system and has adopted FHT algorithm that has the radix-2 16 point FFT structure. The acquisition speed using FHT is 64 times faster than the conventional method that correlates each signature. Based on their fast aquisition scheme, we improved the acquisition performance by calculating the correlation up to the 4096 chips of the total preamble length. The performance is analyzed by using Neyman-pearson method. The proposed algorithm has been applied for the implementation of WCDMA reverse link receiver modem successfully.

• Journal of Advanced Navigation Technology
• /
• v.16 no.6
• /
• pp.988-996
• /
• 2012

Assuming perfect channel state information (CSI), the conventional interference alignment (IA) algorithm in the uplink cellular system suppresses inter-cell interference (ICI) by aligning ICI to a randomly selected reference vector. However, IA in practice relies on limited feedback between base stations and users, resulting in residual ICI. In this paper, we propose the optimization of the reference vector that minimizes the upper-bound of residual ICI power. Secondly, the iterative IA that designs the direction of transmit and receive filter is proposed to minimize the residual ICI as well as maximize the desired signals. Moreover, we propose the user scheduling method combined with proposed IA schemes which provides the multiuser diversity gain in multi-cell environments. Finally, the performance gain of the proposed IA algorithms compared with the existing IA are analyzed and demonstrated by simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.685-692
• /
• 2008

In this paper, we propose a timing recovery loop for Inmarsat mini-m system downlink receiver. Inmarsat mini-m system requires a timing recovery loop which is robust in frequency offset and has fast acquisition because Inmarsat mini-m system specification requires frequency tolerance is required of ${\pm}924$ Hz (signal bandwidth: 2.4 kHz) and acquisition time of UW (Unique Word) signal duration (15ms).Therefore, we propose a timing recovery loop which is suitable for Inmarsat mini-m system. The proposed timing recovery loop adopted noncoherent UW detector and differential ELD which applied differential UW signal for stability and fast acquisition in frequency offset environment. Simulation results show that the proposed timing recovery loop has stable operation and fast acquisition in frequency offset environment for the system.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.235-240
• /
• 2000

현재 웹 코스웨어의 대부분은 하이퍼텍스트 문서들간의 비선형적인 연결에 의한 학습 방식을 채택하고 있으나, 이는 단순한 페이지 링크형 학습으로서 그리 커다란 교육 효과를 발휘하기에는 어렵다는 한계를 맞이하고 있다. 이러한 상황에서 다중 학습자가 동기적으로 참여하는 시뮬레이션 게임 방식은 웹 코스웨어의 현재 한계를 뛰어넘을 수 있는 하나의 교수·학습 모델이 될 수 있을 것으로 기대된다. 이에 본 논문에서는 다중 학습자가 동기적으로 참여하는 시뮬레이션 게임 방식의 웹 코스웨어에 대한 수업 모델을 제안하고 있다. 이 수업 모델은 Atkinson의 체제적 접근 방식의 게임 설계, Alessi와 Trollip의 시뮬레이션의 구조와 절차, Reigeluth와 Schwartz의 시뮬레이션에서의 학습자 역할에 대한 분석 연구를 기반으로 설계하였다.

• Annual Conference on Human and Language Technology
• /
• 2002.10e
• /
• pp.103-107
• /
• 2002

데이터 기반 기계번역의 성공여부는 대량의 데이터를 단기간에 구축하는 방법과, 또 구축된 데이터에 대한 효과적인 관리 방법이 좌우한다고 할 수 있다. 대표적인 데이터 기반 기계번역 방법론인 예제 기반 기계번역 방식이나 패턴 기반 기계번역 방식에서는 최소한의 학습 내지는 학습과정 없이 데이터를 구축하는 데에 연구가 중점적으로 이루어져왔으나, 데이터의 관리 문제에 대해서는 많은 연구가 이루어지지 못하였다. 그러나 데이터의 확장 못지않게 데이터의 효율적인 관리도 데이터 기반 기계번역 시스템의 개발에서 매우 중요하다. 이 논문에서는 사/피동 링크 등을 이용하여 사전을 재구성하는 것이 데이터의 일관성과 관리성을 향상시키고, 이론적인 면에서는 정보 기술상의 잉여성을 줄인다는 점을 보인다. 또한 이러한 정보에 기반하여 기구축된 동사구 패턴으로부터 대역어 정보를 이용하여 새로운 패턴을 만들어내는 방법론도 제시한다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.3
• /
• pp.20-28
• /
• 2001

In this paper, we present an efficient path-based multicast algorithm in wormhole-routed mesh networks. Our algorithm is based on a network partitioning strategy that uses two Hamiltonian paths. In the previous studies, only on a network partitioning strategy that uses two Hamiltonian paths. In the previous studies, only one Hamiltonian path was used. Thus messages traverse mire horizontal channels than vertical ones, leading to earlier network congestion. By incorporating additional vertical Hamiltonian path as well as the horizontal Hamiltonian path, messages are distributed evenly as much as possible, thus making network evenly as much as possible, thus making network performance better. We prove that this algorithm is deadlock-free. And by extensive simulations, we show that this algorithm is superior to the previous ones by 15∼20%.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.1
• /
• pp.146-154
• /
• 2007

In this paper, we have presented a real-time transfer mechanism for the delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is shortest or the number of hops is least. Although the approaches of these methods are acceptable, they do not always work as efficiently as they can because they had no consideration for the link error rates. In the case of transmission failures on links, they can not guarantee the end-to-end real-time transfer due to retransmissions. Therefore, we have proposed an algorithm to select a real-time transfer path in consideration of the link error rates. Our mechanism estimates the 1-hop delay based on the link error rate between two neighboring nodes, which in turn enables the calculation of the expected end-to-end delay. A source node comes to choose a path with the shortest end-to-end delay as a real-time route, and sends data along the path chosen. We performed various experiments changing the link error rates and discovered that this proposed mechanism improves the speed of event-to-sink data transfer and reduces delay jitter. We also found that this mechanism prevents additional energy consumption and prolongs network lifetime, resulting from the elative reduction of transmission failures and retransmissions.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.47-59
• /
• 2009

Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we propose a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC). The ultimate goal is to extend the network lifetime by providing sensors with high adaptability to the application-dependent and time-varying delay requirements. The TPC requests sensors to construct two types of links: direct and relay links. The direct links are used for control and forwarding time critical sensed data. On the other hand, the relay links are used only for data forwarding based on the user delay constraints, thus allowing the sensors to opportunistically use the most energy-saving links and forming a multi-hop path. Simulation results demonstrate that cluster-based delay-adaptive data gathering strategy (CD-DGS) saves a significant amount of energy for dense sensor networks by adapting to the user delay constraints.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.339-347
• /
• 2012

Femtocells as home base station for indoor coverage extension and wideband data service, have been studied with significant interests. When femtocell is deployed, the existing cell structural of changes causes various technical problems. In this paper, we investigate the femto-macro cell interference mitigation in OFDMA system. We propose dynamic downlink resource management scheme which adjust the transmitted power of femtocell according to the strength of received macrocell signal and allocates subcarrier to femtocells in a dynamic manner. In this way, the interference between the macrocell users and femtocells is reduced. The simulation results show that proposed scheme enhances both macrocell and femtocell throughputs.

• Journal of Advanced Navigation Technology
• /
• v.15 no.3
• /
• pp.392-404
• /
• 2011

In this paper, we address the issue of joint detection schemes for uplink cellular system when base station cooperation is possible for multi-user detection in multi-cell scenario. The ZF, ML, MMSE and SIC detection are analyzed and evaluated as a conventional scheme. ML attains the optimal performance but the complexity increases exponentially, ZF/MMSE have simple structure but have poor detection performance and SIC has better performance but it has large complexity and potential of the error propagation. However, they need the increased decoder complexity as the number of iteration is increased. We propose a new joint ML and ZF/MMSE detection scheme, which combines the partial ML decoding and ZF/MMSE detection, in order to decrease the decoder complexity. Simulation results show that the proposed scheme attains same or a little bit better BER performance and expect reduced decoder complexity, specially in the case of large number of Base Station are cooperated each other.