Decoding of convolutional codes by Viterbi blind algorithm

Yunxin Li, B. Vucetic, Y. Sato
{"title":"Decoding of convolutional codes by Viterbi blind algorithm","authors":"Yunxin Li, B. Vucetic, Y. Sato","doi":"10.1109/ICCS.1992.255137","DOIUrl":null,"url":null,"abstract":"For decoding of convolutional codes by the Viterbi algorithm, the knowledge of channel parameters on non-Gaussian channels is either essential or preferable. When the considered channel is fast time-varying, reliable and robust estimation of the channel parameters by the conventional decision-directed adaptive algorithms is hardly possible. In the present paper, the Viterbi algorithm is applied in a modified way. Firstly a new trellis diagram is constructed at the receiver side according to modified definitions of trellis state and branch. Secondly a new branch metric is defined so that its expression does not explicitly depend on the channel parameters. With these modifications, decoding can be achieved without the knowledge of channel parameters. This method provides a robust alternative for decoding of convolutional codes on fast fading (especially frequency-selective) channels where the estimation of channel parameters becomes more and more difficult.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Singapore ICCS/ISITA `92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1992.255137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

For decoding of convolutional codes by the Viterbi algorithm, the knowledge of channel parameters on non-Gaussian channels is either essential or preferable. When the considered channel is fast time-varying, reliable and robust estimation of the channel parameters by the conventional decision-directed adaptive algorithms is hardly possible. In the present paper, the Viterbi algorithm is applied in a modified way. Firstly a new trellis diagram is constructed at the receiver side according to modified definitions of trellis state and branch. Secondly a new branch metric is defined so that its expression does not explicitly depend on the channel parameters. With these modifications, decoding can be achieved without the knowledge of channel parameters. This method provides a robust alternative for decoding of convolutional codes on fast fading (especially frequency-selective) channels where the estimation of channel parameters becomes more and more difficult.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于Viterbi盲算法的卷积码解码
对于使用Viterbi算法解码卷积码,了解非高斯信道上的信道参数是必要的或更好的。当考虑的信道是快速时变信道时,传统的决策导向自适应算法很难可靠、鲁棒地估计信道参数。本文对Viterbi算法进行了改进。首先,根据改进的网格状态和分支定义,在接收端构造新的网格图;其次,定义了一个新的分支度量,使其表达式不显式依赖于通道参数。通过这些修改,可以在不知道信道参数的情况下实现解码。该方法为快速衰落(特别是频率选择)信道下卷积码的译码提供了一种鲁棒的替代方法,在这种情况下信道参数的估计变得越来越困难。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance analysis of interconnected LANS with server/client configuration An enhanced approach to character recognition by Fourier descriptor A new error control techinque for the parallel combinatory spread spectrum communication system Pattern recognition using optical binary perceptron Fast VQ algorithm using scalar prequantization
×
引用
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