An Analysis of the Block Error Probability Performance of Iterative Decoding.
Saved in:
| Title: | An Analysis of the Block Error Probability Performance of Iterative Decoding. |
|---|---|
| Authors: | Lentmaier, Michael, Truhachev, Dmitri V., Zigangirov, Kamil Sh., Costello, Jr., Daniel J. |
| Source: | IEEE Transactions on Information Theory; Nov2005, Vol. 51 Issue 11, p3834-3855, 22p |
| Subject Terms: | PROBABILITY theory, CODING theory, DATA compression, ALGORITHMS, ITERATIVE methods (Mathematics), NUMERICAL analysis |
| 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 P |
| Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!