On the performance of turbo codes over the binary erasure channel
In this letter, we propose an estimate for the block erasure probability of turbo codes with an iterative decoding in a waterfall region, which is nonlinearly scaled by the information blocklength. This estimate can be used to predict efficiently the block erasure probability of the finite-length tu...
Saved in:
Published in | IEEE communications letters Vol. 11; no. 1; pp. 67 - 69 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.01.2007
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this letter, we propose an estimate for the block erasure probability of turbo codes with an iterative decoding in a waterfall region, which is nonlinearly scaled by the information blocklength. This estimate can be used to predict efficiently the block erasure probability of the finite-length turbo codes over a binary erasure channel |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1089-7798 1558-2558 |
DOI: | 10.1109/LCOMM.2007.061206 |