By Topic

Coding for multiple antennas with linear and nonlinear suboptimum interface

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

1 Author(s)
Biglieri, Ezio ; Politecnico di Torino, Italy

Summary form only given. Transmission and reception with multiple antennas is known to provide potentially enormous capacities. However, the receiver complexity may become impractical as the number of antennas increases above a certain limit; thus, it is interesting to derive suboptimum interfaces with limited complexity. Here we compare suboptimum linear and nonlinear interfaces to be used for decoding space-time codes transmitted over a multiple antenna Rayleigh fading channel, with perfect channel-state information available at the receiver. The performance of Vertical BLAST and that of linear receiver interfaces are examined with codes obtained by apportioning evenly among the transmit antennas the symbols of off-the-shelf convolutional codes. We first observe how the introduction of an interleaver can be beneficial here. Next, we introduce a new simple iterative linear interface, based on hard Viterbi decoding and offering a performance considerably improved with respect to noniterative receivers. Numerical results show how a performance close to optimum (maximum-likelihood) detection can be achieved with simpler receiver interfaces.

Published in:

Signal Processing Advances in Wireless Communications, 2003. SPAWC 2003. 4th IEEE Workshop on

Date of Conference:

15-18 June 2003