By Topic

A fast cell search algorithm using code block CPM in asynchronous W-CDMA system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jung-Hyun Choi ; Dept. of Inf. Eng., Ewha Univ., Seoul, South Korea ; Nak-Myeong Kim ; So-Yeong Park

The asynchronous mode W-CDMA system is known to be appropriate for the next generation mobile communication system, especially in a non-homogeneous cellular architecture. In this case, however, each base station needs to use a different spreading code for identification, so it is a demanding 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 (CPM) within a code block is proposed. Different cell sites are identified by different hopping code sequences, and each 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

Published in:

Vehicular Technology Conference, 2000. IEEE-VTS Fall VTC 2000. 52nd  (Volume:1 )

Date of Conference: