ML解码卷积码短码字的短约束长度和替代使用的块码

A. Al zaman, M.S.A. Khan, S. Sultana, S. M. Taohidul Islam
{"title":"ML解码卷积码短码字的短约束长度和替代使用的块码","authors":"A. Al zaman, M.S.A. Khan, S. Sultana, S. M. Taohidul Islam","doi":"10.1109/SECON.2007.342882","DOIUrl":null,"url":null,"abstract":"This paper primarily deals with the error correction for the error correcting code, convolutional code. Viterbi decoding algorithm is the well known algorithm to decode convolutional code. Some of its limitations are overcome by the proposed algorithm in (Saifullah and Al-Mamun, 2004). This paper shows the improvement made by maximum likelihood (ML) decoding in simple form over the Viterbi algorithm and the proposed algorithm in (Saifullah and Al-Mamun, 2004) for short codeword and constraint length because of its low complexity. With this ML decoding, alternate use of block and convolutional code saves receiver's decoding power as well as computational complexity.","PeriodicalId":423683,"journal":{"name":"Proceedings 2007 IEEE SoutheastCon","volume":"138 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ML decoding for convolutional code for short codeword of short constraint length and alternate use of block code\",\"authors\":\"A. Al zaman, M.S.A. Khan, S. Sultana, S. M. Taohidul Islam\",\"doi\":\"10.1109/SECON.2007.342882\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper primarily deals with the error correction for the error correcting code, convolutional code. Viterbi decoding algorithm is the well known algorithm to decode convolutional code. Some of its limitations are overcome by the proposed algorithm in (Saifullah and Al-Mamun, 2004). This paper shows the improvement made by maximum likelihood (ML) decoding in simple form over the Viterbi algorithm and the proposed algorithm in (Saifullah and Al-Mamun, 2004) for short codeword and constraint length because of its low complexity. With this ML decoding, alternate use of block and convolutional code saves receiver's decoding power as well as computational complexity.\",\"PeriodicalId\":423683,\"journal\":{\"name\":\"Proceedings 2007 IEEE SoutheastCon\",\"volume\":\"138 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2007 IEEE SoutheastCon\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.2007.342882\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2007 IEEE SoutheastCon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.2007.342882","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文主要研究纠错码——卷积码的纠错问题。Viterbi译码算法是卷积码译码的常用算法。在(Saifullah and Al-Mamun, 2004)中提出的算法克服了它的一些局限性。本文展示了简单形式的最大似然(ML)解码相对于Viterbi算法和(Saifullah and Al-Mamun, 2004)中提出的算法在短码字和约束长度方面的改进,因为它的复杂度较低。使用这种ML解码,块和卷积代码的交替使用节省了接收器的解码能力以及计算复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ML decoding for convolutional code for short codeword of short constraint length and alternate use of block code
This paper primarily deals with the error correction for the error correcting code, convolutional code. Viterbi decoding algorithm is the well known algorithm to decode convolutional code. Some of its limitations are overcome by the proposed algorithm in (Saifullah and Al-Mamun, 2004). This paper shows the improvement made by maximum likelihood (ML) decoding in simple form over the Viterbi algorithm and the proposed algorithm in (Saifullah and Al-Mamun, 2004) for short codeword and constraint length because of its low complexity. With this ML decoding, alternate use of block and convolutional code saves receiver's decoding power as well as computational complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Gaussian particle filtering for tracking maneuvering targets Three level back-to-back HVDC based on H-bridge converter Demonstration of a high-resolution optical interrogation method for sampled fiber Bragg sensor Reduced current class AB radio receiver stages using novel superlinear transistors with parallel NMOS and PMOS transistors at one GHz Development and evaluation of an educational computer network software
×
引用
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