The Aladdin-Pythagoras space-time code Conference Paper uri icon

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. 2009 IEEE.

name of conference

  • 2009 IEEE International Symposium on Information Theory - ISIT

published proceedings

  • 2009 IEEE International Symposium on Information Theory

author list (cited authors)

  • Boutros, J. J., & Randriambololona, H.

citation count

  • 3

complete list of authors

  • Boutros, Joseph J||Randriambololona, Hugues

publication date

  • June 2009

publisher