Natarajan, Lakshmi Prasad ; Sundar Rajan, B. (2010) Fast-group-decodable STBCs via codes over GF(4) In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), 13-18 Jun 2010, Austin, TX, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/5513721/
Related URL: http://dx.doi.org/10.1109/ISIT.2010.5513721
Abstract
In this paper we construct low ML 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 F4 domain. The problem of constructing low ML decoding complexity STBCs is shown to be equivalent to finding certain codes over F4. It is shown that almost all known low ML decoding complexity STBCs can be obtained by this approach. New classes of codes are given that have the least known ML decoding complexity in some ranges of rate.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 110640 |
| Deposited On: | 08 Dec 2017 10:23 |
| Last Modified: | 08 Dec 2017 10:23 |
Repository Staff Only: item control page
