低密度校验码ADMM译码的2种欧几里德投影算法复杂度研究  

Research on the complexity of two kinds of Euclidean projectionalgorithm of ADMM decoding for low-density parity-check codes

作　　者：王钟斐 赵悦 王彪 WANG Zhong-fei;ZHAO Yue;WANG Biao(School of Mathematics and Information Science,Baoji University of Arts and Sciences,Baoji 721013,Shaanxi,China)

机构地区：[1]宝鸡文理学院数学与信息科学学院,陕西宝鸡721013

出　　处：《宝鸡文理学院学报（自然科学版）》2024年第2期1-6,共6页Journal of Baoji University of Arts and Sciences(Natural Science Edition)

基　　金：陕西省自然科学基础研究计划项目(2021JM-515)。

摘　　要：目的 理清低密度校验(Low-Density Parity-Check, LDPC)码的交替方向乘子(Alternating Direction Method of Multipliers, ADMM)译码方法中向量到校验多胞体投影操作的复杂度。方法 比较基于割查找的欧几里德投影算法和快速近似欧几里德投影算法2种典型投影算法的投影结果、算法特点、时间复杂度以及基本操作次数。结果与结论快速近似欧几里德投影算法各种操作的次数低于基于割查找的欧几里德投影算法,表明前者的时间复杂度低于后者。Purposes—To clarify the complexity of vector to check polytope projection operations in the alternating direction method of multipliers(ADMM)decoding method for low-density parity-check(LDPC)codes.Methods—The projection results,algorithm characteristics,time complexity and basic operation times of the two typical projection algorithms,namely the Euclidean projection algorithm based on cut search and the fast approximate Euclidean projection algorithm,are compared.Results and Conclusions—The fast approximation Euclidean projection algorithm requires fewer operations than the Euclidean projection algorithm based on cut search,which indicates that the former has a lower time complexity than the latter.

关 键 词：低密度校验码 校验多胞体 投影算法 复杂度 

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