Large Scale LP Decoding with Low Complexity

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 17; číslo 11; s. 2152 - 2155
Hlavní autoři: Guoqiang Zhang, Heusdens, Richard, Kleijn, W. Bastiaan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.11.2013
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
alternating direction method of multipliers
Applied sciences
Coding, codes
Complexity theory
Distributed optimization
Exact sciences and technology
Information, signal and communications theory
Iterative decoding
LP decoding
Maximum likelihood decoding
Optimization
Signal and communications theory
Sorting
Telecommunications and information theory
Vectors
Performance evaluation
Alternating direction method
Polytope
Iterative method
Decoding
LP decoding
Algorithm
Computational complexity
Optimization
Distributed optimization
alternating direction method of multipliers
Algorithm performance
Algorithm complexity
Linear complexity
Error correcting code
Multiplying circuits
ISSN:1089-7798, 1558-2558
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2013.101413.130826