• DocumentCode
    1780195
  • Title

    Fast lattice decodability of space-time block codes

  • Author

    Berhuy, Gregory ; Markin, Nadya ; Sethuraman, B.A.

  • Author_Institution
    Inst. Fourier, St. Martin d´Hères, France
  • fYear
    2014
  • fDate
    June 29 2014-July 4 2014
  • Firstpage
    1917
  • Lastpage
    1921
  • Abstract
    We study fast decodability for general rate space-time block codes. We derive bounds on the number of generators that can be in mutually orthogonal groups and use these to show that that the ML decoding complexity of a full-rate n × n space-time block code is unfortunately quite high: at least of the order of |S|n2+1, where S is the effective real constellation. We also show that g-group decodability is not possible for full-rate codes.
  • Keywords
    Rayleigh channels; maximum likelihood decoding; space-time block codes; fast lattice decodability; full rate code; g-group decodability; generator number; maximum likelihood decoding complexity; mutually orthogonal group; space-time block codes; Block codes; Complexity theory; Equations; Lattices; Maximum likelihood decoding; Vectors; Fast-decodability; skew-Hermitian matrices; space-time block codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2014 IEEE International Symposium on
  • Conference_Location
    Honolulu, HI
  • Type

    conf

  • DOI
    10.1109/ISIT.2014.6875167
  • Filename
    6875167
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1780195