检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李通 韩建萍 王光耀 LI Tong;HAN Jianping;WANG Guangyao(Department of Computer Science and Information,Shanxi Engineering Vocational College,Taiyuan,030032,China;Department of Electrical and Power Engineering,Shanxi Institute of Energy,Taiyuan,030600,China;School of Information and Communication Engineering,Beijing University of Technology,Beijing,100124,China)
机构地区:[1]山西工程职业学院计算机信息系,太原030032 [2]山西能源学院电气与动力工程系,太原030600 [3]北京工业大学信息与通信工程学院,北京100124
出 处:《数据采集与处理》2020年第1期155-162,共8页Journal of Data Acquisition and Processing
基 金:山西省教育厅自然科学基金(201801D121124)资助项目
摘 要:针对目前采用传统方法构造(3,m)LDPC码时会产生大量陷阱集的问题,以矩阵格(Rectangular lattices,RL)为基础提出了一种消除基本陷阱集的(3,m)QC-LDPC码的改进构造方法。通过分析矩阵格中基本陷阱集与斜率的关系,选取合适的斜率满足相应的约束条件以避免基本陷阱集的出现;同时,改进方案中的校验矩阵采用准循环结构,降低了LDPC码编译码复杂度。在AWGN信道中的仿真实验结果表明,本文提出的码字构造算法可以有效地降低LDPC码的错误平层。At present,aiming at the problem of many trapping sets are generated when applying the traditional method to construct(3,m)LDPC codes,this paper proposes an improved scheme to construct(3,m)LDPC codes,which eliminate elementary trapping sets(ETS)based on rectangle lattice.By analyzing the relationship between ETSs and slopes,we can select the proper slopes which satisfy the corresponding constrained condition so as to avoid the emergence of ETSs;Simultaneously,quasi-cyclic structure is applied to the parity-check matrix in optimized scheme,which reduces the complexity of encoding and decoding for LDPC codes.The results of simulation experiments on the AWGN channel demonstrate that the proposed constructional algorithm in this paper can reduce the error floor effectively.
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15