可分解的可分组设计构造的LDPC码

doi:10.3969/j.issn.1001-2400.2017.03.006

西安电子科技大学学报

可分解的可分组设计构造的LDPC码

孙成1;徐恒舟1;冯丹1;白宝明1;张玉龙2

(1. 西安电子科技大学综合业务网理论及关键技术国家重点实验室，陕西西安 710071;
2. 河南省周口水文资源勘测局，河南周口 466000)

收稿日期:2016-04-29 出版日期:2017-06-20 发布日期:2017-07-17
作者简介:孙成(1991-)，男，西安电子科技大学硕士研究生，E-mail: chengsun@stu.xidian.edu.cn
基金资助:
国家自然科学基金资助项目(61372074)；国家高科技863计划重大资助项目(2015AA01A709)；国家重点基础研究发展计划(“973”计划)资助项目(2012CB316103)

LDPC codes constructed from resolvable group divisible designs

SUN Cheng1;XU Hengzhou1;FENG Dan1;BAI Baoming1;ZHANG Yulong2

(1. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an 710071, China;
2. Zhoukou Hydrology and Water Resources Survey Bureau of Henan Province, Zhoukou 466000, China)

Received:2016-04-29 Online:2017-06-20 Published:2017-07-17

摘要/Abstract

摘要：

提出了利用可分解的可分组设计构造低密度校验码的新方法，所构造的低密度校验码的围长至少为6，且码率、码长灵活可变．同时，基于可分解的可分组设计，又构造了一类掩模矩阵，从而利用掩模技术，得到了更多的准循环低密度校验码．数值结果表明，在加性高斯白噪声信道上，采用和积译码算法，所提出的低密度校验码的性能优异且迭代收敛快．此外，掩模后的准循环低密度校验码比掩模前有较大的误码率/误帧率性能提升．

关键词: 低密度校验码, 围长, 掩模, 可分解的可分组设计

Abstract:

A new construction method for low-density parity-check (LDPC) codes is presented based on resolvable group divisible designs (RGDDs). The resulting LDPC codes are free of 4-cycle. With the use of RGDDs, a class of masking matrices is also constructed, and then many more quasi-cyclic (QC) LDPC codes are obtained by the masking technique. Numerical results show that the proposed LDPC codes with iterative decoding using the sum-product algorithm perform very well over the AWGN channel. Furthermore, the QC-LDPC codes constructed based on masking have a better BER/FER performance than the original ones.

Key words: LDPC codes, girth, masking, resolvable group divisible designs

孙成;徐恒舟;冯丹;白宝明;张玉龙. 可分解的可分组设计构造的LDPC码[J]. 西安电子科技大学学报, 2017, 44(3): 31-35+42.

SUN Cheng;XU Hengzhou;FENG Dan;BAI Baoming;ZHANG Yulong. LDPC codes constructed from resolvable group divisible designs[J]. Journal of Xidian University, 2017, 44(3): 31-35+42.

参考文献

