The aladdin-pythagoras space-time code

Joseph Boutros, Hugues Randriambololona

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Our motivation is the design of space-time coding which is optimal under both maxim um likelihood and iterative decoding. We describe the construction of new full-rate spacetime codes with non-vanishing determinant that satisfy the genie conditions for iterative probabilistic decoding. The problem combining the genie conditions and the rank criterion is rewritten in terms of a quadratic form. The construction over Z[i] (the cubic lattice) yields a family of codes defined by Pythagorean triples. The space-time code built over Z[iJ and involving the quaternion algebra (i5/(Qi)) is referred to as the Aladdin-Pythagoras code. The construction over Z[j] (the hexagonal lattice) also yields a fullrate non-vanishing determinant code that is suitable for iterative decoding on multiple antenna channels.

Original languageEnglish
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages2823-2827
Number of pages5
DOIs
Publication statusPublished - 19 Nov 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: 28 Jun 20093 Jul 2009

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period28/6/093/7/09

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Boutros, J., & Randriambololona, H. (2009). The aladdin-pythagoras space-time code. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 2823-2827). [5205763] https://doi.org/10.1109/ISIT.2009.5205763