Natarajan, Lakshmi Prasad and Rajan, Sundar B (2011) Low ML Decoding Complexity STBCs via Codes Over the Klein Group. In: IEEE Transactions on Information Theory, 57 (12). pp. 7950-7971.
Low_ML.pdf - Published Version
Restricted to Registered users only
Download (6Mb) | Request a copy
In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full- diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N = 2(m), m >= 1, and rates R > 1 complex symbols per channel use. When R = N, the new STBCs are information- lossless as well. The new class of STBCs have the least knownML decoding complexity among all the codes available in the literature for a large set of (N, R) pairs.
|Item Type:||Journal Article|
|Additional Information:||Copyright 2011 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||Clifford algebra;cubic shaping;full diversity;information-losslessness;Klein group;low maximum-likelihood (ML) decoding complexity;Pauli matrices;space-time codes|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||03 Jan 2012 12:30|
|Last Modified:||03 Jan 2012 12:30|
Actions (login required)