GA-based soft-decision decoding of block codes

I. Shakeel
{"title":"GA-based soft-decision decoding of block codes","authors":"I. Shakeel","doi":"10.1109/ICTEL.2010.5478650","DOIUrl":null,"url":null,"abstract":"In this paper, soft-decision decoding is considered as an optimisation problem and a computationally efficient soft-decision decoding algorithm for block codes is developed using a compact Genetic Algorithm. The performance of this algorithm is investigated and compared with other decoding schemes. The results show the proposed algorithm gives large gains over the Generalised Minimum Distance (GMD) decoding algorithm and algebraic hard-decision decoding in flat Rayleigh fading. Further, the proposed algorithm achieves near maximum likelihood decoder (MLD) performance for the codes simulated. The complexity of this algorithm is also discussed and compared to the standard Order-l reprocessing algorithm.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 17th International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTEL.2010.5478650","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

In this paper, soft-decision decoding is considered as an optimisation problem and a computationally efficient soft-decision decoding algorithm for block codes is developed using a compact Genetic Algorithm. The performance of this algorithm is investigated and compared with other decoding schemes. The results show the proposed algorithm gives large gains over the Generalised Minimum Distance (GMD) decoding algorithm and algebraic hard-decision decoding in flat Rayleigh fading. Further, the proposed algorithm achieves near maximum likelihood decoder (MLD) performance for the codes simulated. The complexity of this algorithm is also discussed and compared to the standard Order-l reprocessing algorithm.
基于遗传算法的分组码软判决译码
本文将软判决译码视为一个优化问题,利用紧凑的遗传算法开发了一种计算效率高的分组码软判决译码算法。研究了该算法的性能,并与其他译码方案进行了比较。结果表明,在平坦瑞利衰落情况下,该算法比广义最小距离(GMD)译码算法和代数硬判决译码算法有较大的增益。此外,该算法对模拟的编码达到了接近最大似然解码器(MLD)的性能。讨论了该算法的复杂性,并与标准的order - 1再处理算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信