IEEE Communications Letters · 2015 · 52 citations · 7 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsOptimizationParallel ComputingChannel CodingCoding TheoryDigital Signal ProcessingError Control CodingError-correcting CodesLinear ProgrammingDecoding AlgorithmsDecoding ComplexityLdpc CodesLow-density Parity-check CodesParity Check CodesParity-check MatricesProjectionsTermination Techniques
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 over-relaxation and early termination techniques are used.
7
Decomposition Methods for Large Scale LP Decoding
Siddharth Barman, Xishuo Liu, Stark C. Draper et al. · IEEE Transactions on Information Theory · 2013 · 138 citations