Algebraic distributed space-time codes with low ML decoding complexity

Rajan, G Susinder and Rajan, B Sundar (2007) Algebraic distributed space-time codes with low ML decoding complexity. In: IEEE International Symposium on Information Theory, 24-29 June 2007, Nice.

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

Abstract

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decoding complexity. In particular, the ML decoding of these codes can be performed by applying the lattice decoder algorithm on a lattice of four times lesser dimension than what is required in general. Moreover these codes have a uniform distribution of power among the relays and in time, thus leading to a low Peak to Average Power Ratio at the relays.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 2007 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:	10 Mar 2010 06:23
Last Modified:	19 Sep 2010 05:56
URI:	http://eprints.iisc.ac.in/id/eprint/26027

Actions (login required)

View Item