Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity

Karmakar, Sanjay and Rajan, Sundar B (2006) Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity. In: IEEE International Symposium on Information Theory,, Jul 09-14, 2006, Seattle, WA, pp. 793-797.

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

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 nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	27 Aug 2010 05:44
Last Modified:	19 Sep 2010 06:12
URI:	http://eprints.iisc.ac.in/id/eprint/30491

Actions (login required)

View Item