Fast computation of a discrete-time whitened matched filter based on Kalman filtering.

Fast computation of a discrete-time whitened matched filter based on Kalman filtering.

In this paper, fast techniques for computing the coefficients of a Kalman-based prefilter originally developed by Mulgrew are proposed. This prefilter approximates a minimum-phase overall impulse response. In conjunction with a reduced-complexity equalizer, near optimum performance compared to maxim...

Description complète

Détails bibliographiques
Publié dans:IEEE Transactions on wireless communications 3, 6 (2004).
Auteur principal: Badri-Hoeher, S.
Format: Article
Langue:English
Sujets:
FIR filter.
Adaptive Kalman filtering.
Computational complexity.
Discrete-time whitened matched filter.
Fast computation technique.
Impulse response.
Iterative method.
Maximum-likelihood sequence estimation.
Reduced-complexity equalizer.
Spectral factorization.
Transversal filter.
Wireless channel.