Efficient Chien search method and system in Reed-Solomon decoding
First Claim
1. A Chien search method in Reed-Solomon decoding, which is suitable for use in a processor having a parallel processing instruction set, the method comprising the following steps:
- (a) if an error location polynomial that has been found matches a preset condition, finding at least one error symbol location according to the error location polynomial directly through table lookup, when a length of the error location polynomial is equal to a first predetermined value, looking up a pre-constructed first error location table to find said at least one error symbol location, wherein the number of said at least one error symbol location is equal to the first predetermined value;
(b) if the error location polynomial does not match the preset condition, executing steps (c) to (e);
(c) calculating an error evaluation value according to the error location polynomial;
(d) if the error evaluation value is equal to 0, storing an error symbol location in an error location memory; and
(e) if the error evaluation value is not equal to 0, the flow returning to step (c).
1 Assignment
0 Petitions
Accused Products
Abstract
An efficient Chien search method in Reed-Solomon decoding is adapted for use in a processor having a parallel processing instruction set. The method includes the following steps: (a) if an error location polynomial that has been found matches a preset condition, finding at least one error symbol location directly through table lookup; (b) if the error location polynomial does not match the preset condition, executing steps (c) to (e); (c) calculating an error evaluation value; (d) if the error evaluation value is equal to 0, storing an error symbol location in an error location memory; and (e) if the error evaluation value is not equal to 0, the flow returning to step (c).
-
Citations
12 Claims
-
1. A Chien search method in Reed-Solomon decoding, which is suitable for use in a processor having a parallel processing instruction set, the method comprising the following steps:
-
(a) if an error location polynomial that has been found matches a preset condition, finding at least one error symbol location according to the error location polynomial directly through table lookup, when a length of the error location polynomial is equal to a first predetermined value, looking up a pre-constructed first error location table to find said at least one error symbol location, wherein the number of said at least one error symbol location is equal to the first predetermined value; (b) if the error location polynomial does not match the preset condition, executing steps (c) to (e); (c) calculating an error evaluation value according to the error location polynomial; (d) if the error evaluation value is equal to 0, storing an error symbol location in an error location memory; and (e) if the error evaluation value is not equal to 0, the flow returning to step (c). - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. An Chien search system for Reed-Solomon decoding, which is suitable for use in a processor having a parallel processing instruction set, said Chien search system comprising:
-
a first determining module for determining whether an error location polynomial that has been found matches a preset condition; a table look-up module for finding at least one error symbol location according to the error location polynomial directly through table lookup when said first determining module determines a match with the preset condition; an error evaluation module for calculating an error evaluation value according to the error location polynomial when said first determining module determines no match with the preset condition; a second determining module for determining whether the error evaluation value is equal to 0; a memory write module for storing an error symbol location in an error location memory when the error evaluation value is determined by said second determining module to be equal to 0; and a pre-constructed first error location table; wherein, when said first determining module determines that the error location polynomial has a length equal to a first predetermined value, said table lookup module finds said at least one error symbol location from said first error location table, the number of said at least one error symbol location being equal to the first predetermined value. - View Dependent Claims (8, 9, 10, 11, 12)
-
Specification