By Topic

Space-Time Code Design for MIMO Detection Based on Kullback-Leibler Divergence

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
$33 $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)
Emanuele Grossi ; DAEIMI, Università degli Studi di Cassino, Italy ; Marco Lops

The focus of the paper is on the design of space-time codes for a general multiple-input, multiple-output detection problem, when multiple observations are available at the receiver. The figure of merit used for optimization purposes is the convex combination of the Kullback-Leibler divergences between the densities of the observations under the two hypotheses, and different system constraints are considered. This approach permits to control the average sample number (i.e., the time for taking a decision) in a sequential probability ratio test and to asymptotically minimize the probability of miss in a likelihood ratio test: the solutions offer an interesting insight in the optimal transmit policies, encapsulated in the rank of the code matrix, which rules the amount of diversity to be generated, as well as in the power allocation policy along the active eigenmodes. A study of the region of achievable divergence pairs, whose availability permits optimization of a wide range of merit figures, is also undertaken. A set of numerical results is finally given, in order to analyze and discuss the performance and validate the theoretical results.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 6 )