English

应用科学学报 >

2011 , Vol. 29 >Issue 4: 385 - 389

DOI: https://doi.org/10.3969/j.issn.0255-8297.2011.04.009

通信工程

 码率自适应LDPC码删余算法

展开
  • 厦门大学通信工程系，福建厦门361005
肖旻，博士生，研究方向：通信系统信道纠错编码，E-mail: mix209@gmail.com；王琳，教授，博导，研究方向：通信物理层 算法设计分析与实现，E-mail: wanglin@xmu.edu.cn

收稿日期: 2010-12-01

  修回日期: 2011-02-22

  网络出版日期: 2011-07-30

基金资助

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

收起

Puncturing Algorithm for Design Rate-Compatible LDPC Code

Expand
  • Department of Communication Engineering, Xiamen University, Xiamen 361005, Fujian Province, China

Received date: 2010-12-01

  Revised date: 2011-02-22

  Online published: 2011-07-30

Fold

摘要

鉴于无线通信信道的时变特性，信道纠错编码必须具备码率自适应的功能. 现有的分组拣选算法尽管能构造出性能优秀的码率自适应删余型LDPC码，但达到的最高删余码率受到限制. 对此，该文提出一种新的删余算法–分层拣选算法，解决了最高删余码率受限的问题，使码率能够无限接近1，且适用于任意LDPC码. AWGN信道下的仿真结果表明，所提出的算法较分组拣选算法具有更好的性能.

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

本文引用格式

肖旻， 黎勇， 王琳 .  码率自适应LDPC码删余算法[J]. 应用科学学报, 2011 , 29(4) : 385 -389 . DOI: 10.3969/j.issn.0255-8297.2011.04.009

Abstract

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.

Key words：  rate-compatible; low density parity check (LDPC) codes; puncturing, grouping and sorting; sorting layer by layer

Options
文章导航

/

〈 〉