TY - GEN
T1 - Timing-free code-aided blind adaptive joint MAI and ISI suppression in dispersive CDMA channels
AU - Buzzi, Stefano
AU - Lops, Marco
AU - Poor, H. Vincent
PY - 2002/1/1
Y1 - 2002/1/1
N2 - The problem of joint multiaccess interference (MAI) and intersymbol interference (ISI) suppression in DS/CDMA systems operating over fading dispersive channels is considered. A timing-free, blind and code-aided detection algorithm is proposed, i.e. the procedure requires knowledge of neither the interfering users' parameters (spreading codes, timing offsets and propagation channels), nor the timing and channel impulse response of the user of interest, but only of its spreading code. The proposed structure is a two-stage one. The first stage is aimed at suppressing the multiuser interference, while the second-stage performs channel estimation and data detection. The proposed system is shown to incur a very limited loss with respect to the non blind MMSE detector; moreover, it outperforms other previously known blind systems, and is near-far resistant. A major advantage of the new structure is that it admits an adaptive implementation with quadratic (in the processing gain) computational complexity. This adaptive algorithm, which couples a recursive-leastsquares estimation of the blocking matrix and subspace tracking techniques, achieves effective steady-state performance.
AB - The problem of joint multiaccess interference (MAI) and intersymbol interference (ISI) suppression in DS/CDMA systems operating over fading dispersive channels is considered. A timing-free, blind and code-aided detection algorithm is proposed, i.e. the procedure requires knowledge of neither the interfering users' parameters (spreading codes, timing offsets and propagation channels), nor the timing and channel impulse response of the user of interest, but only of its spreading code. The proposed structure is a two-stage one. The first stage is aimed at suppressing the multiuser interference, while the second-stage performs channel estimation and data detection. The proposed system is shown to incur a very limited loss with respect to the non blind MMSE detector; moreover, it outperforms other previously known blind systems, and is near-far resistant. A major advantage of the new structure is that it admits an adaptive implementation with quadratic (in the processing gain) computational complexity. This adaptive algorithm, which couples a recursive-leastsquares estimation of the blocking matrix and subspace tracking techniques, achieves effective steady-state performance.
UR - http://www.scopus.com/inward/record.url?scp=0038183658&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0038183658&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2002.993326
DO - 10.1109/WCNC.2002.993326
M3 - Conference contribution
AN - SCOPUS:0038183658
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 542
EP - 548
BT - IEEE Wireless Communications and Networking Conference, WCNC
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2002 IEEE Wireless Communications and Networking Conference, WCNC 2002
Y2 - 17 March 2002 through 21 March 2002
ER -