Two Efficient Stopping Criteria for Iterative Decoding

Wei  Jiang; Daoben  Li

1st International ICST Conference on Communications and Networking in China

Research Article

Two Efficient Stopping Criteria for Iterative Decoding

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2006.344761,
    author={Wei  Jiang and  Daoben  Li},
    title={Two Efficient Stopping Criteria for Iterative Decoding},
    proceedings={1st International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2007},
    month={4},
    keywords={},
    doi={10.1109/CHINACOM.2006.344761}
}

Wei Jiang
Daoben Li
Year: 2007
Two Efficient Stopping Criteria for Iterative Decoding
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2006.344761

Wei Jiang¹^,*, Daoben Li¹

1: Beijing University of Posts and Telecommunications School of Information Engineering No. 10, Xi Tu Cheng Road, Hai Dian District, Beijing 100876, P. R. China

*Contact email: w.jiang@ieee.org

Abstract

The paper proposes two new stopping criteria for iterative decoding of turbo codes. The first criterion is based on the mutual information between the logarithm likelihood ratio and the data bits, and the second one is based on the a posteriori error probability of the decoded information bits. Compared to the existing stopping rules, the proposed criteria need not to store any extra data, and can reduce the average number of iterations much closer to the genie stopping rule when the performance degradation is negligible.

Published: 2007-04-10
Publisher: IEEE

: http://dx.doi.org/10.1109/CHINACOM.2006.344761