Evaluating and optimizing error-correcting codes using a renormalization group transformation |
|||||||
| 申请号 | EP02009144.3 | 申请日 | 2002-04-24 | 公开(公告)号 | EP1258999A3 | 公开(公告)日 | 2004-08-25 |
| 申请人 | MITSUBISHI DENKI KABUSHIKI KAISHA; | 发明人 | Yedidia, Jonathan S.; Bouchaud, Jean-Philippe M.; | ||||
| 摘要 | 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. | ||||||
| 权利要求 | |||||||
| 说明书全文 | |||||||
QQ群二维码
意见反馈
意见反馈