Fast-Group-Decodable STBCs via Codes over GF(4): Further Results

Natarajan, LP and Rajan, BS (2011) Fast-Group-Decodable STBCs via Codes over GF(4): Further Results. In: IEEE International Conference on Communications (ICC), 2011, 5-9 June, 2011, Kyoto, Japan.

PDF fast_group.pdf - Published Version Restricted to Registered users only Download (193kB) | Request a copy

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 Paper
Additional Information:	Copyright of this article belongs to IEEE
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	20 Dec 2011 07:17
Last Modified:	20 Dec 2011 07:17
URI:	http://eprints.iisc.ac.in/id/eprint/42803

Actions (login required)

View Item