Invention Grant
US08245117B1 Low complexity chien search in chase-type decoding of reed-solomon codes
有权
低复杂度chien搜索reed-solomon码的追逐类型解码
- Patent Title: Low complexity chien search in chase-type decoding of reed-solomon codes
- Patent Title (中): 低复杂度chien搜索reed-solomon码的追逐类型解码
-
Application No.: US12653033Application Date: 2009-12-07
-
Publication No.: US08245117B1Publication Date: 2012-08-14
- Inventor: Yingquan Wu
- Applicant: Yingquan Wu
- Applicant Address: US CA Santa Clara
- Assignee: Link—A—Media Devices Corporation
- Current Assignee: Link—A—Media Devices Corporation
- Current Assignee Address: US CA Santa Clara
- Agency: Van Pelt, Yi & James LLP
- Main IPC: H03M13/00
- IPC: H03M13/00

Abstract:
Data is processed by obtaining a length of an error locator polynomial. It is determined whether the length of the error locator polynomial is greater than a threshold. In the event the length of the error locator polynomial is greater than the threshold, performance of a Chien search on the error locator polynomial is skipped. In the event the length of the error locator polynomial is less than or equal to than the threshold, the Chien search is performed on the error locator polynomial to determine one or more roots of the error locator polynomial, where the roots correspond to one or more error locations.
Information query
IPC分类: