DocumentCode
1462561
Title
Joint detection with low computational complexity for hybrid TD-CDMA systems
Author
Benvenuto, Nevio ; Sostrato, Giovanna
Author_Institution
Dipartimento di Elettronica e Inf., Padova Univ., Italy
Volume
19
Issue
2
fYear
2001
fDate
2/1/2001 12:00:00 AM
Firstpage
245
Lastpage
253
Abstract
In the hybrid multiple access technique time division-code division multiple access (TD-CDMA), both multiple-access interference and intersymbol interference (ISI) arise. In order to combat the overall interference, we propose four efficient joint detection schemes based on zero-forcing and minimum-mean square error criteria. By exploiting the Toeplitz-block structure of matrices and the asymptotic equivalence between finite-order Toeplitz matrices and circulant matrices, most computations can be carried out very efficiently through extensive use of discrete Fourier transform (DFT) and independent DFT (IDFT) transforms. Performance results based on the UMTS scenario are presented
Keywords
Toeplitz matrices; cellular radio; code division multiple access; computational complexity; discrete Fourier transforms; interference suppression; intersymbol interference; least mean squares methods; signal detection; time division multiple access; DFT; IDFT; ISI; Toeplitz-block structure; UMTS; asymptotic equivalence; circulant matrices; computational complexity; discrete Fourier transform; finite-order Toeplitz matrices; hybrid TD-CDMA systems; independent DFT; intersymbol interference; joint detection; minimum-mean square error criteria; multiple-access interference; time division-code division multiple access; zero-forcing; Computational complexity; Covariance matrix; Discrete Fourier transforms; Equalizers; Face detection; Fourier transforms; Intersymbol interference; Matrix decomposition; Multiple access interference; Receivers;
fLanguage
English
Journal_Title
Selected Areas in Communications, IEEE Journal on
Publisher
ieee
ISSN
0733-8716
Type
jour
DOI
10.1109/49.914502
Filename
914502
Link To Document