Application and Analysis of Parallel Iterative Algorithms for Calculating Posterior Probability to Practical Codes and Channels

计算后验概率的并行迭代算法在实际代码和信道中的应用与分析

• 批准号: 15560338
• 负责人: MATSUSHIMA Toshiyasu
• 金额: $ 2.37万
• 依托单位: Waseda University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2003
• 资助国家: 日本
• 起止时间: 2003 至 2005
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-15560338/
• 关键词: Information Theory; Error Correcting Code; Decoding Algorithms; Calculation of Posterior Probability; Graphical Model; Knowledge Information Processing; Uncertain Reasoning; 復号アルゴリズム

For its good error correcting ability, Turbo code and Turbo decoding algorithm, which was proposed in the research area of the error correcting codes, have gotten a lot of attention recently as important technology of 21st century's reliable communication and accumulation technique. It have been known that the iterative decoding algorithms which includes Turbo decoding algorithm can be regarded as applications of Belief Propagation algorithm, which was proposed in the research area of the knowledge information processing as uncertain reasoning algorithm. It can be interpreted that the turbo decoding algorithm calculates the approximation of posterior probability effectively.It was obtained that the Extended Junction Graph (EJG) and the parallel iterative algorithm for calculating posterior probability, which are results achieved in "The Analysis and Design of the Reliable Iterative Decoding Algorithm based on Uncertain Reasoning" which is supported by Grant-in-Aid for Scientific Research in 2000-2002, can deal with general probabilistic models compared to existing belief propagation algorithm and retain the higher performance even when the graph has loops (almost of the practical codes have loops).In this research, we have done following,(1)We applied the EJG and the parallel iterative algorithm to the LDPC codes which have some small loops, we sought further efficiency and analyzed the performance.(2)We applied the algorithm to the channel models which have feedback channel such as ARQ Scheme and analyzed the performance.(3)Moreover, we applied the algorithm to the decryption of stream cipher and analyzed the performance.

在纠错码研究领域中提出的Turbo码及其译码算法，由于其良好的纠错能力，作为21世纪世纪可靠通信和积累技术的重要技术，近年来受到了广泛的关注。已知包括Turbo译码算法在内的迭代译码算法可以看作是置信传播算法的应用，置信传播算法是在知识信息处理领域作为不确定性推理算法提出的。由此可以看出，Turbo码译码算法有效地计算了后验概率的近似值，得到了计算后验概率的扩展连接图（EJG）和并行迭代算法，是2000年科研资助项目“基于不确定性推理的可靠迭代译码算法的分析与设计”的成果-2002年提出的EJG算法，与现有的置信传播算法相比，可以处理一般的概率模型，并且在图中存在环（几乎所有的实际码都存在环）的情况下仍保持较高的性能。(2)We将该算法应用于ARQ等有反馈信道的信道模型中，并分析了其性能。（3）将该算法应用于流密码的解密，并分析了其性能。

项目成果

誤り訂正符号を利用した直交計画の構成法に関する-考察〜逐次実験に適した直交計画について〜

使用纠错码构建正交设计方法的思考 ~ 关于适合顺序实验的正交设计 ~

• 发表时间: 2004
• 期刊: 第27回情報理論とその応用シンポジウム予稿集
• 作者: 斉藤友彦;松嶋敏泰;平澤茂一
• 通讯作者: 平澤茂一

浮田善文, 松嶋敏泰, 平澤茂一: "質問学習と逐次実験計圃の関係に関する一考察"電子情報通信学会技術報告. Al2003-63. 1-6 (2004)

Yoshifumi Ukita、Toshiyasu Matsushima、Shigekazu Hirasawa：“问题学习与顺序实验图之间关系的研究”IEICE 技术报告，Al2003-63（2004）。

A Note on the Improvement of a Fast Correlation Attack on Stream Ciphers

流密码快速相关攻击的改进

• 发表时间: 2006
• 期刊: IEICE Trans on Fundamentals(A) Vol.E89-A, No.2
• 作者: Satoshi Hosobuchi;Tomohiko Saito;Toshiyasu Matsushima
• 通讯作者: Toshiyasu Matsushima

区間で一定なパラメータを持っ非定常情報源におけるベイズ符号の元長度について

关于区间参数恒定的非平稳信息源贝叶斯码的元素长度

• 发表时间: 2004
• 期刊: 第27回情報理論とその応用シンポジウム予稿集
• 作者: 須子統太;松嶋敏泰;平澤茂一
• 通讯作者: 平澤茂一

Proceedings of the Internatinal symposium on Information Theory and Its Applications

国际信息论及其应用研讨会论文集

• 发表时间: 2004
• 期刊: Efficient reliability-based soft decision decoding algorithm over Markov modulated channel
• 作者: Hideki Yagi;Toshiyasu Matsushima;Shigeichi Hirasawa
• 通讯作者: Shigeichi Hirasawa