Improved upper bounds on the performance of parallel and serial concatenated turbo codes via their ensemble distance spectrum

Improved upper bounds on the performance of parallel and serial concatenated turbo codes via their ensemble distance spectrum
复制标题

通过集合距离谱改进并行和串行级联 Turbo 码的性能上限

DOI:
10.1109/isit.1998.708610
复制
发表时间:
1998
期刊:
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)
影响因子:
--
通讯作者:
S. Shamai
S. Shamai
中科院分区:
--
文献类型:
--
作者:
I. Sason;S. Shamai

文献摘要

被引文献

相似文献

研究了并行和串行级联Turbo码在二进制输入AWGN信道和最大似然(ML)译码条件下的总体性能。推导了并行级联码和串行级联码的集合距离谱,得到了这些集合码的误比特率和误块率的改进上界,并研究了交织器长度N和分量码存储器长度m的影响。基于切向球边界的改进边界技术与传统的联合边界以及Duman和Salehi的替代边界技术进行了比较(参见Proceedings of 1997 Global Communications Conference(GLOBECOM'97),Phoenix,Arizona,USA,p.634-8,1997)。的优势的界限证明了各种并行和串行级联编码方案,无论是固定的或随机的分量码,它是特别明显的截止率以上的区域,其中TC的性能是最吸引人的。
The ensemble performance of parallel and serial concatenated turbo codes (TC) is considered for a binary-input AWGN channel and maximum likelihood (ML) decoding. Following the derivation of the ensemble distance spectrum of parallel and serial concatenated codes, improved upper bounds on the bit and block error probabilities of these ensembles of codes are derived and the influence of the interleaver length N and the memory length of the component codes m are investigated. The improved bounding technique, based on the tangential sphere bound, is compared to the conventional union bound and to an alternative bounding technique by Duman and Salehi (see Proceedings of 1997 Global Communications Conference (GLOBECOM'97), Phoenix, Arizona, USA, p.634-8, 1997). The advantage of the bounds is demonstrated for a variety of parallel and serial concatenated coding schemes with either fixed or random component codes, and it is especially pronounced in the region above the cutoff rate, where the performance of TC is most appealing.