• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제28권8A호
• /
• pp.598-606
• /
• 2003

In this paper, we analyze the performance of the PCM cell search algorithm proposed for fast cell search of WCDMA systems. In order to improve both performance and complexity of the cell search algorithm standardized for WCDMA systems the PCM scheme uses a group of the polarization codes produced by a Gold code generator. The PCM scheme only uses one synchronization channel since the polarization codes modulated on P-SCH can replace the RS codes of S-SCH. Thus, the PCM reduces the BS's transmission power since only one synchronization channel can be used, and it can also reduce the complexity of receiver as compared with the conventional one. In this paper, by defining a numerical model, we analyze the performance of the PCM cell search algorithm in terms of detection probability and mean acquisition time. Consequently, we could demonstrate that the PCM cell search algorithm is superior to the standard WCDMA cell search algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제27권8B호
• /
• pp.809-818
• /
• 2002

In this paper, we propose a fast cell search algorithm keeping compatible with the standard cell search algorithm of the WCDMA system. The proposed algorithm can acquire the synchronization of slot and frame times, and the code group identification using only one synchronization channel while the standard algorithm employs two synchronization channels called P-SCH and S-SCH. The proposed synchronization channel structure is the same as the P-SCH structure of the WCDMA system. However, the P-SCH is modulated with a specific polarization code, which is one element of new code group codes. The proposed algorithm can reduce both the BS' transmission power and the complexity of receiver as compared with the conventional one since only on synchronization channel is used. It is shown through the computer simulation that the proposed algorithm yields a significant improvement in terms of cell search time compared with the standard especially in low SNR environments.

• Information and Communications Magazine
• /
• 제16권4호
• /
• pp.68-74
• /
• 1999

본 논문에서는 최근 IMT-2000을 위한 무선 전송 규격에 반영된 SK 텔레콤의 기술을 설명한다. SK 텔레콤에서는 역방향 다중 접속에 의한 간섭량을 줄이기 위한 기술로서 기지국에서 이동국의 송신 타이밍을 조절하는 '역방향 동기식 전송방식(RSTS : Reverse link Synchronous Transmission Scheme)'을 ITU에 제안하여 현재 W-CDMA의 표준으로 채택되었다. 또한 기지국간 비동기 방식에서 셀 탐색을 위한 방법으로 '클러스터 파일럿과 셀파일럿을 이용한 다단계 셀 탐색 방법'을 제안하여 W-CDMA의 다단게 셀 탐색 방법의 기본 개념을 제시한 바 있다. 본 논문에서는 국제 표준에 반영된이 두가지 방법에 대한 알고리즘을 설명하고 동기식 전송 방식으로 얻게 되는 역방향 다중 접속 간섭량의 감소를 시물레이션을 통해 보인다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제15권1호
• /
• pp.157-162
• /
• 2011

In this paper, we propose enhanced methods of path finding based on an abstract graph with extension of search space to improve the quality of path. The proposed methods that are called simple buffering method, velocity constrained method and distance constrained method are to extract buffering-cells for using search space with valid-cells. The simple buffering method is to extract adjacent cells of valid-cells as buffering-cells. velocity constrained method and distance constrained method are based on simple buffering method, these eliminate buffering-cells through each of threshold. In experiment, proposed methods can improve the quality of path. The proposed methods are applicable to develop various kinds of telematics application, such as path finding and logistics.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.147-150
• /
• 2008

The real road network is regarded as a grid, and the grid is divided by fixed-sized cells. The path-finding is composed of two step searching. First searching travels on the abstract graph which is composed of a set of psuedo vertexes and a set of psuedo edges that are created by real road network and fixed-sized cells. The result of the first searching is a psuedo path which is composed of a set of selected psuedo edges. The cells intersected with the psuedo path are called as valid cells. The second searching travels with $A^*$ algorithm on valid cells. As pruning search space by removing the invalid cells, it would be possible to reduce the cost of exploring on real road network. In this paper, we present the method of creating the abstract graph and propose a path-finding algorithm on the abstract graph for extracting search space before traveling on real road network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제27권2B호
• /
• pp.125-136
• /
• 2002

