• DocumentCode
    2123160
  • Title

    Fixed-complexity list-type iterative joint detection and decoding of LDPC-coded V-blast systems

  • Author

    Tsai, Meng-Ying Brady ; Yousefi, Shahram

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Queen´´s Univ., Kingston, ON
  • fYear
    2008
  • fDate
    24-26 June 2008
  • Firstpage
    286
  • Lastpage
    289
  • Abstract
    Soft iterative detection and decoding techniques have been shown to be able to achieve near-capacity performance in multiple antenna systems. To obtain the optimal soft information by marginalizing over the entire observation space is intractable: one must resort to suboptimal methods to implement such receivers. Although list-type detectors such as those founded upon the sphere decoding algorithm provide outstanding error performance, issues such as the optimal initial sphere radius, optimal radius update strategy, and their highly variable computational complexity are still unresolved. In this paper, a new detection scheme is proposed addressing the above issues. Our simulation results show that by sacrificing less than 2 dB at error rate of 10-5, we are able to gain up to 38.6% complexity reduction as well as a detector structure that is more suitable for practical system implementation.
  • Keywords
    iterative decoding; parity check codes; signal detection; LDPC-coded V-BLAST systems; decoding; fixed-complexity list-type iterative joint detection; low density parity check codes; multiple antenna systems; soft iterative detection; Computational complexity; Costs; Detectors; Euclidean distance; Interference cancellation; Iterative decoding; MIMO; Parity check codes; Signal processing; Statistics; Bell Labs Layered Space-Time (BLAST); iterative joint detection and decoding; low-density parity check (LDPC) codes; soft-in/soft-out detectors; sphere decoder;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2008 24th Biennial Symposium on
  • Conference_Location
    Kingston, ON
  • Print_ISBN
    978-1-4244-1945-6
  • Electronic_ISBN
    978-1-4244-1946-3
  • Type

    conf

  • DOI
    10.1109/BSC.2008.4563258
  • Filename
    4563258