An analysis of the block error probability performance of iterative decoding
(2005) In IEEE Transactions on Information Theory 51(11). p.3834-3855- Abstract
- Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes N and the number of iterations I go to infinity. Three classes of codes are considered. These are Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due to Berrou et al. It is proved that there exist codes in these classes and iterative decoding algorithms for these codes for which not only the bit error probability Pb, but also the block (frame) error probability PB, goes to zero as N and I go to infinity.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731693
- author
- Lentmaier, Michael LU ; Truhachev, Dmitri ; Zigangirov, Kamil LU and Costello Jr., Daniel J.
- organization
- publishing date
- 2005
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- block error probability, LDPC codes, generalized LDPC codes, GLDPC codes, turbo codes, iterative decoding
- in
- IEEE Transactions on Information Theory
- volume
- 51
- issue
- 11
- pages
- 3834 - 3855
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- scopus:27744494227
- ISSN
- 0018-9448
- DOI
- 10.1109/TIT.2005.856942
- language
- English
- LU publication?
- yes
- id
- 7646d479-6995-4a97-b582-fcb62dfe5154 (old id 3731693)
- date added to LUP
- 2016-04-04 09:18:50
- date last changed
- 2022-04-15 22:49:03
@article{7646d479-6995-4a97-b582-fcb62dfe5154, abstract = {{Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes N and the number of iterations I go to infinity. Three classes of codes are considered. These are Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due to Berrou et al. It is proved that there exist codes in these classes and iterative decoding algorithms for these codes for which not only the bit error probability Pb, but also the block (frame) error probability PB, goes to zero as N and I go to infinity.}}, author = {{Lentmaier, Michael and Truhachev, Dmitri and Zigangirov, Kamil and Costello Jr., Daniel J.}}, issn = {{0018-9448}}, keywords = {{block error probability; LDPC codes; generalized LDPC codes; GLDPC codes; turbo codes; iterative decoding}}, language = {{eng}}, number = {{11}}, pages = {{3834--3855}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, series = {{IEEE Transactions on Information Theory}}, title = {{An analysis of the block error probability performance of iterative decoding}}, url = {{http://dx.doi.org/10.1109/TIT.2005.856942}}, doi = {{10.1109/TIT.2005.856942}}, volume = {{51}}, year = {{2005}}, }