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

Abstract

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.