%0 Journal Article
%T Searching the Optimal Puncture Matrix for Rate Compatible Punctured Turbo (RCPT) Codes with Density Evolution<br>基于似然值概率密度演变的速率可变穿刺Turbo码的最优设计
%A Lü
%A Shu-juan
%A Wei Guo
%A Zhu Jin-kang
%A <br>吕淑娟
%A 卫国
%A 朱近康
%J 电子与信息学报
%D 2007
%I 
%X A new algorithm for searching the optimal puncture matrices of the rate compatible punctured Turbo(RCPT)codes is proposed.The algorithm is based on density evolution and its main goal is to analyze the thresholds for different puncture matrices.The thresholds are calculated using Gaussian approximation and simulation.Compared to a conventional distance spectrum approach,this new approach has two advantages.The first advantage is that the new algorithm is independent of the interleaver.The second is that when the Turbo code is very long,the complexity of the calculation will not increase too much for the proposed approach.In AWGN channels,when the code is long,the examples shows that the optimal puncture matrices are the same for both approaches while the proposed approach has reduced computational complexity.This paper also analyzes the puncture matrices of the code used in 3GPP and provides the optimal matrices and thresholds.The result shows that the rate matching algorithm given in 3GPP corresponds to some RCPT matrixes when using puncturing and these matrixes are the same as those optimal matrices given in this paper for certain rates.
%K Code
%K Density evolution
%K Gaussian approximation
%K Rate Compatible Punctured Turbo(RCPT)codes
%K Threshold
%K 3G
%K Rate matching<br>编码
%K 似然值概率密度演变
%K 高斯近似
%K 速率可变穿刺Turbo码(RCPT)
%K 门限
%K 3G
%K 速率匹配
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=2FC4CA63680E97F0&yid=A732AF04DDA03BB3&vid=771469D9D58C34FF&iid=0B39A22176CE99FB&sid=1A363081E1FF7014&eid=9F8C5EF901EA1E7E&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=12