Evaluating and optimizing error-correcting codes using a renormalization group transformation
US6857097B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 16, 2001 |
| Grant date | Feb 15, 2005 |
| Priority date | — |
| Expiry date | May 19, 2022 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/37
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A method evaluates an error-correcting code for a data block of a finite size. An error-correcting code is defined by a parity check matrix, wherein columns represent variable bits and rows represent parity bits. The parity check matrix is represented as a bipartite graph. A single node in the bipartite graph is iteratively renormalized until the number of nodes in the bipartite graph is less than a predetermine threshold. During the iterative renormalization, a particular variable node is selected as a target node, and a distance between the target node and every other node in the bipartite graph is measured. Then, if there is at least one leaf variable node, renormalize the leaf variable node farthest from the target node, otherwise, renormalize a leaf check node farthest from the target node, and otherwise renormalize a variable node farthest from the target node and having fewest directly connected check nodes. By evaluating many error-correcting codes according to the method, an optimal code according to selected criteria can be obtained.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.