By Topic

Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Karmakar, S. ; Dept. of ECE, Indian Inst. of Sci., Bangalore ; Rajan, B.S.

It is well known that Alamouti code and, in general, space-time block codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-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 CODs) 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

Published in:

Information Theory, 2006 IEEE International Symposium on

Date of Conference:

9-14 July 2006