IEEE transactions on information theory, 2005-11, Vol.51 (11), p.3834-3855
2005
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- An analysis of the block error probability performance of iterative decoding
- Ist Teil von
- IEEE transactions on information theory, 2005-11, Vol.51 (11), p.3834-3855
- Ort / Verlag
- New York: IEEE
- Erscheinungsjahr
- 2005
- Quelle
- IEEE Electronic Library Online
- Beschreibungen/Notizen
- 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 P/sub b/, but also the block (frame) error probability P/sub B/, goes to zero as N and I go to infinity.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0018-9448eISSN: 1557-9654DOI: 10.1109/TIT.2005.856942Titel-ID: cdi_proquest_miscellaneous_28065035
- Format
- –
- Schlagworte
- Algorithms, Asymptotic methods, Belief propagation, block error probability, Codes, Communication channels, Convergence, convergence analysis, density evolution, Electrical Engineering, Electronic Engineering, Information Engineering, Elektroteknik och elektronik, Engineering and Technology, Error probability, Errors, generalized LDPC codes, GLDPC codes, H infinity control, Information theory, Iterative algorithms, Iterative decoding, LDPC codes, low-density parity-check (LDPC) codes, Maximum likelihood decoding, Parity check codes, Performance analysis, Probability, Teknik, Turbo codes