改进迭代译码算法对产品编码的性能研究

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI:10.1109/CASON.2011.6085934

Atta-ur-Rahman, Sajjad Ahmed Ghouri, Hanan Adeel, Abdul Waheed

{"title":"改进迭代译码算法对产品编码的性能研究","authors":"Atta-ur-Rahman, Sajjad Ahmed Ghouri, Hanan Adeel, Abdul Waheed","doi":"10.1109/CASON.2011.6085934","DOIUrl":null,"url":null,"abstract":"In this paper, a Modified Iterative Decoding Algorithm (MIDA) is investigated for decoding of Product codes. Product codes provide a good code rate as well as a good BER performance. Moreover, they have a brute power to correct burst errors, which are very harmful in digital transmission. It is because product codes are correct row-wise as well as column-wise. Conventional iterative decoding algorithm initially proposed by Al-Askary based upon Maximum Likelihood (ML) scheme, has a huge complexity which is unaffordable for long codes used in real time transmissions. MIDA being a sub-optimum algorithm reduces its complexity in an efficient way by utilizing the basic idea of Syndrome Decoding of Linear Block Codes. So decoding becomes more efficient also the complexity reduction factor increases with each iteration. The worst case complexity of MIDA is closed to that of conventional algorithm but in average case there is huge reduction in complexity, with negligible performance degradation.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Performance of Modified Iterative Decoding Algorithm for Product codes\",\"authors\":\"Atta-ur-Rahman, Sajjad Ahmed Ghouri, Hanan Adeel, Abdul Waheed\",\"doi\":\"10.1109/CASON.2011.6085934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a Modified Iterative Decoding Algorithm (MIDA) is investigated for decoding of Product codes. Product codes provide a good code rate as well as a good BER performance. Moreover, they have a brute power to correct burst errors, which are very harmful in digital transmission. It is because product codes are correct row-wise as well as column-wise. Conventional iterative decoding algorithm initially proposed by Al-Askary based upon Maximum Likelihood (ML) scheme, has a huge complexity which is unaffordable for long codes used in real time transmissions. MIDA being a sub-optimum algorithm reduces its complexity in an efficient way by utilizing the basic idea of Syndrome Decoding of Linear Block Codes. So decoding becomes more efficient also the complexity reduction factor increases with each iteration. The worst case complexity of MIDA is closed to that of conventional algorithm but in average case there is huge reduction in complexity, with negligible performance degradation.\",\"PeriodicalId\":342597,\"journal\":{\"name\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASON.2011.6085934\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASON.2011.6085934","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

本文研究了一种改进的迭代译码算法(MIDA)，用于产品码的译码。产品代码提供了良好的码率以及良好的误码率性能。此外，它们具有蛮力来纠正突发错误，这在数字传输中是非常有害的。这是因为产品代码在行方向和列方向上都是正确的。Al-Askary最初提出的基于最大似然(ML)方案的传统迭代译码算法具有巨大的复杂度，对于实时传输的长码来说是难以承受的。MIDA是一种次优算法，它利用线性分组码的综合征解码的基本思想，有效地降低了算法的复杂度。因此，解码变得更加高效，复杂度降低系数也随着每次迭代的增加而增加。在最坏情况下，MIDA算法的复杂度接近传统算法，但在平均情况下，其复杂度大大降低，而性能下降可以忽略不计。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Performance of Modified Iterative Decoding Algorithm for Product codes

In this paper, a Modified Iterative Decoding Algorithm (MIDA) is investigated for decoding of Product codes. Product codes provide a good code rate as well as a good BER performance. Moreover, they have a brute power to correct burst errors, which are very harmful in digital transmission. It is because product codes are correct row-wise as well as column-wise. Conventional iterative decoding algorithm initially proposed by Al-Askary based upon Maximum Likelihood (ML) scheme, has a huge complexity which is unaffordable for long codes used in real time transmissions. MIDA being a sub-optimum algorithm reduces its complexity in an efficient way by utilizing the basic idea of Syndrome Decoding of Linear Block Codes. So decoding becomes more efficient also the complexity reduction factor increases with each iteration. The worst case complexity of MIDA is closed to that of conventional algorithm but in average case there is huge reduction in complexity, with negligible performance degradation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 International Conference on Computational Aspects of Social Networks (CASoN)

自引率

0.00%

发文量