一种优化Girth分布的准循环LDPC码设计方法研究
doi: 10.3724/SP.J.1146.2006.02002
A Method for Designing Quasi-Cyclic LDPC Codes Based on Girth Optimization
-
摘要: 在准循环LDPC码的构造中，校验矩阵拥有尽可能好的girth分布对于改善码的性能有着重要的意义。该文提出了构造准循环LDPC码的GirthOpt-DE算法，优化设计以获得具有好girth分布的移位参数矩阵为目标。仿真结果表明，该文方法得到的准循环LDPC码在BER性能和最小距离上均要优于固定生成函数的准循环LDPC码，Arrary码和Tanner码，并且使用上更为灵活，可以指定码长，码率及尽可能好的girth分布。Abstract: The key to improving the performance of QC LDPC codes is how to construct a parity-check matrix H with a girth distribution as good as possible. In this paper, a novel algorithm for constructing QC LDPC codes, GirthOpt-DE algorithm, is proposed, which achieves a good girth distribution based on the differential evolution. Simulation results show that the performance of the QC LDPC codes constructed with the proposed algorithm is superior to Array codes and Tanner codes in both BER and the minimum distance. Besides, the proposed algorithm is more flexible for designing the QC LDPC codes with desired block length and rate as well as good girth.
-
Tanner R M, Sridhara D, and Sridhara A, et al.. LDPC blockand convolutional codes based on circulant matrices[J].IEEETrans. on Inform. Theory.2004, 50(12):2966-2984[2]Fossorier M. Quasi-cyclic low-density parity-check codes fromcirculant permutation matrices[J].IEEE Trans. on Inform.Theory.2004, 50(8):1788-1793[3]Fan J L. Array codes as low-density parity-check codes[C]. InProc. 2nd Int. symp. turbo codes and related topics, brest,France, sept. 4-7, 2000: 553-556.[4]Yoshida K, Brockman J, and Costello D, et al.. VLSIimplementation of quasi cyclic LDPC codes[C]. In Proc.2004Int. Symp. Information Theory and its Application, Italy,Oct.10-13, 2004: 551-556.[5]Chen Z G and Bates S. Construction of low-densityparity-check convolutional codes through progressive edgegrowth[J].IEEE Communications Letters.2005, 9(12):1058-1060[6]Ko Y J and Kim J H. Girth conditioning for construction ofshort block length irregular LDPC codes [J]. ElectronicsLetters, 2004, 40(3): 187-188.[7]Milenkovic O. Shortened array codes of large girth[J].IEEETrans. on Inform. Theory.2006, 52(8):3707-3722[8]Mao Y M and Banihashemi A H. A heuristic search for goodlow-denstiy parity-check codes at short block lengths[C].InIEEE ICC2001, St.-Petersburg, Russia, June 11-15, 2001:41-44.[9]Hu X Y and Fossorier M. On the computation of theminimum distance of low-density parity-check codes [C]. InIEEE ICC2004, Paris, France, June 20-24, 2004: 767-771. -
计量
- 文章访问数: 2961
- HTML全文浏览量: 83
- PDF下载量: 1031
- 被引次数: 0
下载:
