检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王琼[1] 罗亚洁 李思舫 WANG Qiong;LUO Yajie;LI Sifang(Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
机构地区:[1]重庆邮电大学通信与信息工程学院
出 处:《电子与信息学报》2019年第7期1572-1578,共7页Journal of Electronics & Information Technology
基 金:国家科技重大专项基金(2018ZX03001026-002)~~
摘 要:针对极化码连续取消列表(SCL)译码算法为获取较好性能而采用较多的保留路径数,导致译码复杂度较高的缺点,自适应SCL译码算法虽然在高信噪比下降低了一定的计算量,却带来了较高的译码延时。根据极化码的顺序译码结构,该文提出了一种分段循环冗余校验(CRC)与自适应选择保留路径数量相结合的SCL译码算法。仿真结果表明,与传统CRC辅助SCL译码算法、自适应SCL译码算法相比,该算法在码率R=0.5时,低信噪比下(-1dB)复杂度降低了约21.6%,在高信噪比下(3dB)复杂度降低了约64%,同时获得较好的译码性能。Considering the problem that using a large number of reserved paths causes higher complexity in order to obtain better performance for polar code Successive Cancellation List (SCL) decoding,the adaptive SCL decoding algorithm at a high Signal to Noise Ratio (SNR) reduces a certain amount of calculations, however,brings a higher decoding delay.According to the order of polar code decoding,an SCL decoding algorithm combining segmentation Cyclic Redundancy Check (CRC) with adaptively selecting the number of reserved paths is proposed.The simulation results show that compared with the traditional CRC-assisted SCL decoding algorithm and adaptive-SCL algorithm,when the code rate is R=0.5,the complexity under low SNR (-1 dB) is reduced by about 21.6%,and the complexity at high SNR (3 dB) is reduced by about 64%,at the same time,better decoding performance is obtained.
关 键 词:极化码 自适应译码 连续取消列表 分段循环冗余校验
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43