DocumentCode :
57828
Title :
Large Scale LP Decoding with Low Complexity
Author :
Guoqiang Zhang ; Heusdens, Richard ; Kleijn, W. Bastiaan
Author_Institution :
Dept. of Intell. Syst., Delft Univ. of Technol., Delft, Netherlands
Volume :
17
Issue :
11
fYear :
2013
fDate :
Nov-13
Firstpage :
2152
Lastpage :
2155
Abstract :
Linear program (LP) decoding has become increasingly popular for error-correcting codes due to its simplicity and promising performance. Low-complexity and efficient iterative algorithms for LP decoding are of great importance for practical applications. In this paper we focus on solving the binary LP decoding problem by using the alternating direction method of multipliers (ADMM). Our main contribution is that we propose a linear-complexity algorithm for the projection onto a parity polytope (having a computational complexity of small O(d), where small d is the check-node degree), as compared to recent work , which has a computational complexity of small O(d log d). In particular, we show that the projection onto the parity polytope can be transformed to a projection onto a simplex.
Keywords :
computational complexity; error correction codes; iterative decoding; linear codes; linear programming; ADMM; LP decoding; alternating direction method of multipliers; computational complexity; error-correcting codes; iterative algorithms; linear program decoding; Complexity theory; Iterative decoding; Maximum likelihood decoding; Optimization; Sorting; Vectors; Distributed optimization; LP decoding; alternating direction method of multipliers;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2013.101413.130826
Filename :
6636134
Link To Document :
بازگشت