{"title":"Reed-Solomon codecs for optical communications","authors":"E. Popovici, P. Fitzpatrick","doi":"10.1109/MIEL.2002.1003332","DOIUrl":null,"url":null,"abstract":"This paper presents methods for improving the performance of a Reed-Solomon codec (encoder/decoder) so that it matches the requirements of high throughput/low power of an optical communication system. It is shown that by a careful selection of the underlying Galois field arithmetic architectures, and of the algorithms for finding the error locations and error values, the performance can be improved substantially over current techniques. We show that the symbol-parallel Fitzpatrick algorithm for solving the key equation uses 30% fewer multipliers than Berlekamp-Massey type architectures, thus achieving a cost reduction for the entire codec. The implementations are synthesised for Xilinx FPGAs and LSI lca 300 k array-of-gates technologies.","PeriodicalId":221518,"journal":{"name":"2002 23rd International Conference on Microelectronics. Proceedings (Cat. No.02TH8595)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 23rd International Conference on Microelectronics. Proceedings (Cat. No.02TH8595)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MIEL.2002.1003332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
This paper presents methods for improving the performance of a Reed-Solomon codec (encoder/decoder) so that it matches the requirements of high throughput/low power of an optical communication system. It is shown that by a careful selection of the underlying Galois field arithmetic architectures, and of the algorithms for finding the error locations and error values, the performance can be improved substantially over current techniques. We show that the symbol-parallel Fitzpatrick algorithm for solving the key equation uses 30% fewer multipliers than Berlekamp-Massey type architectures, thus achieving a cost reduction for the entire codec. The implementations are synthesised for Xilinx FPGAs and LSI lca 300 k array-of-gates technologies.