Natarajan, Lakshmi Prasad ; Sundar Rajan, B. (2011) Fast-Group-Decodable STBCs via codes over GF(4): further results In: 2011 IEEE International Conference on Communications (ICC), 05-09 Jun 2011, Kyoto, Japan.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/5962874/
Related URL: http://dx.doi.org/10.1109/icc.2011.5962874
Abstract
Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 110483 |
| Deposited On: | 08 Dec 2017 10:23 |
| Last Modified: | 08 Dec 2017 10:23 |
Repository Staff Only: item control page
