• DocumentCode
    3159073
  • Title

    A new stopping criterion for iterative decoding

  • Author

    Bokolamulla, Dhammika ; Aulin, Tor

  • Author_Institution
    Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden
  • Volume
    1
  • fYear
    2004
  • fDate
    20-24 June 2004
  • Firstpage
    538
  • Abstract
    We propose a new stopping criterion for iterative decoding of concatenated codes. The new stopping rule observes the a priori probabilities of different symbols and stops further iterations in the decoder whenever the average number of symbols in a trellis section below a certain a priori value, is above a predefined threshold. According to numerical examples for some practical transmission systems, the proposed criterion saves more decoding iterations than existing stopping rules. Also, it performs very close to the maximum possible limit of any stopping rule, with a very small degradation in bit error rate (BER) performance.
  • Keywords
    concatenated codes; error statistics; iterative decoding; probability; trellis codes; BER; a priori probability; bit error rate; concatenated code; iterative decoding; stopping criterion; trellis code; Bit error rate; Computational complexity; Concatenated codes; Degradation; Iterative decoding; Telecommunication computing; Termination of employment; Thyristors; Transmitters; Turbo codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2004 IEEE International Conference on
  • Print_ISBN
    0-7803-8533-0
  • Type

    conf

  • DOI
    10.1109/ICC.2004.1312547
  • Filename
    1312547