检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙怡宁 黄秋 胡剑浩[1] 康凯[1] Yining SUN;Qiu HUANG;Jianhao HU;Kai KANG(National Key Laboratory of Science and Technology on Communication,University of Electronic Science and Technology of China,Chengdu 611731,China)
机构地区:[1]电子科技大学通信抗干扰技术国家级重点实验室,成都611731
出 处:《中国科学:信息科学》2022年第5期922-933,共12页Scientia Sinica(Informationis)
基 金:国家重点研发计划(批准号:2018YFB1801500)资助项目。
摘 要:现有的译码方案中,由于复杂度问题,LDPC码多使用部分并行译码架构,难以满足高速、超高速应用;RS码多采用硬判决译码算法.因此,对于RS-LDPC级联码译码在复杂度和性能上有进一步优化的空间.本文基于概率计算的思想提出了RS-LDPC概率联合迭代译码算法.该算法继承了概率LDPC译码器的低复杂度优势和概率RS译码算法可采用硬译码器逼近软译码性能的特点,同时通过联合迭代译码架构改善了译码性能.为此,我们设计了一种基于LDPC概率值的测试向量产生方法和一种新颖的应用于概率LDPC译码器的变量节点结构的附加外信息生成机制.仿真结果表明,在误比特率为10-6处,我们提出的算法与使用浮点BP和BM硬判决译码的RS-LDPC级联译码方案相比,可以获得0.3 d B的增益;其实现复杂度为一个概率LDPC译码器和多个RS硬译码器的复杂度;译码时延由概率LDPC译码器时延决定.因此,本文提出的联合译码算法具有很好的应用价值.Due to complexity issues,low-density parity-check(LDPC)codes often use a partial parallel decoding architecture,which cannot easily meet the requirements of high-speed and ultra-high-speed applications.Conversely,the Reed-Solomon(RS)codes often use hard decision decoding algorithms in existing decoding schemes.Therefore,there is room for further optimization in the complexity and performance of concatenated RS-LDPC decoding.In this paper,we propose an RS-LDPC stochastic joint iterative decoding algorithm based on the principle of stochastic computing.This algorithm inherits the advantages of the low complexity of stochastic LDPC decoders and the feature of stochastic RS decoding algorithms,which can use hard decoders.Meanwhile,the decoding performance is improved through the joint iterative decoding architecture.In this respect,we design a test-vector generation method based on LDPC probability values and adopt a novel additional extrinsic information generation mechanism.Such a mechanism is applied to the structure of the variable nodes of the stochastic LDPC decoder.The simulation results show that at a bit error rate of 10-6,the proposed algorithm can obtain a gain of 0.3 d B as compared with the RS-LDPC cascaded decoding scheme using floating-point belief propagation and Berlekamp-Massey hard decision decoding algorithm.Its implementation complexity is the complexity of a stochastic LDPC decoder and several RS hard decoders.The decoding latency is determined by the latency of the stochastic LDPC decoder.Therefore,the joint iterative decoding algorithm proposed in this paper has a very good application value.
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7