基于GMD准则的Reed-Solomon码的高效译码

[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic Pub Date : 1992-05-27 DOI:10.1109/ISMVL.1992.186788

K. Araki, M. Takada, M. Morii

{"title":"基于GMD准则的Reed-Solomon码的高效译码","authors":"K. Araki, M. Takada, M. Morii","doi":"10.1109/ISMVL.1992.186788","DOIUrl":null,"url":null,"abstract":"An efficient algorithm for GMD (generalized minimum distance) decoding is presented. It requires an algebraic errors-and-erasures decoding procedure to execute only one time. The Welch-Berlekamp iterative method is efficiently used to reduce the number of algebraic decoding procedures. A method for hardware implementation of this GMD decoding is shown.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On the efficient decoding of Reed-Solomon codes based on GMD criterion\",\"authors\":\"K. Araki, M. Takada, M. Morii\",\"doi\":\"10.1109/ISMVL.1992.186788\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An efficient algorithm for GMD (generalized minimum distance) decoding is presented. It requires an algebraic errors-and-erasures decoding procedure to execute only one time. The Welch-Berlekamp iterative method is efficiently used to reduce the number of algebraic decoding procedures. A method for hardware implementation of this GMD decoding is shown.<<ETX>>\",\"PeriodicalId\":127091,\"journal\":{\"name\":\"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.1992.186788\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.1992.186788","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

提出了一种有效的广义最小距离译码算法。它要求只执行一次代数错误和擦除解码过程。采用Welch-Berlekamp迭代法有效地减少了代数解码过程的数量。给出了这种GMD解码的硬件实现方法

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

查看原文本刊更多论文

On the efficient decoding of Reed-Solomon codes based on GMD criterion

An efficient algorithm for GMD (generalized minimum distance) decoding is presented. It requires an algebraic errors-and-erasures decoding procedure to execute only one time. The Welch-Berlekamp iterative method is efficiently used to reduce the number of algebraic decoding procedures. A method for hardware implementation of this GMD decoding is shown.<>

求助全文

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

来源期刊

[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量