• DocumentCode
    3509677
  • Title

    A general framework for constructing fast-decodable asymmetric space-time codes

  • Author

    Vehkalahti, Roope ; Hollanti, Camilla

  • Author_Institution
    Dept. of Math., Univ. of Turku, Turku, Finland
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 5 2011
  • Firstpage
    2821
  • Lastpage
    2825
  • Abstract
    Recently, extensive effort has been taken to build fast-decodable (FD) space-time (ST) codes, especially called for due to the limited power resources available for mobile receivers. Although there have been numerous successful attempts that have resulted in reduced decoding complexity for a certain number of transmit antennas, a general method for constructing FD codes for a wider range of antenna combinations and rates is still missing. Here, this problem is solved by introducing a totally general framework for constructing full-diversity FD codes with non-vanishing determinants (NVD).
  • Keywords
    decoding; radio receivers; space-time codes; antenna combinations; decoding complexity; fast-decodable asymmetric space-time codes; mobile receivers; multiple-input multiple-output codes; nonvanishing determinants; power resources; Algebra; Antennas; Complexity theory; Decoding; Lattices; Quaternions; Space time codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
  • Conference_Location
    St. Petersburg
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4577-0596-0
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2011.6034089
  • Filename
    6034089