Journal of Computer Applications ›› 2023, Vol. 43 ›› Issue (2): 630-635.DOI: 10.11772/j.issn.1001-9081.2021122065

• Frontier and comprehensive applications • Previous Articles    

Design of very short antipollution error correcting code based on global distance optimization

Jianqiang LIU(), Yepin QU, Yuhai LYU   

  1. Naval Research Academy of PLA,Shanghai 200436,China
  • Received:2021-12-08 Revised:2022-01-17 Accepted:2022-02-23 Online:2022-03-02 Published:2023-02-10
  • Contact: Jianqiang LIU
  • About author:LIU Jianqiang, born in 1973, M. S., senior engineer. His research interests include electronic information system, avionics, information system standardization.
    QU Yepin, born in 1962, P.D., research fellow. His research interests include aircraft overall design, avionics system, inertial technology.
    LYU Yuhai, born in 1977, M. S., senior engineer. His research interests include airborne mission system, aviation standardization.
  • Supported by:
    Equipment Pre-research Project of “the 13th Five-Year Plan”(3020901020101)

基于全局距离最优的抗污染极短纠错码设计

刘坚强(), 屈也频, 吕余海   

  1. 中国人民解放军海军研究院,上海 200436
  • 通讯作者: 刘坚强
  • 作者简介:刘坚强(1973—),男,江苏丹阳人,高级工程师,硕士,主要研究方向:电子信息系统、航空电子、信息系统标准化
    屈也频(1962—),男,湖南岳阳人,研究员,博士生导师,博士,主要研究方向:飞机总体设计、航空电子系统、惯性技术
    吕余海(1977—),男,浙江建德人,高级工程师,硕士,主要研究方向:机载任务系统、航空标准化。
  • 基金资助:
    “十三五”装备预先研究项目(3020901020101)

Abstract:

The existing two-dimensional codes have the problems of weak antipollution ability and slow decoding speed in complex environment. To solve these problems, a very short antipollution error correcting code based on global distance optimization was proposed. Firstly, a concave-convex polygon mathematical model was constructed to characterize the polluted environment. Then, a very short error correcting code was designed, which uses three coding points to represent one target data bit. Finally, a coding point arrangement method was designed, which optimizes the global distance within a limited constrained domain. The corresponding decoding algorithm was also given. The antipollution ability and recognition speed of very short error correcting code were simulated and analyzed, and the proposed code was compared with the classical Bose-Chaudhuri-Hocquenghem (BCH) codes. The results show that when the target data length is 18 and the number of coding points is 63, the recognition accuracy of very short error correcting code is close to that of BCH codes in the same polluted environment with the decoding speed of 130 times of that of BCH codes. The proposed code also has the obvious advantages of simple and clear structure, strong adaptability of coding points, and being easy to be standardized and popularized.

Key words: error correcting code, antipollution, pollution model, optimal distance, Bose-Chaudhuri-Hocquenghem (BCH) codes, two-dimensional code

摘要:

针对现有二维码在复杂环境中抗污染能力弱、解码速度慢的问题,提出了一种基于全局距离最优的抗污染极短纠错码。首先,构建了表征污染环境的凹凸多边形数学模型;然后,设计了采用3个编码点表示一个目标数据位的极短纠错码;最后,设计了在有限约束域内全局距离最优的编码点的编排方法,并给出了对应的解码算法。对极短纠错码的抗污染能力和识别速度进行了仿真评估,并与经典的BCH码进行了对比。结果表明,当目标数据长度为18、编码点数为63时,极短纠错码在同等污染环境中识别准确率接近BCH码,而解码速度是BCH码的130倍。所提编码还具有结构简洁明确、编码点数适应能力强、易于标准化推广应用等显著优点。

关键词: 纠错码, 抗污染, 污染模型, 最优距离, BCH码, 二维码

CLC Number: