无小环大列重QC-LDPC短码的显式构造

张国华; 孙爱晶; 倪孟迪; 方毅

doi:10.12263/DZXB.20230300

您当前的位置：

首页 >

文章列表页 >

无小环大列重QC-LDPC短码的显式构造

学术论文 | 更新时间：2025-12-11

- 无小环大列重QC-LDPC短码的显式构造
- Explicit Constructions of Short QC-LDPC Codes Free of Small Cycles and with Large Column Weight
- 电子学报 2024年52卷第6期页码：1862-1868
- 作者机构：
  
  1.西安邮电大学通信与信息工程学院，陕西西安 710121
  2.广东工业大学信息工程学院，广东广州 510000
- 作者简介：
  
  [ "张国华男，1977年生于山西临汾.博士，研究员，硕士生导师.主要研究方向为信道编码.E-mail: zhangghcast@163.com" ]
  [ "孙爱晶女，1971年生于甘肃庆阳.西安邮电大学通信与信息工程学院教授，硕士生导师.主要研究方向为物联网技术及应用.E-mail: sunaijing@xupt.edu.cn" ]
  [ "倪孟迪女，1999年生于四川成都.西安邮电大学通信与信息工程学院硕士研究生，主要研究方向为LDPC码的构造和译码.E-mail: ni_mengdi@163.com" ]
  [ "方毅男，1986年生于浙江义乌.博士，广东工业大学信息工程学院教授，博士生导师.主要研究方向为面向通信与存储系统的信道编码.中国电子学会会员编号：E190028682M.E-mail: fangyi@gdut.edu.cn" ]
- 基金信息：
  
  国家自然科学基金(62322106;62071131);广东省国际科技合作项目(2022A0505050070)
- DOI：10.12263/DZXB.20230300
  中图分类号： TN911.22;TN927
- 收稿：2023-04-04，
  
  修回：2023-10-14，
  
  纸质出版：2024-06-25
- 稿件说明：
移动端阅览
张国华,孙爱晶,倪孟迪,等.无小环大列重QC-LDPC短码的显式构造[J].电子学报,2024,52(06):1862-1868.

ZHANG Guo-hua, SUN Ai-jing, NI Meng-di, et al.Explicit Constructions of Short QC-LDPC Codes Free of Small Cycles and with Large Column Weight[J].Acta Electronica Sinica, 2024, 52(06): 1862-1868.
张国华,孙爱晶,倪孟迪,等.无小环大列重QC-LDPC短码的显式构造[J].电子学报,2024,52(06):1862-1868. DOI：10.12263/DZXB.20230300

ZHANG Guo-hua, SUN Ai-jing, NI Meng-di, et al.Explicit Constructions of Short QC-LDPC Codes Free of Small Cycles and with Large Column Weight[J].Acta Electronica Sinica, 2024, 52(06): 1862-1868. DOI：10.12263/DZXB.20230300

摘要

针对列重较大的无4环且无6环的准循环（Quasi-Cyclic，QC）低密度奇偶校验（Low-Density Parity-Check，LDPC）码，本文提出了三种新的显式构造方法.新方法的指数矩阵由两个整数序列完全定义，其中第一个序列是从0开始且公差为1的等差序列，第二个序列是由符合最大公约数约束的整数组成的特殊序列.对于现有显式方法只能提供较大循环块尺寸的多种行重类型，新显式构造方法在这些行重类型下均获得了相当小的循环块尺寸，从而将最小循环块尺寸降低到大约只有原来的一半.与近期提出的基于搜索的对称结构法相比，新的显式构造方法具有类似或更优的译码性能、极低的描述复杂度且不需要计算机搜索.

Abstract

Three new explicit constructions are proposed for quasi-cyclic (QC) low-density parity-check (LDPC) codes free of 4-cycles and 6-cycles with large column weights. The exponent matrices for these new methods are completely defined by two sequences of integers. The first sequence is an arithmetic sequence starting from zero with the common difference being one

and the second is a special sequence composed of integers satisfying the greatest-common-divisor(GCD) constraint. The new methods can produce rather small circulant sizes for many categories of row weights

while the existing explicit methods can only provide relatively large circulant sizes

thus the up-to-date smallest circulant sizes being nearly halved. Compared with the recently proposed symmetrical construction which relies upon extensive search

the new explicit constructions have similar or better decoding performance

