TY - GEN
T1 - On the performance of certain fixed-complexity multiuser detectors in fext-limited vectored DSL systems
AU - Latsoudas, Georgios
AU - Sidiropoulos, Nicholas D.
PY - 2005/1/1
Y1 - 2005/1/1
N2 - Multiple-input multiple-output (MIMO) communication has recently attracted considerable interest for transmission over multiple twisted copper pairs in a common binder. The motivation is to overcome the limitations imposed by crosstalk, and thus boost capacity. Far-end crosstalk (FEXT) is the dominant impairment in frequency-division duplex (FDD) digital subscriber line (DSL) systems. While the per-tone MIMO channel matrix is diagonally dominated in this context, noise is colored due to alien FEXT, which is particularly pronounced for short DSL loops - such as those encountered in fiber to the curb (FTTC) or fiber to the basement (FTTB) architectures. This calls for effective multiuser detection strategies at the receiver. We test three candidate detection algorithms (probabilistic data association, sphere decoding, and a recently proposed hybrid thereof) using measured channel data for 300 meter cable, and a fixed upper bound on vector decoding complexity. The results indicate that, when half of the loops in the binder are coordinated, contrary to the case of Rayleigh fading wireless channels, the sphere decoder provides the best performance even when a pragmatic complexity restriction is employed.
AB - Multiple-input multiple-output (MIMO) communication has recently attracted considerable interest for transmission over multiple twisted copper pairs in a common binder. The motivation is to overcome the limitations imposed by crosstalk, and thus boost capacity. Far-end crosstalk (FEXT) is the dominant impairment in frequency-division duplex (FDD) digital subscriber line (DSL) systems. While the per-tone MIMO channel matrix is diagonally dominated in this context, noise is colored due to alien FEXT, which is particularly pronounced for short DSL loops - such as those encountered in fiber to the curb (FTTC) or fiber to the basement (FTTB) architectures. This calls for effective multiuser detection strategies at the receiver. We test three candidate detection algorithms (probabilistic data association, sphere decoding, and a recently proposed hybrid thereof) using measured channel data for 300 meter cable, and a fixed upper bound on vector decoding complexity. The results indicate that, when half of the loops in the binder are coordinated, contrary to the case of Rayleigh fading wireless channels, the sphere decoder provides the best performance even when a pragmatic complexity restriction is employed.
UR - http://www.scopus.com/inward/record.url?scp=33645673577&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33645673577&partnerID=8YFLogxK
U2 - 10.1109/ICASSP.2005.1415853
DO - 10.1109/ICASSP.2005.1415853
M3 - Conference contribution
AN - SCOPUS:33645673577
SN - 0780388747
SN - 9780780388741
T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
SP - III889-III892
BT - 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing,ICASSP '05 - Proceedings - Audio and ElectroacousticsSignal Processing for Communication
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '05
Y2 - 18 March 2005 through 23 March 2005
ER -