Constraints in channel shortening equalizer design for DMT-based systems

Authors:
Geert Ysebaert;Katleen Van Acker;Marc Moonen;Bart De Moor
Affiliations:
ESAT/SISTA-Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium;Access to Networks, Research and Innovation, ALCATEL, B-2018 Antwerpen, Belgium;ESAT/SISTA-Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium;ESAT/SISTA-Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium
Venue:
Signal Processing
Year:
2003

Citing 4
Cited 1

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Equalization for discrete multitone transceivers to maximize bitrate

IEEE Transactions on Signal Processing
Efficiently computed reduced-parameter input-aided MMSE equalizers for ML detection: a unified approach

IEEE Transactions on Information Theory
Equalization for DMT based broadband modems

IEEE Communications Magazine

Time-domain and frequency-domain per-tone equalization for OFDM over doubly selective channels

Signal Processing - Signal processing in communications

Quantified Score

Hi-index	0.08

Visualization

Abstract

In discrete multitone receivers, a time domain equalizer (TEQ) is used to shorten the channel impulse response, so that the equalized channel impulse response is shorter than the inserted prefix. The aim of this paper is to show that the minimum mean square error (MMSE) channel shortening problem with two different energy constraints, remarkably, lead to the same TEQ coefficients, up to a scaling factor. Moreover, implying the two energy constraints together in the MMSE optimization again yields the same result and comes down to a canonical correlation analysis between the subspace spanned by the transmitted samples and the received samples, respectively. Hence, the TEQ obtained by these three distinct MMSE cases yields the same performance in terms of bit rate. Since the resulting problem can easily be reformulated as a maximization problem, an iterative procedure based on power iterations can be devised to reduce the computational complexity.