Low ML Decoding Complexity STBCs via Codes Over the Klein Group

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 cub...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2011-12, Vol.57 (12), p.7950-7971
Main Authors: Natarajan, L. P., Rajan, B. S.
Format: Article
Language:English
Subjects:
Antennas
Applied sciences
Block codes
Channels
Clifford algebra
Codes
Coding, codes
Complexity
Complexity theory
Construction
cubic shaping
Decoding
Encoding
Exact sciences and technology
full diversity
Information theory
Information, signal and communications theory
information-losslessness
Klein group
low maximum-likelihood (ML) decoding complexity
Maximum likelihood decoding
Pauli matrices
Quadrature amplitude modulation
Radiocommunications
Signal and communications theory
space-time codes
Symbols
Telecommunications
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 known ML decoding complexity among all the codes available in the literature for a large set of ( N , R ) pairs.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2011.2170113