• DocumentCode
    2028342
  • Title

    Reducing The Detection Complexity By Using 2??2 Multi-Strata Space-Time Codes

  • Author

    Samuel, M. ; Fitz, M.P.

  • Author_Institution
    Univ. of California, Los Angeles
  • fYear
    2007
  • fDate
    24-29 June 2007
  • Firstpage
    1946
  • Lastpage
    1950
  • Abstract
    The multistrata space-time codes were proposed by Wachsmann et al. to increase the spectral efficiency of orthogonal space-time block codes. However, these codes lack two things: 1) their performance is worse than codes designed using number theory like the Golden code. 2) The advantages of their structure were never exploited in reducing the detection complexity. In this paper, it is shown how the multistrata structure can potentially reduce the detection complexity of the sphere decoder in the uncoded case and a simple means of generating bit log-likelihood ratios in a bit-interleaved coded modulation scenario is presented. Simulation results show that the obtained code has a very small performance penalty compared to the Golden code in the uncoded case and outperforms it in bit-interleaved coded modulation.
  • Keywords
    block codes; computational complexity; decoding; interleaved codes; modulation coding; space-time codes; Golden code; bit log-likelihood ratio; bit-interleaved coded modulation; multi strata space-time codes; orthogonal space-time block codes; spectral efficiency; sphere decoder complexity detection; Block codes; Constraint optimization; Cost function; Decoding; Diversity reception; Interleaved codes; Lattices; MIMO; Modulation coding; Space time codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2007. ISIT 2007. IEEE International Symposium on
  • Conference_Location
    Nice
  • Print_ISBN
    978-1-4244-1397-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2007.4557506
  • Filename
    4557506