检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:彭红焘 张立冬 史治平[3] 李艳霞 唐锐 PENG Hongtao;ZHANG Lidong;SHI Zhiping;LI Yanxia;TANG Rui(Military Representative Office of PLA for Southwest China Institute of Electronic Technology,Chengdu 610036,China;Institute of System Engineering,Academy of Military Science,Beijing 100141,Chin;National Key Laboratory of Science and Technology on Communication,University of Electronic Science and Technology of China,Chengdu 611731,China)
机构地区:[1]解放军驻中国西南电子技术研究所军事代表室,成都610036 [2]军事科学院系统工程研究院,北京100141 [3]电子科技大学通信抗干扰技术国家级重点实验室,成都611731
出 处:《电讯技术》2018年第8期929-933,共5页Telecommunication Engineering
摘 要:为了加快低密度奇偶校验(LDPC)码的译码速度,有效改善LDPC码的译码性能,针对校验节点更新过程中的对数似然比(LLR)值的大小,设计了一种LDPC码的动态加权译码方法。以IEEE 802.16e标准的奇偶校验矩阵为例,根据LLR值的变化规律,利用增长因子和抑制因子对和积译码算法和最小和译码算法进行动态加权。仿真结果显示,基于动态加权的译码方法相对于传统译码方法误码率都有明显改进,译码复杂度也有所降低。In order to improve the decoding speed and the decoding performance of Low Density Parity Check(LDPC) codes,a dynamic weighted decoding method is designed for LDPC codes based on the value of log-likelihood ratio(LLR) in the check node update process.The parity check matrix of IEEE 802.16e is taken as the example.Then,according to the change rule of LLR value,the growth factor and the suppression factor are used to dynamically weight the LLR of the sum product decoding algorithm and the minimum sum decoding algorithm.Simulation results show that, compared with the classical algorithm,the bit error rate(BER) performance of the dynamic weighted decoding algorithm has improved significantly,and the decoding complexity has also been reduced,both in the sum product algorithm and the minimum sum algorithm.
关 键 词:LDPC码 译码算法 动态加权 和积算法 最小和算法
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.23.61.205