Bit-optimal decoding of codes whose Tanner graphs are trees (Q1811114)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bit-optimal decoding of codes whose Tanner graphs are trees |
scientific article |
Statements
Bit-optimal decoding of codes whose Tanner graphs are trees (English)
0 references
10 June 2003
0 references
A group algebra formulation for bit-optimal decoding of binary block codes is introduced. Using this new framework a simple algebraic proof is proposed that Pearl's and Gallager's belief propagation decoding algorithms are bit-optimal when the Tanner graph of the code is a tree. Finally, it is shown how Gallager's belief propagation approximates the optimal algorithm.
0 references
bit-optimal decoding
0 references
iterative decoding
0 references
soft-output decoding
0 references
Tanner graph
0 references
belief propagation
0 references
