An implementation for shortened Reed-Solomon decoder on FPGA
Wei He
Abstract
Wei He
Abstract
This paper discusses an algorithm for RS decoder, especially an improved BM(berlekamp-massey) method for the KE (key equation) solution is introduced,which can simplify the decoding process to a great extent. Based on this algorithm,the paper presents an architecture for its implementation on FPGA,in which parallel structures are largely used in order to achieve the speed as high as possible.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper discusses an algorithm for RS decoder, especially an improved BM(berlekamp-massey) method for the KE (key equation) solution is introduced,which can simplify the decoding process to a great extent. Based on this algorithm,the paper presents an architecture for its implementation on FPGA,in which parallel structures are largely used in order to achieve the speed as high as possible.
Key concepts: Computer science, Field-programmable gate array, Decoding methods, Key (lock), Soft-decision decoder, Process (computing), Architecture, Algorithm