Cyclically permutable codes for rapid acquisition in DS-CDMA systems with asynchronous base stations

There has been significant interest in cellular systems employing direct sequence (DS) code division multiple access (CDMA), with no synchronization requirement between base stations (BS), especially in the context of the so-called third-generation (3G) wireless systems. In this case, since neighboring BSs use different spreading sequences, the mobile must first determine the spreading sequence being used by the BS(s) from which the mobile receives sufficiently strong signals. To facilitate acquisition, the total set of spreading sequences is divided into groups, and the group identification is transmitted over a synchronization channel. This paper describes a novel mechanism for transmitting the group identification (ID) using cyclically permutable (CP) codes; this scheme results in significant reduction in the search space, allowing for rapid acquisition. The technique described is currently a component of the radio access technology in the 3G partnership project (3GPP) proposal to the International Telecommunications Union (ITU) for 3G wireless systems (IMT-2000). An analysis of the three-stage search process required for acquisition and cell search is also presented, and simulation results are shown to demonstrate the efficacy of this approach.

[1]  A. Viterbi CDMA: Principles of Spread Spectrum Communication , 1995 .

[2]  Fumiyuki Adachi,et al.  Fast Cell Search Algorithm in Inter-Cell Asynchronous DS-CDMA Mobile Radio , 1998 .

[3]  John G. Proakis,et al.  Digital Communications , 1983 .

[4]  R. Blahut Theory and practice of error control codes , 1983 .

[5]  G. David Forney,et al.  Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.

[6]  Shutao Xia,et al.  Nonperiodic Cyclic Equivalence Classes of Cyclic Codes and Algebraic Constructions of Cyclically Permutable Codes , 1997, AAECC.

[7]  K. R. Matis,et al.  REDUCED-RESEARCH SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES. , 1982 .

[8]  J. W. Modestino,et al.  REDUCED-STATE SOFT-DECISION TRELLIS DECODING OF LINEAR BLOCK CODES. , 2022 .

[9]  S. Hosur,et al.  An analysis of the 3-stage search process in W-CDMA , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[10]  Y.-P. Eric Wang,et al.  Cell search in W-CDMA , 2000, IEEE Journal on Selected Areas in Communications.

[11]  R. Esmailzadeh,et al.  Comparison of cell search methods for asynchronous wideband CDMA cellular system , 1998, ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384).

[12]  B. Jabbari Wideband CDMA , 1998, IEEE Communications Magazine.

[13]  S. Sriram,et al.  Fast acquisition method for DS-CDMA systems employing asynchronous base stations , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[14]  M. Callendar IMT-2000 standards efforts of ITU , 1997 .

[15]  W. C. Jakes,et al.  Microwave Mobile Communications , 1974 .

[16]  Erik Dahlman,et al.  WCDMA-the radio interface for future mobile multimedia communications , 1998 .

[17]  J.L. Massey,et al.  Theory and practice of error control codes , 1986, Proceedings of the IEEE.