块版本Viterbi算法应用新方法的发展

V. Zolotarev, G. Ovechkin
{"title":"块版本Viterbi算法应用新方法的发展","authors":"V. Zolotarev, G. Ovechkin","doi":"10.1109/DSPA51283.2021.9535869","DOIUrl":null,"url":null,"abstract":"The ways to expand the capabilities of new block versions for optimal decoders developed on the basis of Viterbi algorithm when transmitting data over the channels with high noise level are considered. The aim of the work is to analyze the characteristics of new improved optimal decoders of this type which preserve decoding complexity close to the amount of computation in convolutional classical version of this algorithm. The characteristics of a new block decoder both in Gaussian channel and in standard binary symmetric channel are given. The ways of concatenation haven’t been used before are described, the directions for wider research of block Viterbi algorithm and its new implementation versions allowing to increase the length of coding block and expand the possibilities to adapt Viterbi algorithm to various operating conditions are offered. One more problem to be solved by the article presented is to attract the attention of specialists to an increasingly wider sphere of research where the technologies and paradigms of Optimization Theory find much higher application in comparison with the earlier “classical” coding theory applied.","PeriodicalId":393602,"journal":{"name":"2021 23rd International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Development of New Approaches to Apply Block Versions of Viterbi Algorithm\",\"authors\":\"V. Zolotarev, G. Ovechkin\",\"doi\":\"10.1109/DSPA51283.2021.9535869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ways to expand the capabilities of new block versions for optimal decoders developed on the basis of Viterbi algorithm when transmitting data over the channels with high noise level are considered. The aim of the work is to analyze the characteristics of new improved optimal decoders of this type which preserve decoding complexity close to the amount of computation in convolutional classical version of this algorithm. The characteristics of a new block decoder both in Gaussian channel and in standard binary symmetric channel are given. The ways of concatenation haven’t been used before are described, the directions for wider research of block Viterbi algorithm and its new implementation versions allowing to increase the length of coding block and expand the possibilities to adapt Viterbi algorithm to various operating conditions are offered. One more problem to be solved by the article presented is to attract the attention of specialists to an increasingly wider sphere of research where the technologies and paradigms of Optimization Theory find much higher application in comparison with the earlier “classical” coding theory applied.\",\"PeriodicalId\":393602,\"journal\":{\"name\":\"2021 23rd International Conference on Digital Signal Processing and its Applications (DSPA)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 23rd International Conference on Digital Signal Processing and its Applications (DSPA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DSPA51283.2021.9535869\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 23rd International Conference on Digital Signal Processing and its Applications (DSPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSPA51283.2021.9535869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

考虑了在高噪声信道上传输数据时,如何扩展基于Viterbi算法开发的最优解码器的新块版本的能力。本工作的目的是分析这种类型的新改进的最优解码器的特征,这些解码器使解码复杂度接近该算法的卷积经典版本的计算量。给出了一种新的分组解码器在高斯信道和标准二进制对称信道中的特性。对以前没有使用过的串接方式进行了描述,为进一步研究块Viterbi算法及其新的实现版本提供了方向,增加了编码块的长度,扩大了Viterbi算法适应各种操作条件的可能性。本文提出的另一个需要解决的问题是吸引专家注意到一个日益广泛的研究领域,与早期的“经典”编码理论相比,优化理论的技术和范式得到了更高的应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Development of New Approaches to Apply Block Versions of Viterbi Algorithm
The ways to expand the capabilities of new block versions for optimal decoders developed on the basis of Viterbi algorithm when transmitting data over the channels with high noise level are considered. The aim of the work is to analyze the characteristics of new improved optimal decoders of this type which preserve decoding complexity close to the amount of computation in convolutional classical version of this algorithm. The characteristics of a new block decoder both in Gaussian channel and in standard binary symmetric channel are given. The ways of concatenation haven’t been used before are described, the directions for wider research of block Viterbi algorithm and its new implementation versions allowing to increase the length of coding block and expand the possibilities to adapt Viterbi algorithm to various operating conditions are offered. One more problem to be solved by the article presented is to attract the attention of specialists to an increasingly wider sphere of research where the technologies and paradigms of Optimization Theory find much higher application in comparison with the earlier “classical” coding theory applied.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信