Math @ Duke

Publications [#235993] of Robert Calderbank
Papers Published
 Sirinaunpiboon, S; Calderbank, AR; Howard, SD, Fast essentially maximum likelihood decoding of the Golden code,
IEEE Transactions on Information Theory, vol. 57 no. 6
(2011),
pp. 35373541, ISSN 00189448 [doi]
(last updated on 2018/02/20)
Abstract: The Golden code is a fullrate fulldiversity spacetime code which has been incorporated in the IEEE 802.16 (WiMAX) standard. The worst case complexity of a treebased 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.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

