Natarajan, Lakshmi Prasad ; Sundar Rajan, B. (2011) Low ML decoding complexity STBCs via codes over the Klein group IEEE Transactions on Information Theory, 57 (12). pp. 7950-7971. ISSN 0018-9448
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/6094265/
Related URL: http://dx.doi.org/10.1109/TIT.2011.2170113
Abstract
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=2m, 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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| Keywords: | Space-Time Codes; Clifford Algebra; Cubic Shaping; Full Diversity; Information-Losslessness; Klein Group; Low Maximum-Likelihood (ML) Decoding Complexity; Pauli Matrices |
| ID Code: | 106890 |
| Deposited On: | 08 Dec 2017 10:07 |
| Last Modified: | 08 Dec 2017 10:07 |
Repository Staff Only: item control page
