Codes and iterative decoding on general graphs
Codes and iterative decoding on general graphs
复制标题
DOI：
10.1109/isit.1995.550455
复制
发表时间：
1995-09
期刊：
影响因子：
--
通讯作者：
N. Wiberg;Hans-Andrea Loeliger;R. Koetter
中科院分区：
文献类型：
--
作者：
N. Wiberg;Hans-Andrea Loeliger;R. Koetter
直到最近，大多数已知的纠错码的解码过程都是基于代数计算错误模式或基于某种树或网格搜索。随着turbo编码的出现，第三种解码原理终于有了突破：迭代解码。关于维特比解码，代码最自然地通过网格图来描述。本文的主要论点是，相对于迭代译码，描述码的自然方式是通过坦纳图，它可以被看作是一个广义的格子。更准确地说，它是一个网格的“时间轴”，推广到一个坦纳图。
Until recently, most known decoding procedures for error-correcting codes were based either on algebraically calculating the error pattern or on some sort of tree or trellis search. With the advent of turbo coding, a third decoding principle has finally had its breakthrough: iterative decoding. With respect to Viterbi decoding, a code is most naturally described by means of a trellis diagram. The main thesis of the present paper is that, with respect to iterative decoding, the natural way of describing a code is by means of a Tanner graph, which may be viewed as a generalized trellis. More precisely, it is the "time axis" of a trellis that is generalized to a Tanner graph.