| 摘要 |
<p>A polynomial evaluator, for use in a Reed-Solomon decoder, evaluates a polynomial P(X) iteratively, by substituting alpha <-j> for X in a jth iteration, to thereby provide a jth evaluation result P( alpha <-j>), wherein j is an integer ranging from 0 to N-1, N being a predetermined positive integer, alpha is a primitive element in a finite field GF(2<m>), the evaluator comprising: a memory block having T registers, T being a predefined positive integer; a root input block for sequentially providing a group of T elements in the finite field GF(2<m>); a multiplier on the finite field GF(2<m>) for sequentially multiplying the contents of each register with each element of the group provided from the root input block, to thereby provide T evaluating terms, wherein the contents of ith register is multiplied with ith element, to thereby provide ith evaluating term, i being 1 to T; a multiplexor for providing 1st to Tth coefficients of the polynomial P(X) or the T evaluating terms, to the memory block; and an addition block for determining a sum of the T evaluating terms. <IMAGE></p> |
