• DocumentCode
    3276164
  • Title

    Full diversity PSK space-time codes

  • Author

    Guidi, Andrew ; Grant, Alex ; Peitrobon, S.

  • Author_Institution
    Inst. for Telecomm. Res., Univ. of South Australia, Mawson Lakes, SA, Australia
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    150
  • 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
  • Keywords
    binary codes; block codes; determinants; linear codes; modulation coding; phase shift keying; polynomials; sparse matrices; Shur determinant formula; algebraic space-time codes; binary systematic linear block code; characteristic polynomial; code design rules; decoding; full diversity PSK space-time codes; nonsystematic space-time codes; parity generation matrix; recursive code construction; sparse parity check matrix; sum-product algorithm; systematic space-time codes; Australia; Decoding; Eigenvalues and eigenfunctions; Modulation coding; Parity check codes; Phase shift keying; Polynomials; Space time codes; Sparse matrices; Stacking;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
  • Conference_Location
    Washington, DC
  • Print_ISBN
    0-7803-7123-2
  • Type

    conf

  • DOI
    10.1109/ISIT.2001.936013
  • Filename
    936013