Journal
IEEE COMMUNICATIONS LETTERS
Volume 22, Issue 1, Pages 29-32Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2017.2766223
Keywords
Alternating direction method of multipliers (ADMM); low-density parity-check (LDPC) codes; linear-programming (LP) decoding of LDPC codes; Euclidean projection; check polytope projection
Categories
Ask authors/readers for more resources
Alternating direction method of multipliers (ADMM) is a popular technique for linear-programming decoding of low-density parity-check codes. The computational complexity of ADMM is dominated by the Euclidean projection of a real-valued vector onto a parity-check polytope. Existing algorithms for such a projection all require sorting operations, which happen to be the most complex part of the projection. In this letter, we propose an iterative algorithm, without sorting operation, for projection onto the parity-check polytope. The proposed algorithm has a worst case complexity linear in the input dimension compared with the super-linear complexity of existing algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available