基于校正子的 BCH(15,11)码最优软判决译码.

Gespeichert in:
Bibliographische Detailangaben
Titel: 基于校正子的 BCH(15,11)码最优软判决译码. (Chinese)
Alternate Title: Syndrome-based Optimal Soft-decision Decoding Algorithm for the BCH 15 11 Code. (English)
Autoren: 龚汉东, 管明祥
Quelle: Radio Communications Technology; 2025, Vol. 51 Issue 2, p340-345, 6p
Abstract (English): The BCH(15, 11) code is a cyclic code, which is widely used in digital communication and storage systems. An optimal syndromebased softdecision algorithm is designed for decoding the BCH code in this paper. The algorithm generates at most 16 error pattern vectors according to the syndrome of the hard-decision vector and the soft-decision vector if the error in the hard-decision vector is detected. The sum of each error pattern vector and the hard-decision vector is a code word of the BCH code. For the given soft-decision vector, the error pattern vector corresponding to the optimal soft-decision decoding result is one of the above-mentioned error pattern vectors that has the optimal correlation value with the soft-decision vector. At the bit error of 10-3, the algorithm in this paper achieves about 1.2 dB and 0.1 dB gain compared with the hard-decision decoding and the sub-optimal decoding, respectively. Compared with the known optimal decoding algorithms for the code, the algorithm in this paper has lower complexity. Compared with the known suboptimal decoding algorithms for the code, the algorithm in this paper has better performance at the expense of little increase in decoding complexity. The algorithm in this paper has theoretical grantee in decoding optimality and is easy to implement, which indicates that the algorithm is suitable for practical decoding process. [ABSTRACT FROM AUTHOR]
Abstract (Chinese): BCH (15, 11) 码是一种循环码, 广泛应用于数字通信和存储系统中。针对该 BCH 码, 设计了一种基于校正 子的最优软判决译码算法。该算法在检测到硬判决向量中包含错误时, 根据软判决向量和硬判决向量的校正子产生 至多 16 个错误模式向量, 每个错误模式向量与硬判决结果之和均为该 BCH 码的一个码字。对于给定的软判决向量, 最优软判决译码结果对应的错误模式向量包含在上述错误模式向量中, 并且与软判决向量具有最小相关值。在误比 特率为 10 -3 时, 所提算法相对于硬判决译码算法和次优软判决译码算法, 分别获得了约 1. 2 dB 和 0. 1 dB 的增益。与 该码已有的最优软判决译码算法相比, 复杂度更低;与该码已有的次优软判决译码算法相比, 在增加很少复杂度的条 件下获得了性能提升。所提算法译码性能具有理论上的最优保证且易于实现, 适合用于实际译码过程。 [ABSTRACT FROM AUTHOR]
Copyright of Radio Communications Technology is the property of 54th Research Institute of CETC and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:The BCH(15, 11) code is a cyclic code, which is widely used in digital communication and storage systems. An optimal syndromebased softdecision algorithm is designed for decoding the BCH code in this paper. The algorithm generates at most 16 error pattern vectors according to the syndrome of the hard-decision vector and the soft-decision vector if the error in the hard-decision vector is detected. The sum of each error pattern vector and the hard-decision vector is a code word of the BCH code. For the given soft-decision vector, the error pattern vector corresponding to the optimal soft-decision decoding result is one of the above-mentioned error pattern vectors that has the optimal correlation value with the soft-decision vector. At the bit error of 1<sup>0-3</sup>, the algorithm in this paper achieves about 1.2 dB and 0.1 dB gain compared with the hard-decision decoding and the sub-optimal decoding, respectively. Compared with the known optimal decoding algorithms for the code, the algorithm in this paper has lower complexity. Compared with the known suboptimal decoding algorithms for the code, the algorithm in this paper has better performance at the expense of little increase in decoding complexity. The algorithm in this paper has theoretical grantee in decoding optimality and is easy to implement, which indicates that the algorithm is suitable for practical decoding process. [ABSTRACT FROM AUTHOR]
ISSN:10033114
DOI:10.3969/j.issn.1003-3114.2025.02.015