• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.611-617
• /
• 2000

Asynchronous mode W-CDMA system is kmown to be quite appropriate to the next generation mobile communication system, especially in a non-homogenious cellular architecture. In this case, however, each base station needs to use different spreading code for identification, so it is a demeanding task for a mobile terminal to find the best cell site and get an accurate code synchronization at the beginning of a communication. Since slow acquisition of a base station could mean the failure of initiation, a fast algorithm to accelerate the cell search process is essential. In this paper, a new cell search algorithm based on the binary code position modulation within the code block is proposed. Different cell sites are identified by different hopping code sequences, andeach position modulation is performed by the hopping code. The proposed algorithm is proved to make the cell search time in most places in a cell much shorter than the previous algorithms, and to make the receiver implementation simpler.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9A
• /
• pp.664-672
• /
• 2009

In this paper, joint methods of cell searching and Direction-of-Arrival (DoA) estimation for a mobile relay station with a uniform circular array are proposed. The proposed joint estimation method for the mobile relay station is robust even when there exist symbol timing offsets between the signals received from adjacent base stations. Also, the proposed joint estimation method can reduce computational complexity and processing time, compared with the case where cell searching and DoA estimation are performed separately. Performances of the proposed method are evaluated by computer simulation under Mobile WiMAX environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.267-275
• /
• 2003

In UMTS terminal modem uses 3 step search procedure for initial cell search, which comprises 1) slot synchronization, 2) code group identification and frame synchronization, and 3) scrambling-code identification. The performance of initial cell search procedure depends on search parameters like observation time and threshold. The purpose of this paper is to get the optimal observation time and threshold of each step for minimum mean acquisition time. In this paper we induce mean detection time of each step and mean acquisition timefrom the model of 3 step search procedure using state diagram. Also we propose initial cell search algorithm which utilize window search method against initial oscillator error, and select an appropriate observation time and threshold of each step by the analysis of simulation and induced result. It is shown that the mean acquisition time in multipath fading channel can be shorter than 500ms by using the determined observation time and threshold of each step.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1649-1655
• /
• 2005

For systems with coexisting cellular and hot-spot cells in broadband orhogonal frequency and code division multiplexing (OFCDM) systems, a suitable cell search algorithm is proposed fur the common pilot channel (CPICH) in the forward link using separated I/Q channel cell specific codes(CSSC), in which the cellular cell specific scrambling code (CCSSC) is assigned to the in-phase (Q) pilot channel of all cellular cells, and the exclusive hot-spot cell specific scrambling code (HSCSSC) group is assigned to the quadrature (Q) pilot channel of all hot-spot cells. Therefore, the proposed algorithm enables a mobile station (MS) to search quickly for the most desirable hot-spot cell due to reducing the effect of CCSSC, when a MS wants to use a mobile internet. The computer simulation results show that the proposed cell search algorithm can achieve faster cell search time performance, compared to conventional cell search methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.46-49
• /
• 2007

데이터 스트림이란, 빠른 속도로 지속적으로 생성되는 무한한 크기의 방대한 양의 데이터 집합으로 정의된다. 본 연구에서는 데이터 스트림 분석을 위한 데이터 스트림 격자 기반 클러스터링 기법을 제시한다. 주어진 초기 격자셀에 대해, 데이터 객체의 빈도가 높은 범위를 반복적으로 보다 작은 크기의 격자셀로 분할하여 최소 크기의 격자셀, 단위 격자셀을 생성한다. 격자셀에서는 데이터 객체들의 분포에 대한 통계값만을 저장하여, 기존의 클러스터링 기법에 비해 데이터 객체에 대한 탐색없이 효율적으로 클러스터를 찾을 수 있다.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.31-40
• /
• 1998

