一种基于子集约束的协议首部纠错算法  

Header Recovery Algorithm Based on Subset Constraint

作　　者：王晓梅[1] 范亮[1] 陈彦[1] 洪先强 

机构地区：[1]解放军信息工程大学信息系统工程学院,郑州450002

出　　处：《电子与信息学报》2015年第8期2014-2020,共7页Journal of Electronics & Information Technology

基　　金：国家安全重大基础研究(6131482013)资助课题

摘　　要：针对无线网络数据的协议首部容易出错问题,该文在研究基于循环冗余校验的协议首部纠错算法的基础上,提出一种基于子集约束的纠错算法。该算法利用接收比特的置信度信息以接收向量为中心构建约束子集,从而缩小运算搜索范围,克服此前算法运算复杂度高的缺陷。随后,结合无线信号类型与信道模型,对算法的测试长度参数的取值范围进行了理论分析和实验验证。仿真结果表明,对于不同信噪比的无线信号,该算法可通过改变测试长度来调节约束子集大小,实现在保证较好性能条件下有效地降低运算开销,具有较强的实际应用价值。For the protocol headers of wireless network data prone to errors, this paper puts forward with a bit-flip subset restriction header recovery algorithm after studying the one based on Cyclic Redundancy Check （CRC）. A constraint subset of the received vector centric is set up to narrow the search space by exploiting the confidence information of each bit, overcoming the defect of high complexity of the former header recovery algorithm. Then, the theatrical analysis and experimental verification about the value range of the test vector＇s length are done combining the models of wireless signal and wireless channel. The simulation results show that this method can maintain the well performance with a low computing cost, adjusting the test vector＇s length towards wireless signals with different Signal to Noise Ratio （SNR）.

关 键 词：无线通信 无线多媒体 协议首部纠错 校验字段 

分 类 号：TP393.0[自动化与计算机技术—计算机应用技术]