Distributed space-time codes with low ML decoding complexity

MaRDI QIDQ3062111zbMATH OpenFDO

Authors G. Susinder Rajan, B. Sundar Rajan

Publication date 3 January 2011

Full work available at URL https://arxiv.org/abs/0704.2505

Mathematics Subject Classification ID

Source coding (94A29) Communication networks in operations research (90B18) Decoding (94B35)

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.

Recommendations

• Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks
• Distributed Space-Time Coding
• Low-complexity distributed differential spacetime coding scheme for amplify-and-forward cooperative networks
• Construction of low delay maximal rate single-symbol decodable distributed STBC with channel phase information
• Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity

Cited in

(6)

• Low-complexity distributed differential spacetime coding scheme for amplify-and-forward cooperative networks
• Construction of low delay maximal rate single-symbol decodable distributed STBC with channel phase information
• Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks
• Constructions of fast-decodable distributed space-time codes
• Distributed Space-Time Coding
• High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks

This page was built for publication: Distributed space-time codes with low ML decoding complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3062111)