［1］ GALLAGER R G. Low-density Parity-check Codes ［J］. IRE Transactions on Information Theory, 1962, 8(1): 21-28.
［2］ MACKAY D J C, NEAL R M. Near Shannon Limit Performance of Low Density Parity check Codes ［J］. Electronics Letters, 1996, 32(18): 1645-1646.
［3］ WANG R, LI Y, ZHAO H, et al. Construction of Girth-eight Quasi-cyclic Low-density Parity-check Codes with Low Encoding Complexity ［J］. IET Communications, 2016, 10(2): 148-153.
［4］ BABAR Z, BOTSINIS P, ALANIS D, et al. Construction of Quantum LDPC Codes from Classical Row-circulant QC-LDPCs［J］. IEEE Communications Letters, 2016, 20(1): 9-12.
［5］ LEE J H, SUNWOO M H. Low-complexity First-two-minimum-values Generator for Bit-serial LDPC Decoding ［J］. IEEE Transactions on Circuits and Systems II: Express Briefs, 2016, 63(5):483-487.
［6］ OLMOS P M, MITCHELL D G M, COSTELLO D J. Analyzing the Finite-length Performance of Generalized LDPC Codes ［C］//Preceedings of the IEEE International Symposium on Information Theory. Piscataway: IEEE, 2015: 2083-2687.
［7］ FANG Y, BI G, GUAN Y L, et al. A Survey on Protograph LDPC Codes and Their Applications ［J］. IEEE Communications Surveys and Tutorials, 2015, 17(4): 1989-2016.
［8］ DIAO Q, TAI Y Y, LIN S, et al. LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing ［J］. IEEE Transactions on Information Theory, 2013, 59(12): 7898-7914.
［9］ LAN L, TAI Y Y, LIN S, et al. New Constructions of Quasi-cyclic LDPC Codes Based on Special Classes of BIBDs for the AWGN and Binary Erasure Channels ［J］. IEEE Transactions on Communications, 2008, 56(1):39-48.
［10］ SONG S, ZHOU B, LIN S, et al. A Unified Approach to the Construction of Binary and Nonbinary Quasi-cyclic LDPC Codes Based on Finite Fields ［J］. IEEE Transactions on Communications, 2009, 57(1), 84-93.
［11］ LI J, LIU K, LIN S, et al. A Matrix-theoretic Approach to the Construction of Non-binary Quasi-cyclic LDPC Codes ［J］. IEEE Transactions on Communications, 2015, 63(4): 1057-1068.
［12］ VASIC B, MILENKOVIC O. Combinatorial Constructions of Low-density Parity-check Codes for Iterative Decoding ［J］. IEEE Transactions on Information Theory, 2004, 50(6): 1156-1176.
［13］ CHEN C, BAI B M, WANG X M. Construction of Nonbinary Quasi-cyclic LDPC Cycle Codes Based on Singer Perfect Difference Set ［J］. IEEE Communications Letters, 2010, 14(2): 181-183.
［14］ RYAN W E, LIN S. Channel Codes: Classical and Modern ［M］. Cambridge: Cambridge University Press, 2009: 487-490.
［15］ XU H Z, FENG D, SUN C, et al. Construction of LDPC Codes Based on Resolvable Group Divisible Designs ［C］//Preceedings of the 2015 International Workshop on High Mobility Wireless Communications. Piscataway: IEEE, 2015: 111-115.
［16］沈灏. 组合设计理论［M］. 2版. 上海: 上海交通大学出版社, 2008: 16-18.
［17］ SUN X W, GE G N. Resolvable Group Divisible Designs with Block Size Four and General Index ［J］. Discrete Mathematics, 2009, 309(10): 2982-2989.
［18］ MACKAY D. MacKay 's Homepage ［DB/OL］. ［2015-10-26］. http://www.inference.phy.cam.ac.uk/mackay/CodesFiles.html.
［19］ XU J, CHEN L, DJURDJEVIC I, et al. Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking ［J］. IEEE Transactions on Information Theory, 2007, 53(1): 121-134.

[1]	梅淑琳,贾海蓉,王晓刚,武奕峰. 动态特征联合新掩模优化神经网络语音增强[J]. 西安电子科技大学学报, 2021, 48(3): 91-98.
[2]	周沈洋,白宝明,任兆丰,朱敏,李秉豪,唐瑞波. 面向高吞吐传输的级联极化码BP List译码算法[J]. 西安电子科技大学学报, 2020, 47(6): 58-65.
[3]	贾海蓉,王卫梅,王雁,裴俊华. 区分性联合稀疏字典交替优化的语音增强[J]. 西安电子科技大学学报, 2019, 46(3): 74-81.
[4]	王彪;慕建君;焦晓鹏;王钟斐. LDPC码ADMM惩罚译码的早停止方法[J]. 西安电子科技大学学报, 2018, 45(5): 43-49.
[5]	徐恒舟;孙成;白宝明. 循环差族构造的多元LDPC码[J]. 西安电子科技大学学报, 2017, 44(1): 6-11+28.
[6]	徐娟;姚如贵;李路;高凡琪. 优化稀疏LU分解的LDPC编码算法研究 [J]. J4, 2015, 42(2): 127-132.
[7]	郭军军;慕建君. 一种LDPC码有限字母表迭代译码器选择算法[J]. J4, 2013, 40(6): 111-115.
[8]	张国华；王新梅. 一类围长至少为6的QC-LDPC码的存在性[J]. J4, 2011, 38(3): 136-139+149.
[9]	崔俊云;白宝明;郭旭东. 一种改进的准循环LDPC码环消除算法[J]. J4, 2010, 37(4): 700-704.
[10]	陈超;白宝明;王新梅. 一类具有低密度生成矩阵的非二元准循环LDPC码[J]. J4, 2010, 37(3): 412-416.
[11]	焦晓鹏;慕建君;周利华. 一种Tanner图短环计数新方法[J]. J4, 2010, 37(2): 311-314.
[12]	陈霖;冯大政. 一种快速的渐进边增长算法[J]. J4, 2009, 36(3): 406-409.
[13]	胡家义;王文博. 基于加权图的准循环低密度奇偶校验码构造算法 [J]. J4, 2008, 35(5): 938-941.
[14]	王单;童胜;李颖;王新梅. LDPC码的快速收敛译码算法[J]. J4, 2005, 32(1): 103-107.
[15]	童胜;王鹏;王单;王新梅. LDPC码量化和积译码的高效实现[J]. J4, 2004, 31(5): 709-713.

可分解的可分组设计构造的LDPC码

LDPC codes constructed from resolvable group divisible designs

PDF (PC)

赞

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

Metrics

本文评价

推荐阅读 10