Performance of Modified Iterative Decoding Algorithm for Multilevel codes

Atta-ur-Rahman
{"title":"Performance of Modified Iterative Decoding Algorithm for Multilevel codes","authors":"Atta-ur-Rahman","doi":"10.1109/CASoN.2012.6412385","DOIUrl":null,"url":null,"abstract":"In this paper, performance of Modified Iterative Decoding Algorithm (MIDA) is investigated for decoding of Multi-level codes. MIDA is a hard decision decoder that was initially proposed for decoding of Product codes, by same authors. In this paper same concept is being extended for Multi-level codes. The basic iterative decoder has a huge complexity which is unaffordable for long constituent codes especially when used in real time systems. In MIDA, the idea of Syndrome Decoding is used for search space reduction. Moreover, it is found that complexity reduction factor increases with each iteration. The worst case complexity of MIDA is closed to that of basic algorithm but in average case there is huge reduction in complexity, with negligible performance degradation. Performance of the proposed algorithm is investigated over an OFDM system. Additive White Gaussian Noise (AWGN) channel and Rayleigh fading channel are used for simulations.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASoN.2012.6412385","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, performance of Modified Iterative Decoding Algorithm (MIDA) is investigated for decoding of Multi-level codes. MIDA is a hard decision decoder that was initially proposed for decoding of Product codes, by same authors. In this paper same concept is being extended for Multi-level codes. The basic iterative decoder has a huge complexity which is unaffordable for long constituent codes especially when used in real time systems. In MIDA, the idea of Syndrome Decoding is used for search space reduction. Moreover, it is found that complexity reduction factor increases with each iteration. The worst case complexity of MIDA is closed to that of basic algorithm but in average case there is huge reduction in complexity, with negligible performance degradation. Performance of the proposed algorithm is investigated over an OFDM system. Additive White Gaussian Noise (AWGN) channel and Rayleigh fading channel are used for simulations.
改进迭代译码算法的多电平译码性能
本文研究了改进迭代译码算法(MIDA)在多级码译码中的性能。MIDA是一种硬决策解码器,最初由同一作者提出用于解码产品代码。本文将这一概念推广到多级码。基本的迭代解码器具有巨大的复杂性,特别是在实时系统中使用时,难以承受长组成码。在MIDA中,使用了综合征解码的思想来减少搜索空间。此外,发现复杂度降低因子随迭代次数的增加而增加。在最坏情况下,MIDA算法的复杂度接近于基本算法,但在平均情况下,其复杂度大大降低,而性能下降可以忽略不计。在OFDM系统中研究了该算法的性能。采用加性高斯白噪声信道和瑞利衰落信道进行仿真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信