ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras

Karmakar, Sanjay and Rajan, Sundar B (2006) Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras. In: IEEE International Symposium on Information Theory,, Jul 09-14, 2006, Seattle, WA,, pp. 788-792.

[img] PDF
04036071.pdf - Published Version
Restricted to Registered users only

Download (233Kb) | Request a copy
Official URL: http://ieeexplore.ieee.org/search/srchabstract.jsp...

Abstract

It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. 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). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 27 Aug 2010 05:26
Last Modified: 19 Sep 2010 06:12
URI: http://eprints.iisc.ernet.in/id/eprint/30490

Actions (login required)

View Item View Item