Fast Maximum-Likelihood Decoding of the Golden Code

Details Fast Maximum-Likelihood Decoding of the Golden Code Fast Maximum-Likelihood Decoding of the Golden Code

2008-11-13

arxiv.org/abs/0811.2201v1

Computer Science

Information Theory

Submitted to IEEE Trans. on Wireless, November 2008

Scientific paper

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^2. 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^2.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.

Affiliated with

Also associated with

No associations

Rating

Fast Maximum-Likelihood Decoding of the Golden Code does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Maximum-Likelihood Decoding of the Golden Code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Maximum-Likelihood Decoding of the Golden Code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-436595