Blind and nonblind nonnegative impulse response ISI channel demodulation using the Richardson-Lucy algorithm

Zhijun Zhao, R. Blahut
{"title":"Blind and nonblind nonnegative impulse response ISI channel demodulation using the Richardson-Lucy algorithm","authors":"Zhijun Zhao, R. Blahut","doi":"10.1109/ISSPIT.2005.1577138","DOIUrl":null,"url":null,"abstract":"Both blind and nonblind demodulation algorithms based on the Richardson-Lucy algorithm for the one-dimensional intersymbol interference channel with nonnegative impulse response function are proposed and compared numerically with the Viterbi demodulation algorithm and the demodulation algorithms based on the Wiener filter. Simulation results show that the demodulation algorithms based on the Richardson-Lucy algorithm have better bit error rate performance than the demodulation algorithms based on the Wiener filter. With the progressive thresholding, the bit error rate curves of both blind and nonblind Richardson-Lucy-based algorithms are within 0.3 dB from that of the Viterbi algorithm throughout the entire simulated signal-to-noise ratio range. While the complexity of the Viterbi algorithm depends critically on the length of the channel impulse response function, the complexity of the demodulation algorithms based on the Richardson-Lucy algorithm only weakly depends on it","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2005.1577138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Both blind and nonblind demodulation algorithms based on the Richardson-Lucy algorithm for the one-dimensional intersymbol interference channel with nonnegative impulse response function are proposed and compared numerically with the Viterbi demodulation algorithm and the demodulation algorithms based on the Wiener filter. Simulation results show that the demodulation algorithms based on the Richardson-Lucy algorithm have better bit error rate performance than the demodulation algorithms based on the Wiener filter. With the progressive thresholding, the bit error rate curves of both blind and nonblind Richardson-Lucy-based algorithms are within 0.3 dB from that of the Viterbi algorithm throughout the entire simulated signal-to-noise ratio range. While the complexity of the Viterbi algorithm depends critically on the length of the channel impulse response function, the complexity of the demodulation algorithms based on the Richardson-Lucy algorithm only weakly depends on it
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用Richardson-Lucy算法的盲和非盲非负脉冲响应ISI信道解调
针对具有非负脉冲响应函数的一维码间干扰信道,提出了基于Richardson-Lucy算法的盲解调算法和非盲解调算法,并与Viterbi解调算法和基于Wiener滤波器的解调算法进行了数值比较。仿真结果表明,基于Richardson-Lucy算法的解调算法比基于维纳滤波器的解调算法具有更好的误码率性能。通过渐进式阈值分割,在整个模拟信噪比范围内,盲算法和非盲算法的误码率曲线与Viterbi算法的误码率曲线的误差在0.3 dB以内。Viterbi算法的复杂度严重依赖于信道脉冲响应函数的长度,而基于Richardson-Lucy算法的解调算法的复杂度仅弱依赖于它
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A butterfly structure for rate k/n convolutional codes Mode decision optimization issues in H.264 video coding Implementation procedure of wireless signal map matching for location-based services Speech synthesis from surface electromyogram signal A text summarizer based on meta-search
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1