Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
865460 | Tsinghua Science & Technology | 2009 | 5 Pages |
Abstract
The problem of improving the performance of linear programming (LP) decoding of low-density parity-check (LDPC) codes is considered in this paper. A multistep linear programming (MLP) algorithm was developed for decoding LDPC codes that includes a slight increase in computational complexity. The MLP decoder adaptively adds new constraints which are compatible with a selected check node to refine the results when an error is reported by the original LP decoder. The MLP decoder result is shown to have the maximum-likelihood (ML) certificate property. Simulations with moderate block length LDPC codes suggest that the MLP decoder gives better performance than both the original LP decoder and the conventional sum-product (SP) decoder.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Engineering (General)
Authors
Liu (åæµ·æ´), Ma (马è¿è£), Chen (é æ°),