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

N. Lakshmi Prasad; B. Sundar Rajan

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

Information Theory 2010-01-14 v1 math.IT

Authors: N. Lakshmi Prasad , B. Sundar Rajan

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.

Cite

@article{arxiv.1001.2076,
  title  = {Fast-Group-Decodable STBCs via Codes over GF(4)},
  author = {N. Lakshmi Prasad and B. Sundar Rajan},
  journal= {arXiv preprint arXiv:1001.2076},
  year   = {2010}
}

Comments

15 pages, 1 table

Related papers

View all related →