Algebraic constructions for PSK space-time coded modulation. (English)

Boztaş, Serdar (ed.) et al., Applied algebra, algebraic algorithms and error-correcting codes. 14th international symposium, AAECC-14, Melbourne, Australia, November 26‒30, 2001. \newl Proceedings. Berlin: Springer (ISBN 3-540-42911-5). Lect. Notes Comput. Sci. 2227, 387-396 (2001).

Summary: We consider the design of phase shift keyed space-time coded modulation for two antenna systems based on linear codes over rings. Design rules for constructing full diversity systematic space-time codes based on underlying existing algebraic codes were first presented by {\it A. Hammons} and {\it H. ElGamal} [IEEE Trans. Inf. Theory 46, 524‒542 (2000; Zbl 0999.94009)]. We reformulate and simplify these design rules, resulting in the condition that the characteristic polynomial of the parity generation matrix must be irreducible. We further extend the results to non-systematic codes. These results yield a recursive construction based on the Schur determinant formula. The resulting block codes are guranteed to provide full diversity advantage. In addition, the code construction is such that the corresponding parity check matrix is sparse, enabling the use of the powerful Sum-Product algorithm for decoding.