Parallel chien search with folding and a symbolized minimal polynomial combinational network (S-MPCN)
US9455747B1 · kind B1 · utility
1Cited by
0References
15Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Mar 24, 2014 |
| Grant date | Sep 27, 2016 |
| Priority date | — |
| Expiry date | Jul 5, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/6561
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A hinge path is used to determine if a first possible root is a root of an error location polynomial. A positive limb path is used to determine if a second possible root is a root of the error location polynomial, including by using a sequence of coefficients associated with the error location polynomial. The sequence of coefficients is reversed and a negative limb path is used to determine if a third possible root is a root of the error location polynomial, including by using the reversed sequence of coefficients, wherein the negative limb path is a copy of the positive limb path.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.