Invention Grant
US09455747B1 Parallel chien search with folding and a symbolized minimal polynomial combinational network (S-MPCN)
有权
平行搜索与折叠和符号最小多项式组合网络（S-MPCN）
- Patent Title: Parallel chien search with folding and a symbolized minimal polynomial combinational network (S-MPCN)
- Patent Title (中): 平行搜索与折叠和符号最小多项式组合网络（S-MPCN）
-
Application No.: US14223643Application Date: 2014-03-24
-
Publication No.: US09455747B1Publication Date: 2016-09-27
- Inventor: Yi-Min Lin , Abhiram Prabhakar , Lingqi Zeng , Jason Bellorado
- Applicant: SK Hynix Inc.
- Applicant Address: KR Gyeonggi-do
- Assignee: SK Hynix Inc.
- Current Assignee: SK Hynix Inc.
- Current Assignee Address: KR Gyeonggi-do
- Agency: IP & T Group LLP
- Main IPC: H03M13/00
- IPC: H03M13/00 ; H03M13/15
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.
Information query
IPC分类:
