Fast essentially maximum likelihood decoding of the Golden code

Journal Article (Journal Article)

The Golden code is a full-rate full-diversity space-time code which has been incorporated in the IEEE 802.16 (WiMAX) standard. The worst case complexity of a tree-based sphere decoder for a square QAM constellation is O(N 3), where n is the size of the underlying QAM constellation; the worst case will dominate average decoding complexity on any channel with a significant line of sight component. In this paper, we present a simple algorithm with quadratic complexity for decoding the Golden code that can be employed by mobile terminals with either one or two receive antennas, that is resilient to near singularity of the channel matrix, and that gives essentially maximum likelihood (ML) performance. Dual use is an advantage, since there will likely be some IEEE 802.16 mobile terminals with one receive antenna and some with two antennas. The key to the quadratic algorithm is a maximization of the likelihood function with respect to one of the pair of signal points conditioned on the other. This choice is made by comparing the determinants of two covariance matrices, and the underlying geometry of the Golden code guarantees that one of these choices is good with high probability. © 2011 IEEE.

Full Text

Duke Authors

Cited Authors

  • Sirinaunpiboon, S; Calderbank, AR; Howard, SD

Published Date

  • June 1, 2011

Published In

Volume / Issue

  • 57 / 6

Start / End Page

  • 3537 - 3541

International Standard Serial Number (ISSN)

  • 0018-9448

Digital Object Identifier (DOI)

  • 10.1109/TIT.2011.2136870

Citation Source

  • Scopus