Full diversity PSK space-time codes

13 November 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Abstract

The design of both systematic and non-systematic space-time codes based on linear codes over rings is considered. Existing design rules for algebraic space-time codes are reformulated resulting in the condition that the characteristic polynomial of the parity generation matrix must be irreducible. These new design rules allow a recursive code construction technique to be applied based on the Shur determinant formula. The resulting code construction is such that the corresponding parity check matrix is sparse, enabling the use of the powerful sum-product algorithm for decoding Author(s) Guidi, A. Inst. for Telecomm. Res., Univ. of South Australia, Mawson Lakes, SA, Australia Grant, A. ; Peitrobon, S.

Keywords

This publication has 2 references indexed in Scilit:

On the theory of space-time codes for PSK modulation
IEEE Transactions on Information Theory, 2000
Matrix Analysis
Published by Cambridge University Press (CUP) ,1985