检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]海军航空大学电子信息工程系,山东烟台264001 [2]海军航空大学信息融合技术研究所,山东烟台264001
出 处:《电讯技术》2018年第1期52-58,共7页Telecommunication Engineering
基 金:国家自然科学基金资助项目(91538201);山东省"泰山学者"建设工程项目(ts201511020)
摘 要:针对Turbo码随机交织器参数识别问题,充分利用信道截获数据的软判决信息,提出了一种基于对数符合度的交织映射关系识别算法。该算法从计算总的编码方程成立概率出发,定义了能很好衡量概率大小的对数符合度概念,极大地简化了计算复杂度,使得计算量仅与截获码块数目和交织长度的平方有关,计算方式仅为大小比较与符号提取;再利用正确交织位置能够使总的编码方程成立的概率达到最大这一特性,依次实现各个位置的交织关系的识别。与现有算法相比,所提算法识别性能稍差,但计算复杂度更低。仿真结果表明,在信噪比为0 dB、交织长度为200时,仅需要截获码块数目为500,其正确识别率就能达到100%。To recognize the Turbo code interleaver, a new algorithm based on logarithmic conformity is pro-posed ,which can make full use of the soft decision information to identify the pseudo-random interleaver of the Turbo code. Firstly,logarithmic conformity is defined to measure the possibility of coding equations. As the result,the calculation complexity which is only related to the number of the code blocks and length of interleaver is simplified greatly and the methods of calculation are just the comparison and symbol extrac-tion. Then,according to the fact that the correct position can make the possibility of overall coding equa-tions maximum,the interleaver position can be recognized one by one. Compared with existed algorithms, the recognition of new algorithm is slightly worse,but its computational complexity is lower. The simulation results show that the correct ratio of recognition can reach 100% at 0 dB by the 500 code blocks,when the length of interleaver is 200.
关 键 词:TURBO码 随机交织器 参数识别 对数符合度 软判决信息
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117