Iterative Soft-Decision Decoding of Hermitian Codes
Iterative Soft-Decision Decoding of Hermitian Codes
复制标题
Hermitian 码的迭代软决策解码
DOI：
10.1109/tcomm.2012.100512.110871
复制
发表时间：
2012
影响因子：
8.3
通讯作者：
Li Chen
中科院分区：
文献类型：
--
作者：
Li Chen
本文提出了一种最流行的代数几何（AG）码-厄米特码的迭代软判决译码算法。该算法综合了自适应置信传播（ABP）算法和Koetter-Vardy（KV）链表译码算法这两种最强大的软判决译码算法。ABP算法基于厄米特码的自适应奇偶校验矩阵执行迭代解码，以增强软接收信息的可靠性。KV算法在增强可靠性的基础上，通过软判决列表译码获得原始消息。由于矩阵自适应依赖于比特的可靠性，不可靠的比特的重组被引入，以协助ABP解码。基于评估由ABP算法提供的软信息并确定是否应当执行以下KV解码步骤，提出了一种降低复杂度的ABP-KV解码方法。ABP算法的几何解释，证明了执行矩阵自适应的必要性。我们的性能分析表明，所提出的迭代译码算法优于现有的埃尔米特码的译码方法和RS码的ABP-KV译码。
This paper proposes an iterative soft-decision decoding algorithm for one of the most popular algebraic-geometric (AG) codes - Hermitian codes. The algorithm is designed by integrating the two most powerful soft-decision decoding algorithms, the adaptive belief propagation (ABP) algorithm and the Koetter-Vardy (KV) list decoding algorithm. The ABP algorithm performs iterative decoding based on an adapted parity-check matrix of a Hermitian code to enhance the reliability of the soft received information. With the enhanced reliability, the KV algorithm performs soft-decision list decoding to obtain the original message. Since the matrix adaptation relies on bit reliabilities, regrouping of the unreliable bits is introduced to assist the ABP decoding. A complexity reducing ABP-KV decoding approach is proposed based on assessing the soft information provided by the ABP algorithm and determining whether the following KV decoding steps should be carried out. Geometric interpretation of the ABP algorithm is presented, demonstrating the necessity of performing matrix adaptation. Our performance analysis shows the proposed iterative decoding algorithm outperforms both the existing decoding approaches for Hermitian codes and the ABP-KV decoding of Reed-Solomon (RS) codes.
影响因子：
8.3
作者：
Li Chen;R. Carrasco;M. Johnston
通讯作者：
Li Chen;R. Carrasco;M. Johnston
影响因子：
10.4
作者：
Li Chen;R. Carrasco;M. Johnston
通讯作者：
Li Chen;R. Carrasco;M. Johnston