Fast Cell Search Algorithm using Polarization Code Modulation (PCM) in WCDMA Systems 


Vol. 27,  No. 8, pp. 809-818, Aug.  2002


PDF
  Abstract

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 one 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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Bae and J. Lim, "Fast Cell Search Algorithm using Polarization Code Modulation (PCM) in WCDMA Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 8, pp. 809-818, 2002. DOI: .

[ACM Style]

Sung-oh Bae and Jae-sung Lim. 2002. Fast Cell Search Algorithm using Polarization Code Modulation (PCM) in WCDMA Systems. The Journal of Korean Institute of Communications and Information Sciences, 27, 8, (2002), 809-818. DOI: .

[KICS Style]

Sung-oh Bae and Jae-sung Lim, "Fast Cell Search Algorithm using Polarization Code Modulation (PCM) in WCDMA Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 8, pp. 809-818, 8. 2002.