Near Perfect Decoding of LDPC Codes
| dc.creator | Huang, Xiaofei | |
| dc.date | 2005-04-06 | |
| dc.date.accessioned | 2026-07-07T08:15:25Z | |
| dc.date.available | 2026-07-07T08:15:25Z | |
| dc.description | Cooperative optimization is a new way for finding global optima of complicated functions of many variables. It has some important properties not possessed by any conventional optimization methods. It has been successfully applied in solving many large scale optimization problems in image processing, computer vision, and computational chemistry. This paper shows the application of this optimization principle in decoding LDPC codes, which is another hard combinatorial optimization problem. In our experiments, it significantly out-performed the sum-product algorithm, the best known method for decoding LDPC codes. Compared to the sum-product algorithm, our algorithm reduced the error rate further by three fold, improved the speed by six times, and lowered error floors dramatically in the decoding. | |
| dc.description | 5 pages, submitted to the 2005 IEEE International Symposium on Information Theory | |
| dc.identifier | https://arxiv.org/abs/cs/0504021 | |
| dc.identifier | http://arxiv.org/abs/cs/0504021 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133440 | |
| dc.subject | Information Theory | |
| dc.title | Near Perfect Decoding of LDPC Codes | |
| dc.type | text |