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 Code和Turbo解码算法最近引起了21世纪可靠的通信和积累技术的重要技术的广泛关注。众所周知，包括涡轮解码算法在内的迭代解码算法可以被视为信仰传播算法的应用，这是在知识信息处理的研究领域中提出的，作为不确定的推理算法。可以解释的是，涡轮解码算法可以有效地计算后验概率的近似值。它可以获得扩展的连接图（EJG）和平行的迭代算法计算后验概率，用于计算后验概率，这些算法是基于“基于迭代算法的分析和设计”在“ iS iS in-Decdodific in-Prace of depoed”中所取得的结果，该算法的结果是在“算法”中实现的。 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具有反馈通道（例如ARQ方案）并分析性能的通道模型的算法。（3）此外，我们将算法应用于流密封器的解密并分析了性能。

项目成果

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

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

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

Fast Correlation Attackの改良法に関する一考察

改进快速相关攻击的研究

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

Word-valued sourceから出現する系列の単語分割について

关于从词值源出现的序列的分词

• 发表时间: 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

Bayes Universal Coding Algorithm for Side Information Context Tree

辅助信息上下文树的贝叶斯通用编码算法

• 发表时间: 2005
• 期刊: Proceedings of IEEE International Symposium of Information Theory
• 作者: Toshiyasu Matsushima;Shigeichi Hirasawa
• 通讯作者: Shigeichi Hirasawa