检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李卓伦 韩卓茜 LI Zhuo-lun;HAN Zhuo-xi(PLA Strategic Support Force Information Engineering University,Zhengzhou,Henan 450001,China)
机构地区:[1]解放军战略支援部队信息工程大学,河南郑州450001
出 处:《电子学报》2021年第2期239-247,共9页Acta Electronica Sinica
摘 要:针对现有基于校验关系的Turbo码交织器识别算法在低信噪比(Signal-to-Noise Ratio,SNR)时适应性较弱以及识别过程中容易出现差错传播的问题,为了进一步提升交织识别的容错性与实时性,在基于最大序列相关识别算法的基础上加入迭代译码和小范围遍历两种纠错算法,更加充分的利用了接收数据的同时增强了抗误码能力.仿真结果表明,加入纠错算法使得原有算法的交织识别性能明显改善,相同条件下完成全部交织参数识别所需数据量仅需原有的1/3;在相同数据量的条件下实现全部交织参数识别时的SNR增益大于2dB.此外,基于译码纠错的方法具有通用性,同样适用于其他基于校验关系的识别算法.The existing algorithms based on parity-check relationship in the recognition of interleaver for Turbo codes have weak adaptability at low signal-to-noise ratio(SNR)and are prone to"error propagation"in the recognition process,In order to further improve the fault tolerance and real time of interleaving recognition,we propose two error correction algorithms based on the maximum sequence correlation recognition algorithm,including iterative decoding and small traversal,which make full use of the received data and enhance the error resilience.Simulation results show that the performance of the improved algorithm is obviously better than the original algorithm by adding error correction algorithm,and it only needs 1/3 of the data to complete the identification of all the interleaved parameters under the same conditions and has more than 2dB gain to achieve the identification of all the interleaved parameters under the condition of the same amount of data.In addition,the method based on decoding error correction is universal,which is also applied to other recognition algorithms of parity-check relationship.
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.128.226.211