码率自适应LDPC码删余算法  

Puncturing Algorithm for Design Rate-Compatible LDPC Code

作　　者：肖旻[1] 黎勇[1] 王琳[1] 

机构地区：[1]厦门大学通信工程系,福建厦门361005

出　　处：《应用科学学报》2011年第4期385-389,共5页Journal of Applied Sciences

基　　金：国家自然科学基金(No.60972053);福建省自然科学基金(No 2008J0035)资助

摘　　要：鉴于无线通信信道的时变特性,信道纠错编码必须具备码率自适应的功能.现有的分组拣选算法尽管能构造出性能优秀的码率自适应删余型LDPC码,但达到的最高删余码率受到限制.对此,该文提出一种新的删余算法-分层拣选算法,解决了最高删余码率受限的问题,使码率能够无限接近1,且适用于任意LDPC码.AWGN信道下的仿真结果表明,所提出的算法较分组拣选算法具有更好的性能.Rate compatibility of forward error correction codes is required to accomplish high throughput and reliability over time-varying wireless channels.The grouping and sorting（GS） algorithm can produce rate-compatible puncturing LDPC（RCP-LDPC） codes with good performance.However,there is a limit in the achievable highest puncturing rate.In this paper,a novel layer-by-layer sorting algorithm is proposed to design RCP-LDPC without any limitation in the highest puncturing rate.The algorithm can be applied to an arbitrary LDPC code to obtain a code rate infinitely close to one.Simulation over AWGN channels shows that the proposed algorithm has superior performance as compared to the GS algorithm.

关 键 词：码率自适应 LDPC码 删余 分组拣选 分层拣选 

分 类 号：TN911.22[电子电信—通信与信息系统]