FPGA design trade-offs for solving the key equation in reed-solomon decoding

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

Reed-Solomon codes are widely used in communications as well as in data storage for the correction of errors due to channel noise. In this paper we present a comparison between implementations of the Berlekamp-Massey algorithm and the Fitzpatrick algorithm. Both algorithms were synthesised and implemented on an FPGA and compared in terms of area, speed and routability. The modules can be used as part of a core-based design for Reed-Solomon decoders.

Original languageEnglish
Title of host publicationField Programmable Logic and Applications - 9th International Workshop, FPL 1999, Proceedings
EditorsPatrick Lysaght, James Irvine, Reiner W. Hartenstein
PublisherSpringer Verlag
Pages353-358
Number of pages6
ISBN (Print)3540664572, 9783540664574
DOIs
Publication statusPublished - 1999
Event9th International Workshop on Field Programmable Logic and Applications, FPL 1999 - Glasgow, United Kingdom
Duration: 30 Aug 19991 Sep 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1673
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Workshop on Field Programmable Logic and Applications, FPL 1999
Country/TerritoryUnited Kingdom
CityGlasgow
Period30/08/991/09/99

Fingerprint

Dive into the research topics of 'FPGA design trade-offs for solving the key equation in reed-solomon decoding'. Together they form a unique fingerprint.

Cite this