Nonlinear programming approaches to decoding low-density parity-check codes

We consider the decoding problem for low-density parity-check codes, and apply nonlinear programming methods. This extends previous work using linear programming (LP) to decode linear block codes. First, a multistage LP decoder based on the branch-and-bound method is proposed. This decoder makes use...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications Vol. 24; no. 8; pp. 1603 - 1613
Main Authors: Kai Yang, Feldman, J., Xiaodong Wang
Format: Journal Article
Language:English
Published: New York IEEE 01.08.2006
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Algorithms
Belief propagation
Block codes
Branch-and-bound
Codes
Computational complexity
Convergence
Decoders
Decoding
integer programming
Iterative algorithms
Iterative decoding
linear codes
Linear programming
linear programming (LP) decoding
low-density parity-check (LDPC) codes
Maximum likelihood decoding
Multistage
Nonlinear programming
Parity check codes
Quadratic programming
Serials
Studies
ISSN:0733-8716, 1558-0008
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We consider the decoding problem for low-density parity-check codes, and apply nonlinear programming methods. This extends previous work using linear programming (LP) to decode linear block codes. First, a multistage LP decoder based on the branch-and-bound method is proposed. This decoder makes use of the maximum-likelihood-certificate property of the LP decoder to refine the results when an error is reported. Second, we transform the original LP decoding formulation into a box-constrained quadratic programming form. Efficient linear-time parallel and serial decoding algorithms are proposed and their convergence properties are investigated. Extensive simulation studies are performed to assess the performance of the proposed decoders. It is seen that the proposed multistage LP decoder outperforms the conventional sum-product (SP) decoder considerably for low-density parity-check (LDPC) codes with short to medium block length. The proposed box-constrained quadratic programming decoder has less complexity than the SP decoder and yields much better performance for LDPC codes with regular structure
AbstractList We consider the decoding problem for low-density parity-check codes, and apply nonlinear programming methods. This extends previous work using linear programming (LP) to decode linear block codes. First, a multistage LP decoder based on the branch-and-bound method is proposed. This decoder makes use of the maximum-likelihood-certificate property of the LP decoder to refine the results when an error is reported. Second, we transform the original LP decoding formulation into a box-constrained quadratic programming form. Efficient linear-time parallel and serial decoding algorithms are proposed and their convergence properties are investigated. Extensive simulation studies are performed to assess the performance of the proposed decoders. It is seen that the proposed multistage LP decoder outperforms the conventional sum-product (SP) decoder considerably for low-density parity-check (LDPC) codes with short to medium block length. The proposed box-constrained quadratic programming decoder has less complexity than the SP decoder and yields much better performance for LDPC codes with regular structure
[...] we transform the original LP decoding formulation into a box-constrained quadratic programming form.
Author Kai Yang
Xiaodong Wang
Feldman, J.
Author_xml – sequence: 1
  surname: Kai Yang
  fullname: Kai Yang
  organization: Dept. of Ind. Eng. & Oper. Res., Columbia Univ., New York, NY
– sequence: 2
  givenname: J.
  surname: Feldman
  fullname: Feldman, J.
– sequence: 3
  surname: Xiaodong Wang
  fullname: Xiaodong Wang
