PIPELINED REED-SOLOMON DECODER

摘要

Respective symbols of received data words are input (11) in successively-starting symbol cycles. Syndromes for received data words from are computed from the symbols (120), an effect of each received symbol being computed in a respective one of the symbol cycles. The syndromes determine key equations. The key equations are solved and coefficients of an error locator polynomial for the received data word are computed from a combination of syndromes for each received data word in iterative steps (122). Each iterative step is performed in a respective key equation solver cycle. The key equation solver cycles occur at a first average frequency which is lower than a second average frequency of the start of symbol cycles. Corrections to the received data words are computed from solutions of the key equations (124, 126). A correction to each respective symbol being output in a respective one of the symbol cycles. The computing of syndromes, solving and computing corrections is performed pipelined with one another.