一种新的快速Reed-Solomon解码算法

Proceedings of MILCOM '93 - IEEE Military Communications Conference Pub Date : 1993-10-11 DOI:10.1109/MILCOM.1993.408681

D. Chi

{"title":"一种新的快速Reed-Solomon解码算法","authors":"D. Chi","doi":"10.1109/MILCOM.1993.408681","DOIUrl":null,"url":null,"abstract":"This paper presents a novel Reed-Solomon (RS) decoding algorithm based on finite fields with an infinite element. The Chien Search procedure included in all existing general RS decoding algorithms can be totally eliminated in this new method. Hence it can reduce the decode time significantly. Comparisons with other RS decoding methods and hardware structure of this new algorithm are also discussed.<<ETX>>","PeriodicalId":323612,"journal":{"name":"Proceedings of MILCOM '93 - IEEE Military Communications Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new fast Reed-Solomon decoding algorithm without Chien search\",\"authors\":\"D. Chi\",\"doi\":\"10.1109/MILCOM.1993.408681\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel Reed-Solomon (RS) decoding algorithm based on finite fields with an infinite element. The Chien Search procedure included in all existing general RS decoding algorithms can be totally eliminated in this new method. Hence it can reduce the decode time significantly. Comparisons with other RS decoding methods and hardware structure of this new algorithm are also discussed.<<ETX>>\",\"PeriodicalId\":323612,\"journal\":{\"name\":\"Proceedings of MILCOM '93 - IEEE Military Communications Conference\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of MILCOM '93 - IEEE Military Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.1993.408681\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of MILCOM '93 - IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1993.408681","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

提出了一种基于无限元有限域的RS译码算法。该方法完全消除了现有一般RS译码算法中包含的简搜索过程。因此，它可以显著减少解码时间。讨论了该算法与其他RS译码方法的比较和硬件结构。

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

查看原文本刊更多论文

A new fast Reed-Solomon decoding algorithm without Chien search

This paper presents a novel Reed-Solomon (RS) decoding algorithm based on finite fields with an infinite element. The Chien Search procedure included in all existing general RS decoding algorithms can be totally eliminated in this new method. Hence it can reduce the decode time significantly. Comparisons with other RS decoding methods and hardware structure of this new algorithm are also discussed.<>

求助全文

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

来源期刊

Proceedings of MILCOM '93 - IEEE Military Communications Conference

自引率

0.00%

发文量