A Fast Cell Search Algorithm for Inter-Cell Asynchronous W-CDMA System using Code Hopped Orthogonal Pilot
4
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, we propose a new method for fast cell search for inter-cell asynchronous W-CDMA system. This method utilizes a code hopping technique to distinguish each cell, that is, each cell is identified by cell specific M-ary hopping code and this hopping code is used to hop some of binary code pairs. There are M+1 binary code pairs, one pair out of M+1 binary code pairs is used as a common binary code and the rest are used as the alphabets of the Mary hopping codes. This proposal uses a subset of R-S codewords as M-ary hopping codes and uses extended Gold codes as binary codes. A mobile station searches the initial phase of pilot PN sequence by using a common binary code matched filter, then identifies M-ary hopping code using the M-ary parallel correlators. The mobile station can identify the hopping code by checking only k elements among total hopping code of length L (where k is the maximum number of overlaps between any two hopping codes). With these good properties the mobile station can be quickly synchronized with the pilot PN sequence even if there is no group identity coding concept. We present some simulation results and compare the properties of the proposed method with that of the previously proposed method. The concept of this proposal was introduced in TTA proposal II for IMT-2000 RTT[1].
Abstract
In this paper, we propose a new method for fast cell search for inter-cell asynchronous W-CDMA system. This method utilizes a code hopping technique to distinguish each cell, that is, each cell is identified by cell specific M-ary hopping code and this hopping code is used to hop some of binary code pairs. There are M+1 binary code pairs, one pair out of M+1 binary code pairs is used as a common binary code and the rest are used as the alphabets of the Mary hopping codes. This proposal uses a subset of R-S codewords as M-ary hopping codes and uses extended Gold codes as binary codes. A mobile station searches the initial phase of pilot PN sequence by using a common binary code matched filter, then identifies M-ary hopping code using the M-ary parallel correlators. The mobile station can identify the hopping code by checking only k elements among total hopping code of length L (where k is the maximum number of overlaps between any two hopping codes). With these good properties the mobile station can be quickly synchronized with the pilot PN sequence even if there is no group identity coding concept. We present some simulation results and compare the properties of the proposed method with that of the previously proposed method. The concept of this proposal was introduced in TTA proposal II for IMT-2000 RTT[1].