.png){kind=icon}
.png){kind=icon}
Return
Fast Maximum-Likelihood Decoding of the Golden Code
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2010.01.081512.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Because each golden code codeword conveys four information symbols from an M-ary QAM alphabet, the complexity of an exhaustive-search decoder is proportional to M-4. In this paper we prove that the golden code is fast-decodable, meaning that maximum-likelihood decoding is possible with a worst-case complexity proportional to only M-2.5. The golden code retains its fast-decodable property regardless of whether the channel varies with time. We also present an efficient implementation of a fast maximum-likelihood decoder that exhibits a low average complexity.
Keywords:
Golden code
maximum-likelihood decoding
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W