• DocumentCode
    3639088
  • Title

    Informed message update for iterative MIMO demapping and turbo decoding

  • Author

    Dan Zhang;I-Wei Lai;Konstantinos Nikitopoulos;Gerd Ascheid

  • Author_Institution
    Institute for Integrated Signal Processing Systems, RWTH Aachen University, Templegraben 55, 52062 Aachen, Germany
  • fYear
    2010
  • Firstpage
    873
  • Lastpage
    878
  • Abstract
    In this paper, the iterative scheduling issue for multiple-input multiple-output (MIMO) systems with turbo codes is addressed based on the informed asynchronous scheduling, initially used for scheduling low-density parity-check (LDPC) decoding. For the iterative MIMO demapping and turbo decoding, the convergence behavior by using the informed asynchronous scheduling is first demonstrated to be similar to the standard sequential scheduling. As the extrinsic log-likelihood ratio (LLR) calculation at both the MIMO demapper and turbo decoder costs high complexity, an informed message update (IMU) rule is further proposed to select only a subset of extrinsic LLRs for updates within each iteration. By avoiding the re-calculations for the extrinsic LLRs with small changes between successive iterations, significant complexity savings are achieved with negligible error rate performance loss.
  • Keywords
    "Decoding","MIMO","Iterative decoding","Complexity theory","Measurement","Turbo codes","Convergence"
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and its Applications (ISITA), 2010 International Symposium on
  • Print_ISBN
    978-1-4244-6016-8
  • Type

    conf

  • DOI
    10.1109/ISITA.2010.5649576
  • Filename
    5649576