Iterative decoding of serially concatenated convolutional codes
Iterative decoding of serially concatenated convolutional codes
复制标题
串行级联卷积码的迭代解码
DOI：
10.1049/el:19960793
复制
发表时间：
1996
影响因子：
1.1
通讯作者：
G. Montorsi
中科院分区：
文献类型：
--
作者：
S. Benedetto;G. Montorsi
最近，通过使用最大似然性能的上界，由交织器分隔的卷积码的串行级联示出了与文献中所述的并行级联编码方案(Turbo码)竞争。Turbo码最重要的特点在于其相对简单但性能较高的迭代译码算法。提出了一种新的用于串行级联的迭代译码算法，并证明了这种新的编码方案相对于Turbo码具有显著的优势。
Serial concatenation of convolutional codes separated by an interleaver has recently been shown, through the use of upper bounds to the maximum likelihood performance, to be competitive with parallel concatenated coding schemes known in the literature as ‘turbo codes’. The most important feature of turbo codes consists in their relatively simple, yet high performance, iterative decoding algorithm. The authors propose a new iterative decoding algorithm for serial concatenation, and show that the new coding scheme can yield a significant advantage with respect to turbo codes.