BookMark eNp9kM1LAzEQxYNUsH7cBS-LF09bJ8ludvZYit9FD_YestlsTd0mNdki_vemVBA8eHrMzO8Nj3dMRs47Q8g5hQmlUF8_vk5nEwYgJljVBZQHZEzLEnMAwBEZQ8V5jhUVR-Q4xhUALQpkY_L07F1vnVEh2wS_DGq9tm6ZqU2alH4zMRt81hrt29269595a1y0w1e2USFJnhj9nqW7iafksFN9NGc_ekIWtzeL2X0-f7l7mE3nueaIQ84KTTk2HWuxYk3bgALBFRZVKxBBs1p0HUeqi5LqFnXF2qZgBhrEmupO8RNytX-bIn5sTRzk2kZt-l4547dRYi1oXYqKJfLyD7ny2-BSNomiFByqAhIk9pAOPsZgOqntoAbr3RCU7SUFuStY7gqWu4LlvuBkhD_GTbBrFb7-s1zsLdYY84sLUQLl_Bsbsogr
CODEN ISACEM
CitedBy_id crossref_primary_10_1109_TIT_2007_915712
crossref_primary_10_1002_ett_1184
crossref_primary_10_1109_TWC_2016_2613516
crossref_primary_10_1109_LCOMM_2016_2530706
crossref_primary_10_1109_TIT_2009_2023735
crossref_primary_10_1109_TIT_2013_2281372
crossref_primary_10_3103_S0735272713020015
crossref_primary_10_1109_JSAC_2020_3005491
crossref_primary_10_1007_s10898_021_01073_4
crossref_primary_10_1049_iet_com_2009_0094
crossref_primary_10_20535_S0021347013020015
crossref_primary_10_1109_TIT_2009_2030477
crossref_primary_10_1109_TIT_2012_2211859
crossref_primary_10_1109_TCOMM_2010_102910_090490
crossref_primary_10_1109_TIT_2010_2048489
crossref_primary_10_1109_TIT_2012_2202211
crossref_primary_10_1007_s10898_011_9816_9
crossref_primary_10_1109_TCOMM_2011_122110_090729
crossref_primary_10_1109_TWC_2018_2864996
crossref_primary_10_1109_TIT_2012_2191697
crossref_primary_10_1109_LCOMM_2007_061780
crossref_primary_10_1109_TCOMM_2013_070213_120801
Cites_doi 10.1109/TIT.1962.1057683
10.1109/18.651072
10.1109/TCOMM.2004.841982
10.1109/TIT.2004.842696
10.1109/18.910577
10.1109/LCOMM.2004.825737
10.1109/26.539767
10.1109/TIT.2005.856938
10.1109/26.939851
10.1109/18.910572
10.1109/18.910578
10.1109/ISIT.2004.1365380
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
F28
FR3
DOI 10.1109/JSAC.2006.879405
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Xplore
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Engineering Research Database

Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-0008
EndPage 1613
ExternalDocumentID 2342218161
10_1109_JSAC_2006_879405
1665013
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
41~
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
ADRHT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IBMZZ
ICLAB
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
TN5
VH1
AAYXX
CITATION
7SP
8FD
L7M
F28
FR3
ID FETCH-LOGICAL-c388t-24c138bf2d872bdb0a063a847d6880c296ff381c451cd8c72db42e0b8891cfa3
IEDL.DBID RIE
ISICitedReferencesCount 29
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000239552800017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0733-8716
IngestDate Sun Sep 28 09:35:20 EDT 2025
Sun Nov 09 06:34:56 EST 2025
Sat Nov 29 05:32:23 EST 2025
Tue Nov 18 21:39:25 EST 2025
Wed Aug 27 02:47:44 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 8
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c388t-24c138bf2d872bdb0a063a847d6880c296ff381c451cd8c72db42e0b8891cfa3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
PQID 865630740
PQPubID 85481
PageCount 11
ParticipantIDs ieee_primary_1665013
proquest_journals_865630740
crossref_citationtrail_10_1109_JSAC_2006_879405
crossref_primary_10_1109_JSAC_2006_879405
proquest_miscellaneous_896195672
PublicationCentury 2000
PublicationDate 2006-08-01
PublicationDateYYYYMMDD 2006-08-01
PublicationDate_xml – month: 08
  year: 2006
  text: 2006-08-01
  day: 01
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE journal on selected areas in communications
PublicationTitleAbbrev J-SAC
PublicationYear 2006
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References vontobel (ref10) 2004
ref12
ref23
bertsimas (ref13) 1997
ref14
ref2
ref1
ref17
ref16
ref19
ref18
feldman (ref6) 2003
ref8
bertsimas (ref20) 1997
pearl (ref11) 1988
ref4
ref3
ref5
strang (ref21) 1998
feldman (ref7) 2002
(ref22) 0
nik (ref15) 2004; 50
koetter (ref9) 2003
References_xml – year: 1997
  ident: ref20
  publication-title: Parallel and Distributed Computation Numerical Methods
– year: 1998
  ident: ref21
  publication-title: Introduction to Linear Algebra
– ident: ref2
  doi: 10.1109/TIT.1962.1057683
– ident: ref14
  doi: 10.1109/18.651072
– ident: ref17
  doi: 10.1109/TCOMM.2004.841982
– ident: ref8
  doi: 10.1109/TIT.2004.842696
– year: 0
  ident: ref22
– start-page: 991
  year: 2004
  ident: ref10
  article-title: On the relationship between linear programming decoding and min-sum algorithm decoding
  publication-title: Proc Int Symp Inf Theory Appl
– ident: ref4
  doi: 10.1109/18.910577
– ident: ref18
  doi: 10.1109/LCOMM.2004.825737
– ident: ref1
  doi: 10.1109/26.539767
– year: 1988
  ident: ref11
  publication-title: Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference
– volume: 50
  year: 2004
  ident: ref15
  article-title: On decoding oflow-density parity-check codes over the binary erasure channel
  publication-title: IEEE Trans Inf Theory
– ident: ref16
  doi: 10.1109/TIT.2005.856938
– ident: ref23
  doi: 10.1109/26.939851
– ident: ref5
  doi: 10.1109/18.910572
– start-page: 75
  year: 2003
  ident: ref9
  article-title: Graph-covers and iterative decoding of finite length codes
  publication-title: Proc 3rd Int Symp Turbo Codes
– year: 1997
  ident: ref13
  publication-title: Introduction to Linear Optimization
– ident: ref3
  doi: 10.1109/18.910578
– ident: ref12
  doi: 10.1109/ISIT.2004.1365380
– ident: ref19
  doi: 10.1109/TIT.2004.842696
