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...
Uloženo v:
| Vydáno v: | Electronics letters Ročník 37; číslo 25; s. 1530 - 1531 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
06.12.2001
|
| ISSN: | 0013-5194 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0013-5194 |
| DOI: | 10.1049/el:20011013 |