pith. sign in

arxiv: 1401.1206 · v1 · pith:AVCYEICJnew · submitted 2014-01-06 · 💻 cs.IT · math.IT

A Fast Decodable Full-Rate STBC with High Coding Gain for 4x2 MIMO Systems

classification 💻 cs.IT math.IT
keywords codeproposedcomplexitydecodingfast-decodablefull-ratemimoperformance
0
0 comments X
read the original abstract

In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code requires a much lower computational complexity to provide maximum-likelihood (ML) decoding performance. It is shown that the ML decoding complexity is only O(M^{4.5}) when M-ary square QAM constellation is used. Finally, the proposed code has highest minimum determinant among the fast-decodable STBCs known in the literature. Simulation results prove that the proposed code provides the best bit error rate (BER) performance among the state-of-the-art STBCs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.