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žené v:

Podrobná bibliografia
Vydané v:	IEEE communications letters Ročník 17; číslo 11; s. 2152 - 2155
Hlavní autori:	Guoqiang Zhang, Heusdens, Richard, Kleijn, W. Bastiaan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.11.2013 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

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.
AbstractList	\boldmath 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. [PUBLICATION 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.
Author	Heusdens, Richard Guoqiang Zhang Kleijn, W. Bastiaan
Author_xml	– sequence: 1 surname: Guoqiang Zhang fullname: Guoqiang Zhang email: g.zhang-1@tudelft.nl organization: Dept. of Intell. Syst., Delft Univ. of Technol., Delft, Netherlands – sequence: 2 givenname: Richard surname: Heusdens fullname: Heusdens, Richard email: r.heusdens@tudelft.nl organization: Dept. of Intell. Syst., Delft Univ. of Technol., Delft, Netherlands – sequence: 3 givenname: W. Bastiaan surname: Kleijn fullname: Kleijn, W. Bastiaan email: bastiaan.kleijn@ecs.vuw.ac.nz organization: Dept. of Intell. Syst., Delft Univ. of Technol., Delft, Netherlands
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27948181$$DView record in Pascal Francis
BookMark	eNqNkE9LwzAYh4NMcJt-Ai8F8SSdeZs0TS6C1L_QMcHdQ9qlM6NrZtIx9-3NrOzgyUt-OTzv7315RmjQ2lYjFAGeAGBxW-Sz6XSSYCATwEAPQTBP2AkaQpryOAnPIPwxF3GWCX6GRt6vMA5MCkN0Uyi31NF7pRodFW_Rg67swrTLaGe6j6iwuyi3602jv0y3P0entWq8vvjNMZo_Pc7zl7iYPb_m90VcEZJ1caXrrFQ1xTUTKkuUSDlniomUsRJYyqgmeFEqAMIpUQtGoRS1SHBaCx2SjNFVX7tx9nOrfSdXduvasFECZYkQDBIeqOtfSvlwfO1UWxkvN86sldvLJBOUA4fA8Z6rnPXe6fqIAJYHg_LHoDwYlL1B2RsMo3d_RivTqc7YtnPKNP8puOwLjNb6uJcxwoBQ8g3_yX9A
CODEN	ICLEF6
CitedBy_id	crossref_primary_10_1109_ACCESS_2022_3224226 crossref_primary_10_1155_2018_8738613 crossref_primary_10_1109_LCOMM_2017_2766223 crossref_primary_10_1109_LCOMM_2022_3199747 crossref_primary_10_1109_LSP_2024_3511336 crossref_primary_10_1109_TSP_2020_2964223 crossref_primary_10_1109_TCOMM_2021_3065976 crossref_primary_10_1109_LCOMM_2025_3585192 crossref_primary_10_1109_TIT_2019_2955504 crossref_primary_10_1109_TIT_2022_3147906 crossref_primary_10_1109_TIT_2020_2984247 crossref_primary_10_1109_LCOMM_2019_2926085 crossref_primary_10_1109_TSP_2019_2929944 crossref_primary_10_1016_j_comcom_2020_02_063 crossref_primary_10_1109_LCOMM_2016_2627575 crossref_primary_10_1109_TSIPN_2017_2672403 crossref_primary_10_1109_TCOMM_2017_2659733 crossref_primary_10_1109_LCOMM_2015_2418261 crossref_primary_10_1038_s41598_025_97807_5 crossref_primary_10_1109_LCOMM_2015_2421445 crossref_primary_10_1109_LWC_2020_3002171 crossref_primary_10_1109_LCOMM_2022_3143235 crossref_primary_10_1109_ACCESS_2023_3234182 crossref_primary_10_1287_ijoc_2022_0328 crossref_primary_10_1109_TIT_2016_2554598 crossref_primary_10_1109_TIT_2016_2555847 crossref_primary_10_1109_TCOMM_2024_3382328 crossref_primary_10_1109_LCOMM_2019_2942022 crossref_primary_10_1109_LCOMM_2016_2643629 crossref_primary_10_1587_transfun_2024EAL2109 crossref_primary_10_1109_ACCESS_2020_2998950 crossref_primary_10_1109_LWC_2019_2904565 crossref_primary_10_1109_TII_2016_2605628 crossref_primary_10_1109_TIT_2025_3535947 crossref_primary_10_1109_LSP_2017_2758809 crossref_primary_10_1109_LWC_2023_3247009 crossref_primary_10_1109_LCOMM_2020_3023600
Cites_doi	10.1109/TCOMM.2010.102910.090490 10.1109/ISIT.2013.6620477 10.1561/2200000016 10.1109/TIT.2010.2060030 10.1109/18.748992 10.1017/CBO9780511791338 10.1109/4234.905935 10.1109/TIT.2004.842696
ContentType	Journal Article
Copyright	2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2013
Copyright_xml	– notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2013
DBID	97E RIA RIE AAYXX CITATION IQODW 7SP 8FD L7M
DOI	10.1109/LCOMM.2013.101413.130826
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore Digital Library CrossRef Pascal-Francis Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace
DatabaseTitle	CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Applied Sciences
EISSN	1558-2558
EndPage	2155
ExternalDocumentID	3143252541 27948181 10_1109_LCOMM_2013_101413_130826 6636134
Genre	orig-research
GroupedDBID	-~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV AZLTO BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION AAYOK IQODW RIG 7SP 8FD L7M
ID	FETCH-LOGICAL-c337t-cef7baf40f69a72a95886a69566b16564e30dba113843ad641b9f9205f9ef923
IEDL.DBID	RIE
ISICitedReferencesCount	62
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000327979900035&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1089-7798
IngestDate	Mon Jun 30 10:14:29 EDT 2025 Wed Apr 02 07:35:46 EDT 2025 Tue Nov 18 22:12:14 EST 2025 Sat Nov 29 06:26:31 EST 2025 Wed Aug 27 02:48:16 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	11
Keywords	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
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c337t-cef7baf40f69a72a95886a69566b16564e30dba113843ad641b9f9205f9ef923
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	1462996128
PQPubID	85419
PageCount	4
ParticipantIDs	pascalfrancis_primary_27948181 crossref_primary_10_1109_LCOMM_2013_101413_130826 ieee_primary_6636134 crossref_citationtrail_10_1109_LCOMM_2013_101413_130826 proquest_journals_1462996128
PublicationCentury	2000
PublicationDate	2013-11-01
PublicationDateYYYYMMDD	2013-11-01
PublicationDate_xml	– month: 11 year: 2013 text: 2013-11-01 day: 01
PublicationDecade	2010
PublicationPlace	New York, NY
PublicationPlace_xml	– name: New York, NY – name: New York
PublicationTitle	IEEE communications letters
PublicationTitleAbbrev	COML
PublicationYear	2013
Publisher	IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref7 ref4 ref3 ref6 ref11 ref10 ref5 barman (ref1) 2012 ref2 duchi (ref9) 0 vontobel (ref8) 0 cormen (ref12) 2001
References_xml	– ident: ref7 doi: 10.1109/TCOMM.2010.102910.090490 – ident: ref10 doi: 10.1109/ISIT.2013.6620477 – year: 2001 ident: ref12 article-title: Introduction to Algorithms. – year: 2012 ident: ref1 article-title: Decomposition methods for large scale LP decoding publication-title: arXiv 1204 0556 [cs IT] – ident: ref11 doi: 10.1561/2200000016 – start-page: 1603 year: 0 ident: ref8 article-title: Towards low-complexity linear-programming decoding publication-title: Proc 4th International Symposium on Turbo Codes & Related Topics 2006 – ident: ref6 doi: 10.1109/TIT.2010.2060030 – year: 0 ident: ref9 article-title: Efficient projections onto the L 1-Ball for learning in high dimensions publication-title: Proc of ACM Int Conf on Machine Learning 2008 – ident: ref2 doi: 10.1109/18.748992 – ident: ref4 doi: 10.1017/CBO9780511791338 – ident: ref3 doi: 10.1109/4234.905935 – ident: ref5 doi: 10.1109/TIT.2004.842696
SSID	ssj0008251
Score	2.3364966
Snippet	Linear program (LP) decoding has become increasingly popular for error-correcting codes due to its simplicity and promising performance. Low-complexity and... \boldmath Linear program (LP) decoding has become increasingly popular for error-correcting codes due to its simplicity and promising performance....
SourceID	proquest pascalfrancis crossref ieee
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	2152
SubjectTerms	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
Title	Large Scale LP Decoding with Low Complexity
URI	https://ieeexplore.ieee.org/document/6636134 https://www.proquest.com/docview/1462996128
Volume	17
WOSCitedRecordID	wos000327979900035&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2558 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008251 issn: 1089-7798 databaseCode: RIE dateStart: 19970101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED6VigEG3ohCqTKwQSBuHD9GBFQMbalEh26R7dgSEmpRm4L49_iSNKKCAYbIkRIn1ueLvzvnHgAXJlFdLjMdZgk3IRWJC5XLVGicIInmmWNKF8Um-HAoJhM5asBVHQtjrS2cz-w1nhb_8rOZWeJW2Y1nR88-dAM2OGdlrFa96mIIZulML73GKMXKayeSN_27p8EAvbhitFUpNpikha1RUVFbBT0j1cKD48qqFj8W6IJ1erv_G-8e7FTaZXBbisM-NOz0ALa_5Rw8hMs--n4Hz_71NuiPgntvfyJ_BbgjG_RnHwEuEZgmM_88gnHvYXz3GFYVE0ITxzwPjXVcK0cjx6TiXSUTIZhi3gZiGtPsUBtHmVaExILGKmOUaOlkN0qctL6Nj6E5nU3tCQSSUEP9QXRiqHVKEuWJXAqhBcs8r7aAr7BLTZVNHItavKaFVRHJtEA9RdTTEvW0RL0FpO75VmbU-EOfQ0S3vr8CtgWdtemqr3vxo14TIS1or-Yvrb7NBRo7noO9ZidOf3_sGWzhEMqIwzY08_nSnsOmec9fFvNOIXZfo-_RDQ
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH_MKagHv8XpnD1407pmTdvkKNMxsZsDd9itJGkCgmyyD8X_3ry2Kw496KGk0KYNv7zm9176PgAuVSBaEU-lmwaRcikLjCtMKlxlGAlklJpQyKzYRNTvs9GIDypwXcbCaK0z5zN9g6fZv_x0oha4Vda07GjZh67BOlbOKqK1ynUXgzBzd3pudUbOln47Hm_G7adeD_24fLRWKTaYpiVcIaOsugr6RoqZhcfkdS1-LNEZ73R2_zfiPdgp9EvnNheIfajo8QFsf8s6eAhXMXp_O8_29dqJB86dtUCRwRzck3XiyYeDiwQmypx_HsGwcz9sd92iZoKrfD-au0qbSApDPRNyEbUEDxgLRWitoFBioh2qfS-VghCfUV-kISWSG97yAsO1bf1jqI4nY30CDidUUXsQGSiqjeBEWCrnjEkWppZZaxAtsUtUkU8cy1q8Jpld4fEkQz1B1JMc9SRHvQak7PmW59T4Q59DRLe8vwC2Bo2V6SqvWwGkVhchNagv5y8pvs4ZmjuWha1ux05_f-wFbHaHvTiJH_qPZ7CFw8njD-tQnU8X-hw21Pv8ZTZtZCL4Bbg61FY
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Large+Scale+LP+Decoding+with+Low+Complexity&rft.jtitle=IEEE+communications+letters&rft.au=Zhang%2C+Guoqiang&rft.au=Heusdens%2C+Richard&rft.au=Kleijn%2C+W.+Bastiaan&rft.date=2013-11-01&rft.issn=1089-7798&rft.volume=17&rft.issue=11&rft.spage=2152&rft.epage=2155&rft_id=info:doi/10.1109%2FLCOMM.2013.101413.130826&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LCOMM_2013_101413_130826
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon