Simple stopping criterion for min-sum iterative decoding algorithm
A simple stopping criterion for iterative decoding based on min-sum processing is presented. While most stopping criteria suggested in the literature are based on cross entropy (CE) and its simplification, the proposed stopping criterion is to check whether a decoded sequence is a valid codeword alo...
Saved in:
| Published in: | Electronics letters Vol. 37; no. 25; pp. 1530 - 1531 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
06.12.2001
|
| ISSN: | 0013-5194 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A simple stopping criterion for iterative decoding based on min-sum processing is presented. While most stopping criteria suggested in the literature are based on cross entropy (CE) and its simplification, the proposed stopping criterion is to check whether a decoded sequence is a valid codeword along the encoder trellis structure. This new stopping criterion requires less computational complexity and saves memory. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0013-5194 |
| DOI: | 10.1049/el:20011013 |