Karmakar, Sanjay ; Sundar Rajan, B. (2006) Non-unitary-weight Space-time Block Codes with minimum decoding complexity In: 2006 IEEE International Symposium on Information Theory, 9-14 July 2006, Seattle, WA, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/4036072/
Related URL: http://dx.doi.org/10.1109/ISIT.2006.261722
Abstract
Space-time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are Single-symbol Decodable/Symbol-by-symbol Decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) coordinate interleaved orthogonal designs (CIODs) and (ii) Minimum-decoding-complexity (MDC) STBCs from quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with non-unitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 111169 |
| Deposited On: | 08 Dec 2017 10:30 |
| Last Modified: | 08 Dec 2017 10:30 |
Repository Staff Only: item control page