It is very important to acquire the synchronization in a intercell asynchronous WCDMA system, and it is carried out through the three-step cell search process. The cell search can operate in a stepwise parallel manner, where each step works in pipelined operation, to reduce the cell search time. In case that the execution time is set to be the same in each step, excessive accumulations will be caused in both step 1 and step 3, because step 2 should take at least one frame for its processing. In general, the effect of post-detection integration becomes saturated as the number of the accumulations increases. Therefore, the stepwise parallel scheme does not give much enhancement. In this paper, the performance of the stepwise parallel processing for cell search in WCDMA system is analyzed over Rayleigh fading channels. Through the analysis, the effect of cell search parameters such as the number of accumulations in each step and the power ratio allocated among channels is investigated. In addition, the performance of the stepwise parallel cell search is improved by adjusting the execution time appropriately for each step and is compared with that of the conventional stepwise serial processing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제27권1B호
• /
• pp.24-33
• /
• 2002

The cell search scheme for W-CDMA consists of the following three stages: slot synchronization(1st stage), group identification and frame boundary detection(2nd stage), and long code identification(3rd stage). The performance of the cell search when a mobile station is switched on, which is referred to as initial cell search, is decreased by the initial frequency and timing error. In this paper, we propose the pipeline structured initial cell search scheme using time trackers to compensate for the impact of the initial timing error in the stage 2 and stage 3. The simulation results show that the performance of the proposed scheme is maximal 1.5dB better than that of the conventional one when the initial timing error is near ${\pm}T_c$/2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제29권1A호
• /
• pp.65-76
• /
• 2004

In this paper, a novel preamble structure, including a synchronization preamble and a cell search preamble, is proposed for OFDM-based cellular systems. An efficient algorithm for downlink synchronization and cell searching using the preamble is also proposed. The synchronization process includes the initial symbol timing estimation using continuously, or at least, periodically transmitted downlink signal, frame synchronization, the fine symbol timing estimation, and the frequency offset estimation using the synchronization preamble, and the cell identification using the cell searching preamble. Performance of each synchronization and cell searching step is analyzed and the analytic results including the overall performance of the synchronization and cell searching are verified by computer simulation. It is shown that the proposed preamble with the corresponding synchronization and cell searching algorithm can provide very robust synchronization and cell searching capability even in bad cellular environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제38A권1호
• /
• pp.44-57
• /
• 2013

In this paper, we propose a femtocell searching technique which can prevent a macrocell UE(user equipment) from losing synchronism to its serving macrocell near closed access femtocells in co-channel deployment due to the leakage of femtocell signals by using a CS(Common Signal). The CS, commonly transmitted by femtocells in a macrocell at the same time, enables the macrocell UEs to be kept synchronized with their serving macrocells since the CINR(Carrier to Interference and Noise Ratio) of base stations in macrocell can be kept high even near closed access femtocells. Also, the CS is designed in such a way that a macrocell UE can recognize the existence of femtocell by using the metric CSCINR(Common Signal Carrier to Interference and Ratio) measured with CS. In addition, the proposed femtocell searching technique can reduce the frequency of femtocell searching trial by using the metric on mobility of a macrocell UE defined in this paper, and the reduction of the frequency of handover trial can be also expected as a byproduct.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제11권1호
• /
• pp.139-149
• /
• 2007

Asynchronous OFCDM(Orthogonal Frequency and Code Division Multiplexing) systems must have a cell search process necessarily unlike synch개nous systems. this process is hewn initial synchronization and a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC(Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification group code with two or three block of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions. however, the effect of the reduction complexity leads to degradation of the performance therefore, look for combination to have the most minimum degradation. the proposed block type group code with suitable combinations is the nearly sane performance as conventional group code and has a complexity reduction that is to be compared and verified through the computer simulation.