possess extremely low description complexity and need no computer search.

关键词

Keywords

references

FOSSORIER M P C . Quasi-cyclic low-density parity-check codes from circulant permutation matrices [J ] . IEEE Transactions on Information Theory , 2004 , 50 ( 8 ): 1788 - 1793 .

KIM I , SONG H Y . Some new constructions of girth-8 QC-LDPC codes for future GNSS [J ] . IEEE Communications Letters , 2021 , 25 ( 12 ): 3780 - 3784 .

VASIC B , PEDAGANI K , IVKOVIC M . High-rate girth-eight low-density parity-check codes on rectangular integer lattices [J ] . IEEE Transactions on Communications , 2004 , 52 ( 8 ): 1248 - 1252 .

ZHANG G H , SUN R , WANG X M . Construction of girth-eight QC-LDPC codes from greatest common divisor [J ] . IEEE Communications Letters , 2013 , 17 ( 2 ): 369 - 372 .

TASDIGHI A , BANIHASHEMI A H , SADEGHI M R . Symmetrical constructions for regular girth-8 QC-LDPC codes [J ] . IEEE Transactions on Communications , 2017 , 65 ( 1 ): 14 - 22 .

KHARIN A , DRYAKHLOV A , MIROKHIN E , et al . An approach to the generation of regular QC-LDPC codes with girth 8 [C ] // 2020 9th Mediterranean Conference on Embedded Computing (MECO) . Piscataway : IEEE , 2020 : 1 - 4 .

ZHANG G H , SUN R , WANG X M . Several explicit constructions for (3,L) QC-LDPC codes with girth at least eight [J ] . IEEE Communications Letters , 2013 , 17 ( 9 ): 1822 - 1825 .

张国华 , 孙蓉 , 王新梅 . 围长为8的QC-LDPC码的显式构造及其在CRT方法中的应用 [J ] . 通信学报 , 2012 , 33 ( 3 ): 171 - 176 .

ZHANG G H , SUN R , WANG X M . Explicit construction of girth-eight QC-LDPC codes and its application in CRT method [J ] . Journal on Communications , 2012 , 33 ( 3 ): 171 - 176 . (in Chinese)

KARIMI M , BANIHASHEMI A H . On the girth of quasi-cyclic protograph LDPC codes [J ] . IEEE Transactions on Information Theory , 2013 , 59 ( 7 ): 4542 - 4552 .

ZHANG J H , ZHANG G H . Deterministic girth-eight QC-LDPC codes with large column weight [J ] . IEEE Communications Letters , 2014 , 18 ( 4 ): 656 - 659 .

WANG J H , ZHANG J H , ZHOU Q , et al . Full-length row-multiplier QC-LDPC codes with girth eight and short circulant sizes [J ] . IEEE Access , 2023 , 11 : 22250 - 22265 .

ZHANG Y , DA X Y . Construction of girth-eight QC-LDPC codes from arithmetic progression sequence with large column weight [J ] . Electronics Letters , 2015 , 51 ( 16 ): 1257 - 1259 .

张轶 , 达新宇 , 苏一栋 . 任意列重大围长QC-LDPC码的确定性构造 [J ] . 电子学报 , 2016 , 44 ( 8 ): 1814 - 1819 .

ZHANG Y , DA X Y , SU Y D . Deterministic construction of QC-LDPC codes for any column weight with a large girth [J ] . Acta Electronica Sinica , 2016 , 44 ( 8 ): 1814 - 1819 . (in Chinese)

DERRIEN A , BOUTILLON E , CERQUEUS A . Additive, structural, and multiplicative transformations for the construction of quasi-cyclic LDPC matrices [J ] . IEEE Transactions on Communications , 2019 , 67 ( 4 ): 2647 - 2659 .

LI J , LIU K , LIN S , et al . Quasi-cyclic LDPC codes on two arbitrary sets of a finite field [C ] // 2014 IEEE International Symposium on Information Theory . Piscataway : IEEE , 2014 : 2454 - 2458 .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于等差数列的LDPC码编码器设计

基于注意力惩罚和自适应学习的场景图增强联合多模态方面情感分析

衰减解耦机制的图像分类网络

基于自适应群体掩码图卷积网络的行人轨迹预测

基于耦合三角型拓扑的IPD高选择性带通滤波器综合设计和实验研究