TY - JOUR
T1 - Filterbank-based blind code synchronization for DS-CDMA systems in multipath fading channels
AU - Li, Hongbin
AU - Wang, Rensheng
PY - 2003/1
Y1 - 2003/1
N2 - We present a filterbank approach to blind code synchronization for asynchronous direct-sequence (DS) code-division multiple-access (CDMA) systems. The key idea of the proposed scheme is to first pass the received signal through a bank of filters, which are designed to enhance signals of interest and suppress interference/noise, and then to derive the code timing from the filtered data. The only required knowledge by the proposed filterbank scheme is the spreading code of the desired user. It can be used in various environments, including frequency-nonselective and frequency-selective, time-invariant, and time-varying fading channels. It can deal with colored channel noise and unmodeled interference, such as inter-cell interference (ICI) and narrowband interference. It has relatively low complexity and can be readily implemented using standard adaptive algorithms. We show that under mild conditions, the proposed scheme yields statistically consistent [in signal-to-noise ratio (SNR)] code timing estimates, irrespective of the strength of the interference and with only a finite number of data samples. We also derive an unconditional Cramtr-Rao bound (UCRB), which serves as a lower bound for all unbiased blind code synchronization schemes. Numerical results indicate that the proposed scheme compares favorably with a popular subspace-based method in terms of user capacity, near-far resistance, and robustness to time-varying fading and unmodeled interference.
AB - We present a filterbank approach to blind code synchronization for asynchronous direct-sequence (DS) code-division multiple-access (CDMA) systems. The key idea of the proposed scheme is to first pass the received signal through a bank of filters, which are designed to enhance signals of interest and suppress interference/noise, and then to derive the code timing from the filtered data. The only required knowledge by the proposed filterbank scheme is the spreading code of the desired user. It can be used in various environments, including frequency-nonselective and frequency-selective, time-invariant, and time-varying fading channels. It can deal with colored channel noise and unmodeled interference, such as inter-cell interference (ICI) and narrowband interference. It has relatively low complexity and can be readily implemented using standard adaptive algorithms. We show that under mild conditions, the proposed scheme yields statistically consistent [in signal-to-noise ratio (SNR)] code timing estimates, irrespective of the strength of the interference and with only a finite number of data samples. We also derive an unconditional Cramtr-Rao bound (UCRB), which serves as a lower bound for all unbiased blind code synchronization schemes. Numerical results indicate that the proposed scheme compares favorably with a popular subspace-based method in terms of user capacity, near-far resistance, and robustness to time-varying fading and unmodeled interference.
KW - Code division multiple access
KW - Code synchronization
KW - Cramér-Rao bound (CRB)
KW - Interference suppression
KW - Parameter estimation
UR - http://www.scopus.com/inward/record.url?scp=0037232644&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037232644&partnerID=8YFLogxK
U2 - 10.1109/TSP.2002.806565
DO - 10.1109/TSP.2002.806565
M3 - Article
AN - SCOPUS:0037232644
SN - 1053-587X
VL - 51
SP - 160
EP - 171
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 1
ER -