基于LDPC码和hmm的改进迭代源信道联合译码算法

Rongke Liu, Jie Ying Gao, Xiaolin Zhang
{"title":"基于LDPC码和hmm的改进迭代源信道联合译码算法","authors":"Rongke Liu, Jie Ying Gao, Xiaolin Zhang","doi":"10.1109/ITW2.2006.323823","DOIUrl":null,"url":null,"abstract":"A modified joint source-channel decoding (JSCD) algorithm based on low-density parity-check (LDPC) codes and hidden Markov estimation has been presented and extended to applying over Rayleigh fading channels. The proposed algorithm utilizes the source residual redundancy lack of any priori information of the source parameters, and the modifications employ the self-checking and convergence mechanisms of LDPC codes in adjusting the error probability of the hidden Markov model (HMM). To show the validation of the proposed JSCD methods, we also give a framework for the density evolution analysis for JSCD. Simulation results show that the joint decoding scheme on Rayleigh fading channels greatly reduces the number of iterations and improves the system performance more than 0.7 dB. Moreover, the modified JSCD algorithm leads to the joint decoder to converge at least 10% faster than the unmodified method without any degradation in the decoding performance","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Modified Iterative Joint Source-Channel Decoding Algorithm Based on LDPC Codes and HMMs\",\"authors\":\"Rongke Liu, Jie Ying Gao, Xiaolin Zhang\",\"doi\":\"10.1109/ITW2.2006.323823\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A modified joint source-channel decoding (JSCD) algorithm based on low-density parity-check (LDPC) codes and hidden Markov estimation has been presented and extended to applying over Rayleigh fading channels. The proposed algorithm utilizes the source residual redundancy lack of any priori information of the source parameters, and the modifications employ the self-checking and convergence mechanisms of LDPC codes in adjusting the error probability of the hidden Markov model (HMM). To show the validation of the proposed JSCD methods, we also give a framework for the density evolution analysis for JSCD. Simulation results show that the joint decoding scheme on Rayleigh fading channels greatly reduces the number of iterations and improves the system performance more than 0.7 dB. Moreover, the modified JSCD algorithm leads to the joint decoder to converge at least 10% faster than the unmodified method without any degradation in the decoding performance\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323823\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于低密度奇偶校验码和隐马尔可夫估计的改进源信道联合译码算法,并将其推广到瑞利衰落信道。该算法利用源残馀冗余不含源参数的先验信息,利用LDPC码的自检和收敛机制调整隐马尔可夫模型(HMM)的误差概率。为了证明所提出的JSCD方法的有效性,我们还给出了JSCD密度演化分析的框架。仿真结果表明,该联合解码方案在瑞利衰落信道上大大减少了迭代次数,提高了0.7 dB以上的系统性能。此外,改进的JSCD算法使联合解码器的收敛速度比未修改的方法至少快10%,而解码性能没有任何下降
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Modified Iterative Joint Source-Channel Decoding Algorithm Based on LDPC Codes and HMMs
A modified joint source-channel decoding (JSCD) algorithm based on low-density parity-check (LDPC) codes and hidden Markov estimation has been presented and extended to applying over Rayleigh fading channels. The proposed algorithm utilizes the source residual redundancy lack of any priori information of the source parameters, and the modifications employ the self-checking and convergence mechanisms of LDPC codes in adjusting the error probability of the hidden Markov model (HMM). To show the validation of the proposed JSCD methods, we also give a framework for the density evolution analysis for JSCD. Simulation results show that the joint decoding scheme on Rayleigh fading channels greatly reduces the number of iterations and improves the system performance more than 0.7 dB. Moreover, the modified JSCD algorithm leads to the joint decoder to converge at least 10% faster than the unmodified method without any degradation in the decoding performance
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信