Fast-group-decodable space-time block code

Ren, Tian Peng; Guan, Yong Liang; Yuen, Chau; Shen, Rong Jun

doi:10.1109/itwksps.2010.5503148

Cited by 34 publications

(89 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also show that codes with lower ML decoding complexity than those reported in [16] can be obtained by simply using the same design as in [16] but by choosing the constellations carefully. We then show that the fast-group-decodable STBC recently given in [14] is a specific case of STBCs obtained from codes over F 4 . In the latter part of this section we show that some of the best known codes for 2 and 4 transmit antennas are obtainable from codes over F 4 .…”

Section: New Fast-group-decodable Codesmentioning

confidence: 90%

“…This is in comparison with the code given in [14] which has a complexity of M 6 with all other parameters being identical. It is also shown that the STBC given in [14] is a specific case of STBCs obtainable from codes over F 4 .…”

mentioning

confidence: 94%

“…In [13], a rate 3/2 fast-decodable code for 4 antennas was given. In [14], a new class of codes called fast-groupdecodable (FGD) codes were introduced. These codes combine the low decoding complexity properties of multigroup and FD codes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fast-group-decodable STBCs via codes over GF(4)

Natarajan

Rajan

2010

2010 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-In this paper we construct low ML decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to F4 domain. The problem of constructing low ML decoding complexity STBCs is shown to be equivalent to finding certain codes over F4. It is shown that almost all known low ML decoding complexity STBCs can be obtained by this approach. New classes of codes are given that have the least known ML decoding complexity in some ranges of rate.

show abstract

Section: New Fast-group-decodable Codesmentioning

confidence: 90%

mentioning

confidence: 94%

See 1 more Smart Citation

Fast-group-decodable STBCs via codes over GF(4)

Natarajan

Rajan

2010

2010 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…Fast group decodable codes were introduced in [14]. These codes combine the properties of multi-group decodable codes and the fast decodable codes.…”

Section: A Multi-group Decodability Fast Decodability and Fast Groumentioning

confidence: 99%

“…Golden code and Silver code are also examples of fast decodable codes as shown in [12] and [13]. The properties of fast decodable codes and multi-group decodable codes were combined and a new class of codes called fast group decodable codes were studied in [14].…”

Section: Introductionmentioning

confidence: 99%

Minimizing the complexity of fast sphere decoding of STBCs

Jithamithra

Rajan

2011

2011 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

Abstract-Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

show abstract

On Fast-Decodable Algebraic Space–Time Codes

Barreal

Hollanti

2020

Number Theory Meets Wireless Communications

View full text Add to dashboard Cite

Fast-group-decodable space-time block code

Cited by 34 publications

References 9 publications

Fast-group-decodable STBCs via codes over GF(4)

Fast-group-decodable STBCs via codes over GF(4)

Minimizing the complexity of fast sphere decoding of STBCs

On Fast-Decodable Algebraic Space–Time Codes

Contact Info

Product

Resources

About