| 摘要 |
Parallel Reed Solomon error correction can be performed using dot products in finite fields while factoring out multiplier reduction. A finite field accumulator with left and right shifts of the polynomial dot products is used to generate the final result using a fixed dot product core and a small number of post processing Galois Field multiplies. An efficient Reed Solomon decoder for transmission, storage, and processing operations can be implemented in a small area while being easily scalable.
|
