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

Lakshmi Prasad, N and Sundar Rajan, B (2010) Fast-Group-Decodable STBCs via Codes over GF(4). In: IEEE International Symposium on Information Theory, (ISIT 2010), Austin, Texas, USA, Jun.2010, Austin, Texas, USA.

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

Abstract

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

Item Type:	Conference Paper
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	20 Dec 2011 06:47
Last Modified:	20 Dec 2011 06:55
URI:	http://eprints.iisc.ac.in/id/eprint/38967

Actions (login required)

View Item