检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄胜 郑秀凤 曹志雄 HUANG Sheng;ZHENG Xiufeng;CAO Zhixiong(Key Laboratory of Optical Communication and Network,School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
机构地区:[1]重庆邮电大学通信与信息工程学院光通信与网络重点实验室,重庆400065
出 处:《计算机工程》2022年第1期170-174,181,共6页Computer Engineering
基 金:国家自然科学基金(61571072)。
摘 要:传统的串行抵消比特翻转(SCF)译码算法仅用对数似然比(LLR)的绝对值去衡量信息比特译码结果的可靠情况,导致误块率(BLER)过高和翻转的尝试次数较多。提出一种串行抵消比特翻转译码算法PLR-SCF,分析SC译码算法发生错误译码的原因,通过仿真观察LLR、极化信道可靠度和信息位所在的位置与SC译码算法发生首个判决错误之间的关系,并利用上述因素设计一个能准确衡量信息位发生译码错误程度的度量公式。仿真结果表明,相对于传统的SCF译码算法,该算法能够有效降低BLER,特别是在高信噪比下获得的最大信噪比增益约为0.12 dB,翻转尝试次数与SCF减少13.6%。The traditional Successive Cancellation bit-Flipping(SCF)decoding algorithm only uses the absolute value of Log Like Ratio(LLR)to measure the reliability of information bit decoding results,which leads to a high Block Error Rate(BLER)and more attempts to flip.This paper proposes a SCF decoding algorithm named PLR-SCF.The causes of decoding errors in the SC decoding algorithm are analyzed,and simulation experiments are carried out to analyze the factors that lead to The First Decision Error(TFDE)of the SC decoding algorithm,including LLR,channel polarization reliability and the location of information bits.Based on these factors,a formula is designed to measure the decoding error of information bits.Simulation results show that compared with the traditional SCF decoding algorithm,the proposed decoding algorithm can reduce the BLER significantly.In the case of high Signal-to-Noise Ratio(SNR),the proposed algorithm displays a maximum SNR gain of 0.12 dB,and reduces the number of flip attempts and SCF by 13.6%.
关 键 词:极化码 串行抵消比特翻转译码 对数似然比 首个判决错误 误块率
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7