Algebraic distributed differential space-time codes with low decoding complexity

Susinder Rajan, G. ; Sundar Rajan, B. (2008) Algebraic distributed differential space-time codes with low decoding complexity IEEE Transactions on Wireless Communications, 7 (10). pp. 3962-3971. ISSN 1536-1276

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/4657340/

Related URL: http://dx.doi.org/10.1109/T-WC.2008.070530

Abstract

The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices. For such codebooks to be usable in the Jing-Hassibi protocol for cooperative diversity, the conditions involving the relay matrices and the codebook that need to be satisfied are identified. Using the algebraic framework of extended Clifford algebras, a new class of Distributed Differential Space-Time Codes satisfying these conditions for power of two number of relays and also achieving full cooperative diversity with a low complexity sub-optimal receiver is proposed. Simulation results indicate that the proposed codes outperform both the cyclic codes as well as the circulant codes. Furthermore, these codes can also be applied as Differential Space-Time codes for noncoherent communication in classical point to point multiple antenna systems.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
Keywords:Algebra; Cooperative Diversity; Low Decoding Complexity; Space-Time Coding
ID Code:107292
Deposited On:08 Dec 2017 10:07
Last Modified:08 Dec 2017 10:07

Repository Staff Only: item control page