By Topic

Reduced-Complexity Time-Domain Equalization for Turbo-MIMO Systems

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)
de Jong, Y.L.C. ; Commun. Res. Centre Canada, Ottawa ; Willink, T.J.

A reduced-complexity time-domain equalization scheme for wideband turbo-multiple-input multiple-output (turbo-MIMO) systems is presented. This scheme, called iterative trellis search equalization, is based on a modified version of the M-Bahl-Cocke-Jelinek-Raviv (M-BCJR) algorithm, applied to a suitably chosen trellis representation of the wideband MIMO channel process. Exploiting the properties of quadrature amplitude modulation (QAM) signal constellations with block-partitionable labels, this modified M-BCJR algorithm has complexity per bit that is independent of the constellation size, and polynomial in the number of transmit antennas and channel memory. Results from computer simulations show that the new scheme successfully mitigates intersymbol interference even if only a very small fraction of trellis state transitions is considered. It is also demonstrated that asynchronous transmission of the spatially multiplexed symbol streams can result in considerable performance improvement compared to synchronous MIMO systems.

Published in:

Communications, IEEE Transactions on  (Volume:55 ,  Issue: 10 )