• DocumentCode
    2943104
  • Title

    Non-Unitary-Weight Space-Time Block codes with Minimum Decoding Complexity

  • Author

    Karmakar, Sanjay ; Rajan, B. Sundar

  • Author_Institution
    Dept. of ECE, Indian Inst. of Sci., Bangalore
  • fYear
    2006
  • fDate
    9-14 July 2006
  • Firstpage
    793
  • Lastpage
    797
  • Abstract
    Space-time block codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) coordinate interleaved orthogonal designs (CIODs) and (ii) minimum-decoding-complexity (MDC) STBCs from quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a linear dispersion code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with non-unitary weight matrices. Also, we show that the class of CIODs is a special class of our construction
  • Keywords
    block codes; decoding; interleaved codes; linear codes; matrix algebra; space-time codes; complex orthogonal designs; coordinate interleaved orthogonal designs; linear dispersion code; minimum decoding complexity; nonunitary weight matrices; nonunitary-weight space-time block codes; quasi-OD; single-symbol decodable STBC; symbol-by-symbol decodable STBC; Algebra; Block codes; Decoding; Equations;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2006 IEEE International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    1-4244-0505-X
  • Electronic_ISBN
    1-4244-0504-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2006.261722
  • Filename
    4036072