By Topic

Reduced complexity equalization of MIMO systems with a fixed-lag smoothed M-BCJR algorithm

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

4 Author(s)
Vithanage, C.M. ; Dept. of Math., Bristol Univ., UK ; Andrieu, C. ; Piechocki, R.J. ; Yee, M.S.

M-BCJR algorithm is a reduced state version of the BCJR algorithm and selects a set of active states in the forward recursion based on an estimation of the filtered probability distribution of states at each time. We propose to use instead an estimation of the fixed-lag smoothed probability distribution of states with a non zero lag. Our implementation uses a Gaussian approximation to estimate these distributions with a low complexity, using the principle of probabilistic data association (PDA). The performance of the M-BCJR can be seen to be greatly improved as a result while remaining robust against changes in the channel multipath profile.

Published in:

Signal Processing Advances in Wireless Communications, 2005 IEEE 6th Workshop on

Date of Conference:

5-8 June 2005