Decoding low-density parity check (LDPC) codewords
US8543883B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 7, 2012 |
| Grant date | Sep 24, 2013 |
| Priority date | — |
| Expiry date | Sep 7, 2032 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/41
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A low-density parity-check (LDPC) codeword is decoded by performing a partial parity check, and based on the partial parity check, determining whether an iteration condition is met. Determining whether the iteration condition is met includes determining whether a time to decode a last codeword is approaching. Determining whether the iteration condition is met can additionally include determining whether a number of partial iterations reaches a maximum number of iterations and/or determining whether hardware resources are becoming limited. If the iteration condition is met, a decoding result is reported. If the iteration condition is not met, then a plurality of check nodes are updated and a parity check is performed.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.