– year: 2003
  ident: ref6
  publication-title: Decoding error-correcting codes via linear programming
– year: 2002
  ident: ref7
  article-title: Using linear programming-based decoding of turbo-like codes and its relation to iterative approaches
  publication-title: Proc 40th Annu Allerton Conf Commun Control Comput
SSID ssj0014482
Score 2.0182507
Snippet We consider the decoding problem for low-density parity-check codes, and apply nonlinear programming methods. This extends previous work using linear...
[...] we transform the original LP decoding formulation into a box-constrained quadratic programming form.
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1603
SubjectTerms Algorithm design and analysis
Algorithms
Belief propagation
Block codes
Branch-and-bound
Codes
Computational complexity
Convergence
Decoders
Decoding
integer programming
Iterative algorithms
Iterative decoding
linear codes
Linear programming
linear programming (LP) decoding
low-density parity-check (LDPC) codes
Maximum likelihood decoding
Multistage
Nonlinear programming
Parity check codes
Quadratic programming
Serials
Studies
Title Nonlinear programming approaches to decoding low-density parity-check codes
URI https://ieeexplore.ieee.org/document/1665013
https://www.proquest.com/docview/865630740
https://www.proquest.com/docview/896195672
Volume 24
WOSCitedRecordID wos000239552800017&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 Xplore
  customDbUrl:
  eissn: 1558-0008
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014482
  issn: 0733-8716
  databaseCode: RIE
  dateStart: 19830101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB6qeNCDb7G-2IMXwbVpNt3HsYgiKkVQxFvYzG5A1EbaVPHfu5OkVVAEbyGZhDCTzczszHwfwKFBDJbOkUdJJnnitOTWo-fKichiCIl1haV3f60GA_3wYG5acDybhfHeV81n_oQOq1q-K3BCW2WdrgzxBFHUzikl61mtWcUgpBlVxUAJwSkJmJYkI9O5vO2f1mUHHb4-Iqr75oIqTpUfP-LKu5yv_O-9VmG5iSJZvzb7GrT8cB2WvmELbsDVoAbBsCPW9GC9hPNsiiHux6wsmAvJJzkv9ly8c0e97OUHI17C8oMHGXxiNPI-3oS787O70wveMCdwFFqXPE6wK3SWx06rOHNZZEMkYoMjcjKsV4yNzPPgqjHpdQkbQMUuS2IfZVqbLuZWbMH8sBj6bWBG-WCx2KIVIukRUg0K1CrzCeFQGduGzlSXKTao4kRu8ZxW2UVkUtI-kV3KtNZ-G45md7zWiBp_yG6Qtr_kakW3YXdqrrRZcuNUS4I6U0nUBja7GtYKFUDs0BeTIGIkjUeqeOf35-7CYr3DQv19ezBfjiZ-HxbwrXwcjw6q7-0TKHjS-w
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS9xAEB9EBe2D9ZNe_doHX4RuL7e7l919FKlYPQ_Bo_gWNrMbEO2l3OVa_O-7k-ROwSL0LSSTEGaymZmdmd8P4MQiRksXyBOVp1x5k3IXMHDtZeIwhsSmxtL7MdDDobm_t7dL8GUxCxNCqJvPwlc6rGv5vsQZbZV1e2mMJ4iidqWvlEiaaa1FzSAmGnXNQEvJKQ2YFyUT2726OztvCg8mfn9EVffKCdWsKm9-xbV_ufj4f2-2CRttHMnOGsNvwVIYb8OHV-iCO3A9bGAw3IS1XVg_43k2RxEPU1aVzMf0k9wXeyr_cE_d7NUzI2bC6plHGXxkNPQ-3YXRxbfR-SVvuRM4SmMqLhT2pMkL4Y0Wuc8TF2MRF12RT-OKRWHToojOGlW_R-gAWvhciZDkxtgeFk7uwfK4HIdPwKwO0WbCoZNS9QmrBiUanQdFSFTWdaA712WGLa440Vs8ZXV-kdiMtE90l2nWaL8Dp4s7fjWYGu_I7pC2X-QaRXdgf26urF1008ykBHamVdIBtrgaVwuVQNw4lLMoYlMakNTi87-fewxrl6ObQTb4Przeh_Vmv4W6_Q5guZrMwiGs4u_qYTo5qr-9v0np1kI
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=Nonlinear+programming+approaches+to+decoding+low-density+parity-check+codes&rft.jtitle=IEEE+journal+on+selected+areas+in+communications&rft.au=Kai+Yang&rft.au=Feldman%2C+J.&rft.au=Xiaodong+Wang&rft.date=2006-08-01&rft.issn=0733-8716&rft.volume=24&rft.issue=8&rft.spage=1603&rft.epage=1613&rft_id=info:doi/10.1109%2FJSAC.2006.879405&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_JSAC_2006_879405
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0733-8716&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0733-8716&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0733-8716&client=summon