Codes and Decoding on General Graphs

@misc{citeulike:474663, abstract = {Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding algorithms are special cases of two generic algorithms, the min-sum and sum-product algorithms, which also include non-iterative algorithms such as Viterbi decoding. The min-sum and sum-product algorithms are ...}, author = {Wiberg, N. }, citeulike-article-id = {474663}, posted-at = {2006-01-21 22:55:59}, priority = {2}, title = {Codes and Decoding on General Graphs}, url = {http://citeseer.ist.psu.edu/wiberg96codes.html}, year = {1996} }

TY - GEN ID - citeulike:474663 L3 - citeulike-article-id:474663 N2 - Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding algorithms are special cases of two generic algorithms, the min-sum and sum-product algorithms, which also include non-iterative algorithms such as Viterbi decoding. The min-sum and sum-product algorithms are ... TI - Codes and Decoding on General Graphs AU - Wiberg, N PY - 1996/// UR - http://citeseer.ist.psu.edu/wiberg96codes.html ER -