By Topic

On the Rate Versus ML-Decoding Complexity Tradeoff of Square LDSTBCs with Unitary Weight Matrices

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)
Karmakar, S. ; Univ. of Colorado at Boulder, Boulder, CO ; Varanasi, M.K.

The low decoding complexity structure of Linear Dispersion Space Time Block Codes (LDSTBCs) with unitary weight matrices is analyzed. It is shown that given n = 2alpha, the maximum number of groups in which the information symbols can be separated and decoded independently is (2a + 2), and as we lower the number of different groups to (2k + 2), 0 les k les alpha, we get higher rate codes. We also find the analytic expression for rates that such codes can achieve for any chosen group number, thus completely characterizing the rate-ML-decoding-complexity tradeoff for this class of codes. The proof of the result also includes a method for constructing such optimal rate achieving codes. Interestingly, this analysis produces some low decoding complexity codes with rate greater than one.

Published in:

Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE

Date of Conference:

Nov. 30 2008-Dec. 4 2008