On Fast-Decodable Space-Time Block Codes

Biglieri, E.; Hong, Yi; Viterbo, Emanuele

doi:10.1109/izs.2008.4497289

Cited by 99 publications

(252 citation statements)

References 24 publications

Supporting

Mentioning

248

Contrasting

Unclassified

Order By: Relevance

“…In Fig. 1, we show BER as a function of SNR per bit for the proposed space-time code, TAST [4] code and the fastdecodable code (FAST) of [9]. At BER = 10 -, the proposed space-time code outperforms the fast-decodable code and TAST code by 0.3 dB and 1 dB, respectively.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…In this section we compare the BER performance and complexity of the proposed space-time codes with the best performing space-time codes of [4,[7][8][9][10][11][12] over quasistatic Rayleigh-fading channel with additive Gaussian noise. As a representative example, we compare BER and complexity for four transmit antennas and two receive antennas for R = 2.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…We omit simulation results for other configurations due to lack of space but note that the EAST codes space-time codes of [4,[7][8][9][10][11][12] except for the R = 1 configuration, where the quasiorthogonal codes perform slightly better.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…Recent work in space-time code design has shifted away from increasing the diversity order [1,2] or transmission rate [3] alone to increasing both simultaneously [4][5][6][7][8][9]. The continuous tradeoff between the achievable diversity and multiplexing gains as a function of the signal-to-noise ratio (SNR) was characterized in [10].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Embedded Alamouti space-time codes for high rate and low decoding complexity

Barry¹,

Madisetti²

2008

2008 42nd Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

-We introduce a new family of space-time codes called embedded Alamouti space-time (EAST) codes which offer high rate, a nonvanishing determinant and low decoding complexity. The family is parameterized by both the number of transmit antennas, which can range from two to eight, and by the rate, which can range from one to half the number of transmit antennas. The EAST codes combine a modified version of the perfect spacetime codes with an Alamouti embedding. For rates higher than one, the resulting space-time codes are simultaneously lower in decoding complexity and better performing than all known previous constructions in terms of the error probability achieved on a quasistatic Rayleigh fading channel with a given dimension.Index Terms -transmit diversity, space-time coding. I. INTRODUCTIONRecent work in space-time code design has shifted away from increasing the diversity order [1,2] or transmission rate [3] alone to increasing both simultaneously [4][5][6][7][8][9]. The continuous tradeoff between the achievable diversity and multiplexing gains as a function of the signal-to-noise ratio (SNR) was characterized in [10]. The threaded algebraic space-time (TAST) codes of [4] achieve the extremal points of the diversity-multiplexing tradeoff for any number of antennas and arbitrary rates. The perfect space-time codes of [7] achieve the entire frontier of the diversity-multiplexing tradeoff. Perfect space-time codes were originally proposed for only two, three, four and six antennas in [7] and later generalized for any number of antennas in [8].One approach to constructing a high-rate code is to start with a maximal-rate TAST or perfect space-time code and then puncture one or more of its layers. For example, TAST and perfect space-time codes of rate R  {1, 2, 3, 4} are easily obtained by puncturing 4 -R layers of a rate-4 code. Unfortunately, the resulting codes often have a high decoding complexity and worse BER performance than space-time codes that were designed for a particular rate and a particular number of antennas.No previously reported space-time code achieve an arbitrary rate for arbitrary number of antennas while maintaining low decoding complexity. In this paper we partially fill this gap by proposing a framework for the construction and decoding of high rate space-time block codes. In particular, we make three contributions. First, we show that the complex rotation matrices of the perfect spacetime code of [7] can be replaced by equivalent real-valued matrices without affecting the diversity or coding gain; the real matrices lead to lower-complexity decoding. Second, we use the equivalent real generator matrices to construct the embedded Alamouti space-time (EAST) codes, which is a family of codes for any number of antennas up to eight, and for any rate up to half the number of antennas. When compared to previously reported codes with the same number of antennas and the same rate larger than one, the EAST codes are simultaneously lower in complexity and lower in error probability. Lastly, ...

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

Section: Numerical Resultsmentioning

confidence: 99%

Section: Numerical Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Embedded Alamouti space-time codes for high rate and low decoding complexity

Barry¹,

Madisetti²

2008

2008 42nd Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

show abstract

“…The so-called fast decodable STBCs [2], [3], [5]- [7] exploit the orthogonality embedded in the codewords and achieve ML decoding performance at a low decoding complexity. For instance, Biglieri-Hong-Viterbo (BHV) constructed a rate-2 STBC [2] based on the classical Jafarkhani code [1].…”

Section: Introductionmentioning

confidence: 99%

A fast decodable full-rate STBC with high coding gain for 4 × 2 MIMO systems

Liu

Hélard

et al. 2013

2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

View full text Add to dashboard Cite

Abstract-In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4 × 2 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 Mary 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.

show abstract