Root-MUSIC Based Joint Identification and Timing Estimation of Asynchronous CDMA System over Rayleigh Fading Channel
Summary :
An efficient algorithm is proposed to identify the active users and extracting their respective timing information in asynchronous direct sequence CDMA (DS-CDMA) communication system over Rayleigh fading channel. The joint identification and timing estimation algorithm is derived by performing discrete Fourier transform (DFT) on the observation vector and exploiting the uniqueness and nullity characteristics of the root-MUSIC test polynomial. The root-MUSIC based algorithm is shown to be asymptotically near-far resistant. Compared to the maximum a posteriori (MAP) or maximum likelihood (ML) based multiuser timing estimator, the complexity is greatly reduced by separating the multi-dimensional optimization problem into several polynomial rooting problems. Moreover, we characterize the dependence of system performance with respect to signature sequence length, number of active users, window size, desired user's signal-to-noise ratio (SNR) and crosscorrelation property of the code structure. The analytical results reveal that under the uncorrelated Rayleigh fading model, the root-MUSIC timing estimator tends to achieve the Cramer-Rao lower bound (CRLB) at interesting signature sequence length and desired user's SNR.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.8 pp.1550-1559
- Publication Date
- 1998/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Digital Signal Processing)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Wei-Chiang WU, Kwang-Cheng CHEN, "Root-MUSIC Based Joint Identification and Timing Estimation of Asynchronous CDMA System over Rayleigh Fading Channel" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 8, pp. 1550-1559, August 1998, doi: .
Abstract: An efficient algorithm is proposed to identify the active users and extracting their respective timing information in asynchronous direct sequence CDMA (DS-CDMA) communication system over Rayleigh fading channel. The joint identification and timing estimation algorithm is derived by performing discrete Fourier transform (DFT) on the observation vector and exploiting the uniqueness and nullity characteristics of the root-MUSIC test polynomial. The root-MUSIC based algorithm is shown to be asymptotically near-far resistant. Compared to the maximum a posteriori (MAP) or maximum likelihood (ML) based multiuser timing estimator, the complexity is greatly reduced by separating the multi-dimensional optimization problem into several polynomial rooting problems. Moreover, we characterize the dependence of system performance with respect to signature sequence length, number of active users, window size, desired user's signal-to-noise ratio (SNR) and crosscorrelation property of the code structure. The analytical results reveal that under the uncorrelated Rayleigh fading model, the root-MUSIC timing estimator tends to achieve the Cramer-Rao lower bound (CRLB) at interesting signature sequence length and desired user's SNR.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_8_1550/_p
Copy
@ARTICLE{e81-a_8_1550,
author={Wei-Chiang WU, Kwang-Cheng CHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Root-MUSIC Based Joint Identification and Timing Estimation of Asynchronous CDMA System over Rayleigh Fading Channel},
year={1998},
volume={E81-A},
number={8},
pages={1550-1559},
abstract={An efficient algorithm is proposed to identify the active users and extracting their respective timing information in asynchronous direct sequence CDMA (DS-CDMA) communication system over Rayleigh fading channel. The joint identification and timing estimation algorithm is derived by performing discrete Fourier transform (DFT) on the observation vector and exploiting the uniqueness and nullity characteristics of the root-MUSIC test polynomial. The root-MUSIC based algorithm is shown to be asymptotically near-far resistant. Compared to the maximum a posteriori (MAP) or maximum likelihood (ML) based multiuser timing estimator, the complexity is greatly reduced by separating the multi-dimensional optimization problem into several polynomial rooting problems. Moreover, we characterize the dependence of system performance with respect to signature sequence length, number of active users, window size, desired user's signal-to-noise ratio (SNR) and crosscorrelation property of the code structure. The analytical results reveal that under the uncorrelated Rayleigh fading model, the root-MUSIC timing estimator tends to achieve the Cramer-Rao lower bound (CRLB) at interesting signature sequence length and desired user's SNR.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Root-MUSIC Based Joint Identification and Timing Estimation of Asynchronous CDMA System over Rayleigh Fading Channel
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1550
EP - 1559
AU - Wei-Chiang WU
AU - Kwang-Cheng CHEN
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 1998
AB - An efficient algorithm is proposed to identify the active users and extracting their respective timing information in asynchronous direct sequence CDMA (DS-CDMA) communication system over Rayleigh fading channel. The joint identification and timing estimation algorithm is derived by performing discrete Fourier transform (DFT) on the observation vector and exploiting the uniqueness and nullity characteristics of the root-MUSIC test polynomial. The root-MUSIC based algorithm is shown to be asymptotically near-far resistant. Compared to the maximum a posteriori (MAP) or maximum likelihood (ML) based multiuser timing estimator, the complexity is greatly reduced by separating the multi-dimensional optimization problem into several polynomial rooting problems. Moreover, we characterize the dependence of system performance with respect to signature sequence length, number of active users, window size, desired user's signal-to-noise ratio (SNR) and crosscorrelation property of the code structure. The analytical results reveal that under the uncorrelated Rayleigh fading model, the root-MUSIC timing estimator tends to achieve the Cramer-Rao lower bound (CRLB) at interesting signature sequence length and desired user's SNR.
ER -
English
