Name
Abstract | ||
|---|---|---|
The Euclidean projection onto check polytopes is the most time-consuming operation in the linear programming (LP) decoding based on alternating direction method of multipliers (ADMM) for low-density parity-check (LDPC) codes. In this letter, instead of reducing the complexity of Euclidean projection itself, we propose a new method to reduce the decoding complexity of ADMM-based LP decoder by decreasing the number of Euclidean projections. In particular, if all absolute values of the element-wise differences between the input vector of Euclidean projection in the current iteration and that in the previous iteration are less than a predefined value, then the Euclidean projection at the current iteration will be no longer performed. Simulation results show that the proposed decoder can still save roughly 20% decoding time even if both the overrelaxation and early termination techniques are used. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/LCOMM.2015.2418261 | Communications Letters, IEEE |
Keywords | Field | DocType |
Decoding,Standards,Signal to noise ratio,Vectors,Iterative decoding,Complexity theory | Discrete mathematics,Sequential decoding,Absolute value,Low-density parity-check code,Computer science,Algorithm,Real-time computing,Polytope,Linear programming,Euclidean geometry,Decoding methods,List decoding | Journal |
Volume | Issue | ISSN |
PP | 99 | 1089-7798 |
Citations | PageRank | References |
12 | 0.71 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haoyuan Wei | 1 | 12 | 1.38 |
| Xiaopeng Jiao | 2 | 38 | 9.90 |
| Jianjun Mu | 3 | 41 | 10.63 |