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解码,块和卷积代码的交替使用节省了接收器的解码能力以及计算复杂性。
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.