Large scale LP decoding with low complexity

Zhang, G; Heusdens, R; Kleijn, WB

Large scale LP decoding with low complexity

Zhang, G

Heusdens, R Kleijn, WB

Permalink

Publication Type:: Journal Article
Citation:: IEEE Communications Letters, 2013, 17 (11), pp. 2152 - 2155
Issue Date:: 2013-11-01

Closed Access

	Filename	Description	Size
	06636134.pdf	Published Version	188.62 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, G https://orcid.org/0000-0003-4521-542X	en_US
dc.contributor.author	Heusdens, R	en_US
dc.contributor.author	Kleijn, WB	en_US
dc.date.issued	2013-11-01	en_US
dc.identifier.citation	IEEE Communications Letters, 2013, 17 (11), pp. 2152 - 2155	en_US
dc.identifier.issn	1089-7798	en_US
dc.identifier.uri	http://hdl.handle.net/10453/117329
dc.description.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 O(d), where d is the check-node degree), as compared to recent work [1], which has a computational complexity of O(d log d). In particular, we show that the projection onto the parity polytope can be transformed to a projection onto a simplex. © 1997-2012 IEEE.	en_US
dc.relation.ispartof	IEEE Communications Letters	en_US
dc.relation.isbasedon	10.1109/LCOMM.2013.101413.130826	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Large scale LP decoding with low complexity	en_US
dc.type	Journal Article
utslib.citation.volume	11	en_US
utslib.citation.volume	17	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access
pubs.issue	11	en_US
pubs.publication-status	Published	en_US
pubs.volume	17	en_US

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 O(d), where d is the check-node degree), as compared to recent work [1], which has a computational complexity of O(d log d). In particular, we show that the projection onto the parity polytope can be transformed to a projection onto a simplex. © 1997-2012 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/117329