By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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 maximum-likelihood sequence estimation is demonstrated for wireless channels. We suggest an exact recursive solution as well as a new iterative solution. In both solutions, the computational complexity of calculating the prefilter coefficients is O(LWMF) with respect to LWMF, where LWMF is the number of prefilter coefficients. For comparison, the complexity of the original algorithm is O(LWMF3).

Published in:

Wireless Communications, IEEE Transactions on  (Volume:3 ,  Issue: 6 )