Fast-decodable MIDO codes from crossed product algebras

Oggier, Frédérique; Vehkalahti, Roope; Hollanti, Camilla

doi:10.1109/isit.2010.5513709

Cited by 20 publications

(28 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Even though the BHV code is not a full-diversity STBC, it is considered here since it is the first fast-decodable STBC proposed for the 4 × 2 system, having an ML-decoding complexity of O(M 4.5 ) for square M -QAM. We have not considered the other full-diversity STBCs proposed in [16] - [20] since these codes have not been constructed with a focus on coding gain but only with an intention of having fast-decodability with a proven NVD. The constellations used in our simulations are 4-QAM and 16-QAM.…”

Section: A 4 × 2 Mido Systemmentioning

confidence: 99%

“…Of particular interest is the 4 × 2 MIDO system for which a slew of rate-2 STBCs have been developed [1], [2], [15]- [20], with the particular aim of allowing fast-decodability (see Definition 7), a term that was first coined in [15]. Among these codes, those in [1], [16]- [20] have been shown to have a minimum determinant that is bounded away from zero irrespective of the size of the signal constellation and hence STBC-schemes that consist of these codes have the NVD property and are DMToptimal for the 4 × 2 MIDO system [21]. A generalization of fast-decodable STBC construction for higher number of transmit antennas has been proposed in [1].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fast-Decodable MIDO Codes With Large Coding Gain

Srinath¹,

Rajan

2014

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of 2 complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input, double output (MIDO) systems. Using this method, rate-2 STBCs for 4×2, 6×2, 8×2 and 12×2 systems are constructed and these STBCs are fast ML-decodable, have large coding gains and STBC-schemes consisting of these STBCs have a non-vanishing determinant (NVD) so that they are DMT-optimal for their respective MIDO systems. It is also shown that the Srinath-Rajan code [R. Vehkalahti, C. Hollanti, and F. Oggier, "Fast-Decodable Asymmetric Space-Time Codes from Division Algebras," IEEE Trans. Inf. Theory, Apr. 2012] for the 4×2 system, which has the lowest ML-decoding complexity among known rate-2 STBCs for the 4 × 2 MIDO system with a large coding gain for 4-/16-QAM, has the same algebraic structure as the STBC constructed in this paper for the 4 × 2 system. This also settles in positive a previous conjecture that the STBC-scheme that is based on the SrinathRajan code has the NVD property and hence is DMT-optimal for the 4 × 2 system.

show abstract

Section: A 4 × 2 Mido Systemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Fast-Decodable MIDO Codes With Large Coding Gain

Srinath¹,

Rajan

2014

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…Fast-decodable codes are treated by Biglieri, Hong and Viterbo [15], Vehkalahti, Hollanti and Oggier [16], [17], Luzzi and Oggier [18], Markin and Oggier [19], and in [13], [14] and [9], to name just a few.…”

Section: Introductionmentioning

confidence: 99%

Fast-decodable MIDO codes from non-associative algebras

Pumplün

Steele

2015

IJICOT

View full text Add to dashboard Cite

A note on versions:The version presented here may differ from the published version or from the version of record. If you wish to cite this item you are advised to consult the publisher's version. Please see the repository url above for details on accessing the published version and note that access may require a subscription.For more information, please contact eprints@nottingham.ac.uk FAST-DECODABLE MIDO CODES FROM NONASSOCIATIVE ALGEBRAS S. PUMPLÜN AND A. STEELEAbstract. By defining a multiplication on a direct sum of n copies of a given cyclic division algebra, we obtain new unital nonassociative algebras. We employ their left multiplication to construct rate-n and rate-2 fully diverse fast ML-decodable space-time block codes for a multiple input-double output (MIDO) system. We give examples of fully diverse rate-2 4 × 2, 6 × 2, 8 × 2 and 12 × 2 space-time block codes and of a rate-3 6 × 2 code. All are fast ML-decodable. Our approach generalizes the iterated codes in [20].

show abstract

“…More recently, full-rate STBCs with an ML-decoding complexity of the order of M 5.5 and a provable NVD property for the 4 × 2 system have been proposed in [19] and [20].…”

Section: Introductionmentioning

confidence: 99%

Generalized Silver Codes

Srinath

Rajan

2011

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

For an n t transmit, n r receive antenna system (n t × n r system), a full-rate space time block code (STBC) transmits n min = min(n t , n r ) complex symbols per channel use. The well known Golden code is an example of a full-rate, full-diversity STBC for 2 transmit antennas. Its ML-decoding complexity is of the order of M 2.5 for square M -QAM. The Silver code for 2 transmit antennas has all the desirable properties of the Golden code except its coding gain, but offers lower ML-decoding complexity of the order of M 2 . Importantly, the slight loss in coding gain is negligible compared to the advantage it offers in terms of lowering the ML-decoding complexity. For higher number of transmit antennas, the best known codes are the Perfect codes, which are full-rate, full-diversity, information lossless codes (for n r ≥ n t )but have a high ML-decoding complexity of the order of M ntnmin (for n r < n t , the punctured Perfect codes are considered). In this paper 1 , a scheme to obtain full-rate STBCs for 2 a transmit antennas and any n r with reduced ML-decoding complexity of the order of M nt(nmin− 3 4 )−0.5 , is presented. The codes constructed are also information lossless for n r ≥ n t , like the Perfect codes and allow higher mutual information than the comparable punctured Perfect codes for n r < n t . These codes are referred to as the generalized Silver codes, since they enjoy the same desirable properties as the comparable Perfect codes (except possibly the coding gain) with lower ML-decoding complexity, analogous to the Silver-Golden codes for 2 transmit antennas. Simulation results of the symbol error rates for 4 and 8 transmit antennasshow that the generalized Silver codes match the punctured Perfect codes in error performance while offering lower ML-decoding complexity.

show abstract

Fast-decodable MIDO codes from crossed product algebras

Cited by 20 publications

References 16 publications

Fast-Decodable MIDO Codes With Large Coding Gain

Fast-Decodable MIDO Codes With Large Coding Gain

Fast-decodable MIDO codes from non-associative algebras

Generalized Silver Codes

Contact Info

Product

Resources

About