Golden Code with Low Complexity Sphere Decoder

Zhang, Lei; Li, Baojin; Yuan, Tingting; Xm, Zhang

doi:10.1109/pimrc.2007.4394327

Cited by 12 publications

(24 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(Throughout the paper we use superscripts R and I denote the real and imaginary components, respectively, so that v R = Re{ v } and a I = Im{ a }). Thus, the optimization in (12) decomposes into the two parallel optimizations of (15). Since each optimization in (15) is equivalent to ML detection for a real channel with two -PAM inputs, each has a worst-case complexity of O( ).…”

Section: B a Fast ML Decoder For The Golden Codementioning

confidence: 99%

See 1 more Smart Citation

Fast maximum-likelihood decoding of the golden code

Sinnokrot

Barry

2010

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

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 Mary 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 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.

show abstract

Section: B a Fast ML Decoder For The Golden Codementioning

confidence: 99%

“…Thus, the optimization in (12) decomposes into the two parallel optimizations of (15). Since each optimization in (15) is equivalent to ML detection for a real channel with two -PAM inputs, each has a worst-case complexity of O( ). Thus, the overall complexity of (15) is O( 2 ).…”

Section: B a Fast ML Decoder For The Golden Codementioning

confidence: 99%

Fast maximum-likelihood decoding of the golden code

Sinnokrot

Barry

2010

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…The detection complexity of sphere decoding depends on the cardinality of the signal set and the depth of search [12]. In [13], reduced complexity sphere decoding has been proposed to decode the Golden code. The proposed reduced complexity sphere decoding in [13] focused on reducing the search depth.…”

Section: Introductionmentioning

confidence: 99%

“…In [13], reduced complexity sphere decoding has been proposed to decode the Golden code. The proposed reduced complexity sphere decoding in [13] focused on reducing the search depth. However, detection complexity remains relatively high.…”

Section: Introductionmentioning

confidence: 99%

Reduced Complexity Detection Schemes for Golden Code Systems

Pillay

2019

IEEE Access

View full text Add to dashboard Cite

The Golden code has full-rate and full-diversity. However, its applications are limited because of the very high detection complexity. The complexity of sphere decoding depends on the size of signal set, M 2 , and the depth of search. Meanwhile, the complexity of fast essentially maximum likelihood (ML) detection is still O(M 2 ) for M -ary quadrature amplitude modulation (M QAM). In this paper, we propose two reduced complexity detection schemes, fast essentially ML with detection subset and sphere decoding with detection subset. Two theoretical bounds on the average bit error probability for the Golden code with M QAM are also formulated in this paper. Simulation results demonstrate that both the fast essentially ML with detection subset and sphere decoding with detection subset agree well with the formulated theoretical bounds and can achieve the error performance of the conventional fast essentially ML detector and sphere decoding.

show abstract

“…A fast maximum-likelihood decoding algorithm with efficient channel induced by the golden code having a worst-case complexity o (2M 2.5 ) was discussed in [14]. The reduction of average decoding complexity without the performance degradation by an improved sphere decoding for golden code, was discussed in [15]. In [16], the performance analysis of the Golden code in a Bit Interleaved Coded Modulation-MIMO (BICM-MIMO) system and its comparison with the uncoded MIMO scheme was discussed.…”

Section: Introductionmentioning

confidence: 99%