{"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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
