检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张瑜 吴虹[1] 慈骋 张钰婷[1] Zhang Yu;Wu Hong;Ci Cheng;Zhang Yuting(Tianjin Key Laboratory of Optoelectronic Sensor and Sensing Network Technology,College of Electronic Information and Optical Engineering.Natikai University,Tianjin 300350,China)
机构地区:[1]南开大学电子信息与光学工程学院,天津市光电传感器与传感网络技术重点实验室,天津300350
出 处:《南开大学学报(自然科学版)》2021年第4期68-71,共4页Acta Scientiarum Naturalium Universitatis Nankaiensis
基 金:国家自然科学基金(61571244);天津市科技支撑项目(16YFZCSF00540)。
摘 要:针对有限长极化码由于信道极化不完全,使得部分信息比特未能在无噪信道上传输,导致无法获得理想译码性能的问题,通过对无噪的极化子信道数目与待传信息比特数目的计算和对比.提出一种极化码子序列编译码算法.将信息比特序列按照无噪信道数目大小分为数个子序列分别送入信道,确保每一个子序列都在无噪信道上传输.仿真结果表明,极化码子序列编译码算法可以获得理想的误码性能;同时在牺牲较小的传输速率的情况下,极化码子序列编译码算法的误码性能优于传统编译码算法;且对极化码短码的误码性能的改善更加显著.Due to the limited length of polar code,the channel polarization will be incomplete.Partial information bits cannot be transmitted on the noiseless channel,which will greatly degrade decoding performance.A coding and decoding algorithm of polar code subsequence has been proposed through calculating and comparing the number of the noiseless polar subchannels and the information bits.The information bits will be divided into several subsequences according to the number of the noiseless channels in this algorithm,which ensures each subsequence is transmitted in noiseless channels.Finally,the simulation results show that coding and decoding algorithm of polar code subsequence can reach the ideal BER performance.What's more,the BER performance of the proposed algorithm is also better than the traditional coding and decoding algorithm at the expense of slight transmission speed,especially for the short code.
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.68