Low ML Decoding Complexity STBCs via Codes Over the Klein Group

被引：2

作者：

Natarajan, Lakshmi Prasad ^{[1
]}

Rajan, B. Sundar ^{[1
]}

机构：

[1] Indian Inst Sci, Dept Elect Commun Engn, Bangalore 560012, Karnataka, India

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2011年 / 57卷 / 12期

关键词：

Clifford algebra; cubic shaping; full diversity; information-losslessness; Klein group; low maximum-likelihood (ML) decoding complexity; Pauli matrices; space-time codes; TIME BLOCK-CODES; FULL-DIVERSITY; ORTHOGONAL DESIGNS; DECODABLE STBCS; SPACE; BOUNDS;

D O I：

10.1109/TIT.2011.2170113

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：7950 / 7971

页数：22

共 43 条

[1] A simple transmit diversity technique for wireless communications [J].