An Analysis of Time Domain Reed Solomon Decoder with FPGA Implementation

dc.contributor.authorKentaro KATO
dc.contributor.authorSomsak CHOOMCHUAY
dc.date.accessioned2025-07-21T05:57:36Z
dc.date.issued2017-01-01
dc.description.abstractThis paper analyzes the time domain Reed Solomon Decoder with FPGA implementation. Data throughput and area is carefully evaluated compared with typical frequency domain Reed Solomon Decoder. In this analysis, three hardware architecture to enhance the data throughput, namely, the pipelined architecture, the parallel architecture, and the truncated arrays, is evaluated, too. The evaluation reveals that the number of the consumed resources of RS(255, 239) is about 20% smaller than those of the frequency domain decoder although data throughput is less than 10% of the frequency domain decoder. The number of the consumed resources of the pipelined architecture is 28% smaller than that of the parallel architecture when data throughput is same. It is because the pipeline architecture requires less extra logics than the parallel architecture. To get higher data throughput, the pipelined architecture is better than the parallel architecture from the viewpoint of consumed resources.
dc.identifier.doi10.1587/transinf.2017edp7039
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/6118
dc.subjectParallel architecture
dc.subject.classificationCoding theory and cryptography
dc.titleAn Analysis of Time Domain Reed Solomon Decoder with FPGA Implementation
dc.typeArticle

Files

Collections