Fast Maximum-Likelihood Decoding of the Golden Code

2008/11/13 by Mohanned O. Sinnokrot, Sinnokrot, Mohanned O., John R. Barry +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.0811.2201

Submitted to IEEE Trans. on Wireless, November 2008

arxiv created 2008/11/13 · arxiv updated 2009/12/01

Abstract

The golden code is a full-rate full-diversity space-time code for two transmit antennas that has a maximal coding gain. Because each codeword conveys four information symbols from an M-ary quadrature-amplitude modulation alphabet, the complexity of an exhaustive search decoder is proportional to M². In this paper we present a new fast algorithm for maximum-likelihood decoding of the golden code that has a worst-case complexity of only O(2M².5). We also present an efficient implementation of the fast decoder that exhibits a low average complexity. Finally, in contrast to the overlaid Alamouti codes, which lose their fast decodability property on time-varying channels, we show that the golden code is fast decodable on both quasistatic and rapid time-varying channels.

Related

• Decoding the Golden Code: a VLSI design
• Generalized Silver Codes
• Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 X 2 and 4 X 2 MIMO Systems
• Golden Space-Time Trellis Coded Modulation
• An Adaptive Conditional Zero-Forcing Decoder with Full-diversity, Least Complexity and Essentially-ML Performance for STBCs