An improvement to soft-decision iterative decoding algorithms for linear block codes

线性分组码软判决迭代译码算法的改进

• 批准号: 12650391
• 负责人: KASAMI Tadao
• 金额: $ 1.66万
• 依托单位: Hiroshima City University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2000
• 资助国家: 日本
• 起止时间: 2000 至 2001
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-12650391/
• 关键词: linear block code; soft-decision decoding; ML decoding; Recursive ML decoding; iterative decoding; algebraic decoding

1. We introduced "adaptive maximum likelihood decoding" (abbreviated as AMLD). In AMLD, the most likely local (MLL) sub-codeword in a section is constructed by concatenating the MLL sub-codewords in its subsection which are found adaptively. We implemented a prototype program for AMLD, and evaluated decoding complexity of AMLD for several RM codes and BCH codes. The average complexity is considerably smaller than those of conventional maximum likelihood decoding algorithms. It turns out that for codes with relatively large parameter, there exist singular received sequences which occur at extremely rare intervals, however, winch require very long steps to guaarantee the optimality. To reduce the complexity furthermore, we have devised an effective method which makes good use of adjacency relation between the MLL sub-codewords in adjacent subsections [1, 3, 5]. In addition, we have studied early termination conditions with no or almost no loss of error performance.2. We have devised an e … More ffective method of selecting successive search centers around which bounded distance decoding is carried out in a soft-decision iterative decoding algorithm. In conventional soft-decision iterative decoding algorithms by using bounded distance decoding, such as Chase II decoding algorithm, the duplication of search region and the decoding failure of bounded distance decoding degrade the error performance. For several BCH codes of lengths 128 and 256, simulation results [2, 4] show that this new selection method improves the error performance considerably by reducing the above negative effect.3. For concatenated coding scheme whose outer code is an interleaved (225, 223) RS code a good choice of its inner code is proposed. The low weight structures of the binary images of shortened (8, 5) RS codes over GF(28) are analyzed extensively. Consequently, we have found several more promising shortened RS codes as the inner code than the conventional codes [6].* [x] refers to the x-th paper in the references. Less

1.我们引入了“自适应最大似然解码”（简称AMLD）。在 AMLD 中，部分中最可能的局部 (MLL) 子码字是通过连接自适应找到的子部分中的 MLL 子码字来构造的。我们实现了 AMLD 的原型程序，并评估了几种 RM 代码和 BCH 代码的 AMLD 解码复杂性。平均复杂度比传统的最大似然解码算法小得多。事实证明，对于参数相对较大的代码，存在以极其罕见的间隔出现的奇异接收序列，然而，winch需要很长的步长来保证最优性。为了进一步降低复杂性，我们设计了一种有效的方法，充分利用相邻小节中 MLL 子码字之间的邻接关系[1,3,5]。此外，我们还研究了没有或几乎没有错误性能损失的提前终止条件。2．我们设计了一种选择连续搜索中心的有效方法，在软决策迭代解码算法中围绕该搜索中心进行有界距离解码。在传统的使用有界距离解码的软判决迭代解码算法中，例如Chase II解码算法，搜索区域的重复和有界距离解码的解码失败降低了错误性能。对于长度为128和256的几种BCH码，仿真结果[2, 4]表明，这种新的选择方法通过减少上述负面影响，显着提高了误码性能。 3．对于外码是交织(225, 223) RS码的级联编码方案，提出了其内码的良好选择。广泛分析了 GF(28) 上缩短的 (8, 5) RS 代码的二进制图像的低权重结构。因此，我们发现了几个比传统代码更有前途的缩短RS代码作为内部代码[6]。* [x]指的是参考文献中的第x篇论文。较少的

项目成果

Y. Kaji, H. Tokushige and T. Kasami: "An Improved Search Algorithm for the Adaptive and Recursive MLD Algorithm"Proceedings of the 2001 IEEE International Symposium on Information Theory, Washington D.C., USA. 334

Y. Kaji、H. Tokushige 和 T. Kasami：“自适应和递归 MLD 算法的改进搜索算法”2001 年 IEEE 国际信息论研讨会论文集，美国华盛顿特区。

H. Tokushige, K. Nakamaye, T. Koumoto, Y. Tang and T. Kasami: "Selection of Search Centers in Iterative Soft-decision Decoding Algorithms,"IEICE Trans, Fundamentals,. Vol.E8-A, No. 10. 2397-2403 (2001)

H. Tokushige、K. Nakamaye、T. Koumoto、Y. Tang 和 T. Kasami：“迭代软决策解码算法中搜索中心的选择”，IEICE Trans，基础知识。

H. Tokushige, T. Tanoue and T. Kasami,: "On the Binary Images of (8, 5) Shortened Cyclic Codes over GF(2^8),"Proceeding of GOLOBECOM '01 IEEE Global Telecommunications Conference}, San Antonio, Texas,.

H. Tokushige、T. Tanoue 和 T. Kasami，：“关于 GF(2^8) 上的 (8, 5) 缩短循环码的二进制图像”，GOLOBECOM 01 IEEE 全球电信会议论文集}，圣安东尼奥，

Tadao Kasami,Hitoshi Tokushige and Yuichi Kaji: "Search Procedures in Top-Down Recursive Maximum Likelihood Decoding Algorithm"第23回情報理論とその応用シンポジウム. 535-538 (2000)

Tadao Kasami、Hitoshi Tokushige 和 Yuichi Kaji：“自上而下递归最大似然解码算法中的搜索过程”第 23 届信息论及其应用研讨会（2000 年）。

斉宮誠,石田敏行,揖勇一,嵩忠雄: "適応型RMLD法における探索戦略について"第23回情報理論とその応用シンポジウム. 539-542 (2000)

Makoto Saimiya、Toshiyuki Ishida、Yuichi I、Tadao Take：“自适应 RMLD 方法中的搜索策略”第 23 届信息论及其应用研讨会 539-542（2000 年）。