A new parity-check stopping criterion for turbo decoding
Authors:
- 15 April 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 12 (4) , 304-306
Abstract
This paper presents a simple and effective stopping criterion for Turbo decoding. This criterion is based on parity-check scheme, which is totally different from the cross-entropy (CE) based criteria. Simulations show that the proposed scheme achieves about the same performance in terms of bit-error-rate (BER) and saves more iterations, as compared with other well known CE-based stopping criteria. Furthermore, this parity- check scheme unveils the inner oneness of LDPC codes and turbo codes in the perspective of the decoding convergence, which is an original theoretical discovery.Keywords
This publication has 8 references indexed in Scilit:
- Efficient stopping criterion for iterative decoding of turbo codesElectronics Letters, 2003
- Simple stopping criterion for turbo decodingElectronics Letters, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- A simple stopping criterion for turbo decodingIEEE Communications Letters, 2000
- Two simple stopping criteria for turbo decodingIEEE Transactions on Communications, 1999
- Turbo decoding as an instance of Pearl's "belief propagation" algorithmIEEE Journal on Selected Areas in Communications, 1998
- Iterative decoding of compound codes by probability propagation in graphical modelsIEEE Journal on Selected Areas in Communications, 1998
- Iterative decoding of binary block and convolutional codesIEEE Transactions on Information Theory, 1996