본 연구의 목적은 기존의 Cell Transmission(1994, Daganzo) 교통류 이론을 기반으로 동적통행배정 모형을 개발하는 것이다. 이 모형은 동적 O-D 발생모듈, HOV 차선모듈, 분류부 분할모델, 링크비용함수 모듈, 최단경로 탐색 모듈등으로 구성된다. 이 모델에서 적용하는 교통류 모델은 각 링크를 동일한 특성을 가지는 셀로 구분하여 셀내의 진입시간과 진출시간을 계산하여 링크비용을 계산하는데 이것은 비용의 과대·과소 추정을 피할 수 있으며 교통지체 현상을 현실적으로 표현해 줄 수 있는 장점이 있다. 또한 HOV 차선 모듈에 의해 수단별 교통류 진행 및 비용고려가 가능하며 HOV 차선의 평가 및 분석이 가능하다. 기존의 동적통행배정모형은 매 시간대별 출발지에서 균형상태를 추구하는 통행배정기법을 사용하고 있지만 이 모델은 분류되는 노드를 가상의 출발점이라고 가정하여 각 시간대별로 최단경로를 탐색하여 균형상태를 추구해나가는 기법을 적용하고 있다. 각 셀별 차량을 목적지별, 차종별, 대기시간별로 추적하여 진행시키며 분류부에서는 최단경로를 탐색하여 배분된다. 또한 진행하고자 하는 셀의 용량과 현재 셀의 밀도를 고려함으로서 용량제약 하에서의 동적통행배정모형을 적용하고 있다. 이 모형은 고속로의 합류부 및 분류부의 교통특성을 세밀히 분석할 수 있으며, TCS 및 램프미터링과 접목하여 고속도로 운영에 이용될 수 있으며, 고속도로 중·장기적인 계획에 이용될 수 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.827-829
• /
• 2015

This paper presents process of the UE obtains the cell system information in order to achieve communication with the LTE network on the LTE. This paper deals with the process of extracting MIB(Master Information Block) cell system information in LTE. To study the 3GPP LTE standard spec series 36.200 and 36.300, the simulation is implemented to extract the MIB in MATLAB program. The simulation process is divided into three parts. It consisted of a part that extracts the PSS, SSS and MIB. Called a cell search process for detecting the PSS and SSS, the process is to be done in order to extract only the cell system information. The simulation program is verified based on the signal captured from the real Air.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6C
• /
• pp.530-538
• /
• 2010

In this paper, estimation methods of cell searching and DoA (Direction of Arrival) for mobile relay stations with a uniform linear array are proposed. The proposed methods can improve the performance of cell searching and DoA estimation by removing the effect of STOs when there exist symbol timing offsets (STOs) between the signals received from adjacent base stations,. Also, the proposed methods can improve the performance of DoA estimation significantly when there exists Doppler frequency shift caused by movement of the mobile relay station. The performances and computational complexities of the proposed cell searching and DoA methods are evaluated by computer simulation under Mobile WiMAX environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9A
• /
• pp.656-663
• /
• 2009

In 3GPP LTE system downlink, PSS (primary synchronization signal) and SSS (secondary synchronization signal) sequences are used for initial cell search and synchronization. UE (user equipment) detects slot timing, frequency offset, and cell ID by using PSS. After that it should detect frame timing, cell group ID, and CP length by using SSS. But in 3GPP LTE, there are two kinds of CP length, so we should operate FFT twice. In this paper, to minimize SSS detection complexity in cell searcher, we propose a CP length pre-decision algorithm that reduces the arithmetical complexity by half at most, with negligible performance degradation.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.239-244
• /
• 2000

영상공간에서의 역 해프토닝 성능을 향상시키기 위해서는 정확한 해프톤 셀 정보를 기반으로 최적의 평활화 마스크가 생성되어야 한다. 이에 본 논문에서는, 퓨리에 공간에서 피크형태와 영상공간에서의 해프토닝 특성을 이용해서 정확한 해프톤 셀 정보를 추출하는 새로운 방법을 제안한다. 제안한 방법은 차원분해(dimension decomposition)와 제한된 구간의 자동 탐색에 의해 정확한 해프톤 셀 정보를 효율적으로 추출하므로 역 해프토닝의 성능을 향상 시키며, 전체 영상에서 오차의 누적없이 셀 중심(seed pixel)을 정확하게 찾는 것을 실험을 통해 확인하였다. 정확한 해프톤 셀 정보는 셀 단위의 연산이나 해프톤 영상의 채널 분리 및 모아레 패턴의 존재 여부 판정 시 활용할 수 있다.