A Threshold-Based Min-Sum Algorithm to Lower the Error Floors of Quantized LDPC Decoders
For decoding low-density parity-check (LDPC) codes, the attenuated min-sum algorithm (AMSA) and the offset min-sum algorithm (OMSA) can outperform the conventional min-sum algorithm (MSA) at low signal-to-noise-ratios (SNRs), i.e. , in the "waterfall region" of the bit error rate curve. Th...
Saved in:
| Published in | IEEE transactions on communications Vol. 68; no. 4; pp. 2005 - 2015 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
IEEE
01.04.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0090-6778 1558-0857 |
| DOI | 10.1109/TCOMM.2020.2969902 |
Cover
| Abstract | For decoding low-density parity-check (LDPC) codes, the attenuated min-sum algorithm (AMSA) and the offset min-sum algorithm (OMSA) can outperform the conventional min-sum algorithm (MSA) at low signal-to-noise-ratios (SNRs), i.e. , in the "waterfall region" of the bit error rate curve. This paper demonstrates that, for quantized decoders, MSA actually outperforms AMSA and OMSA in the "error floor" region, and that all three algorithms suffer from a relatively high error floor. This motivates the introduction of a modified MSA that is designed to outperform MSA, AMSA, and OMSA across all SNRs. The new algorithm is based on the assumption that trapping sets are the major cause of the error floor for quantized LDPC decoders. A performance estimation tool based on trapping sets is used to verify the effectiveness of the new algorithm and also to guide parameter selection. We also show that the implementation complexity of the new algorithm is only slightly higher than that of AMSA or OMSA. Finally, the simulated performance of the new algorithm, using several classes of LDPC codes (including spatially coupled LDPC codes), is shown to outperform MSA, AMSA, and OMSA across all SNRs. |
|---|---|
| AbstractList | For decoding low-density parity-check (LDPC) codes, the attenuated min-sum algorithm (AMSA) and the offset min-sum algorithm (OMSA) can outperform the conventional min-sum algorithm (MSA) at low signal-to-noise-ratios (SNRs), i.e. , in the “waterfall region” of the bit error rate curve. This paper demonstrates that, for quantized decoders, MSA actually outperforms AMSA and OMSA in the “error floor” region, and that all three algorithms suffer from a relatively high error floor. This motivates the introduction of a modified MSA that is designed to outperform MSA, AMSA, and OMSA across all SNRs. The new algorithm is based on the assumption that trapping sets are the major cause of the error floor for quantized LDPC decoders. A performance estimation tool based on trapping sets is used to verify the effectiveness of the new algorithm and also to guide parameter selection. We also show that the implementation complexity of the new algorithm is only slightly higher than that of AMSA or OMSA. Finally, the simulated performance of the new algorithm, using several classes of LDPC codes (including spatially coupled LDPC codes), is shown to outperform MSA, AMSA, and OMSA across all SNRs. |
| Author | Hatami, Homayoon Costello, Daniel J. Fuja, Thomas E. Mitchell, David G. M. |
| Author_xml | – sequence: 1 givenname: Homayoon orcidid: 0000-0001-6217-3415 surname: Hatami fullname: Hatami, Homayoon email: hhatami@nd.edu organization: Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA – sequence: 2 givenname: David G. M. orcidid: 0000-0002-3544-9225 surname: Mitchell fullname: Mitchell, David G. M. email: dgmm@nmsu.edu organization: Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA – sequence: 3 givenname: Daniel J. orcidid: 0000-0002-4387-116X surname: Costello fullname: Costello, Daniel J. email: costello.2@nd.edu organization: Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA – sequence: 4 givenname: Thomas E. orcidid: 0000-0003-0026-8499 surname: Fuja fullname: Fuja, Thomas E. email: tfuja@nd.edu organization: Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA |
| BookMark | eNp9kMtOwzAQRS1UJNrCD8DGEusUP-IkXpY-AClVQRSJXeTGE5IqjYvtCMHXk9KKBQs2cxdzz4x0BqjXmAYQuqRkRCmRN6vJcrEYMcLIiMlISsJOUJ8KkQQkEXEP9QmRJIjiODlDA-c2hJCQcN5Hr2O8Ki240tQ6uFUONF5UTfDcbvG4fjO28uUWe4NT8wEW-xLwzFpj8bw2xjpsCvzUqsZXXx2YTh8neAq50WDdOTotVO3g4phD9DKfrSb3Qbq8e5iM0yBnUviAFXTNRUiFjKMoF5DzEBRnDAoIC81DrXW31KoQWqh1N3lURKCoWIchVSD5EF0f7u6seW_B-WxjWtt0LzPGJWUilhHvWsmhlVvjnIUiyyuvfGUab1VVZ5Rke4_Zj8ds7zE7euxQ9gfd2Wqr7Of_0NUBqgDgF0hkTIQI-TdGNoAp |
| CODEN | IECMBT |
| CitedBy_id | crossref_primary_10_1109_TCOMM_2022_3212747 crossref_primary_10_1109_TIT_2021_3099020 crossref_primary_10_3390_electronics11172717 crossref_primary_10_1109_JSAC_2025_3531553 crossref_primary_10_1109_TCOMM_2020_3028302 crossref_primary_10_1109_TCSII_2020_3001601 crossref_primary_10_1016_j_dcan_2022_11_013 crossref_primary_10_1109_LCOMM_2021_3078796 crossref_primary_10_3390_s23187828 crossref_primary_10_1007_s11831_020_09466_6 crossref_primary_10_1109_OJCOMS_2020_3040003 |
| Cites_doi | 10.1109/TIT.2009.2034781 10.1109/TIT.2014.2363832 10.1109/TCSI.2014.2304660 10.1109/TIT.2006.887060 10.1109/18.782171 10.1109/TIT.2012.2211995 10.1109/TCOMM.2009.06.070325 10.1109/SIPS.2004.1363033 10.1109/TIT.2011.2177439 10.1109/LCOMM.2016.2517142 10.1109/ISCAS.2006.1692544 10.1109/TCOMM.2005.852852 10.1109/ICU.2006.281527 10.1109/CHINACOM.2008.4685176 10.1109/TIT.2004.838370 10.1109/18.910572 10.1109/TCOMM.2012.042712.100672 10.1109/ACSSC.2008.5074756 10.1109/TCSI.2009.2016171 10.1109/TCOMM.2012.122112.110805 10.1109/JSSC.2010.2042255 10.1109/TIT.2014.2334657 10.1109/TCOMM.2019.2953232 10.1109/MCOM.2014.6852099 10.1109/TCOMM.2007.900611 10.1109/TCSI.2008.924892 10.1109/TIT.1962.1057683 10.1109/26.768759 10.1109/TCOMM.2013.071813.120659 10.1109/LCOMM.2006.1603377 10.1109/TCOMM.2004.836563 10.1109/LCOMM.2013.111113.131881 10.1109/JSAC.2009.090809 10.1109/TCOMM.2013.112313.120917 10.1109/LCOMM.2010.07.100508 10.1109/ISIT.2012.6284049 10.1109/TCSI.2009.2018915 10.1109/ISIT.2018.8437710 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M |
| DOI | 10.1109/TCOMM.2020.2969902 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef 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://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-0857 |
| EndPage | 2015 |
| ExternalDocumentID | 10_1109_TCOMM_2020_2969902 8970554 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Science Foundation grantid: ECCS-1710920; OIA-1757207 funderid: 10.13039/501100008982 |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 ZCA ZCG AAYXX CITATION 7SP 8FD L7M |
| ID | FETCH-LOGICAL-c295t-2f1b354159766c5ec34ea322efe4fd34ddd415daf5d5abf5d36f6ea15b441ae93 |
| IEDL.DBID | RIE |
| ISSN | 0090-6778 |
| IngestDate | Mon Jun 30 10:12:58 EDT 2025 Wed Oct 01 03:32:25 EDT 2025 Thu Apr 24 23:12:22 EDT 2025 Wed Aug 27 02:35:26 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c295t-2f1b354159766c5ec34ea322efe4fd34ddd415daf5d5abf5d36f6ea15b441ae93 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-6217-3415 0000-0002-4387-116X 0000-0003-0026-8499 0000-0002-3544-9225 |
| PQID | 2391257963 |
| PQPubID | 85472 |
| PageCount | 11 |
| ParticipantIDs | crossref_citationtrail_10_1109_TCOMM_2020_2969902 proquest_journals_2391257963 ieee_primary_8970554 crossref_primary_10_1109_TCOMM_2020_2969902 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2020-04-01 |
| PublicationDateYYYYMMDD | 2020-04-01 |
| PublicationDate_xml | – month: 04 year: 2020 text: 2020-04-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on communications |
| PublicationTitleAbbrev | TCOMM |
| PublicationYear | 2020 |
| 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 | mackay (ref37) 2020 ref35 ref13 ref34 ref12 ref15 ref31 ref30 ref33 ref32 ref10 ref2 ref1 ref39 ref17 ref38 ref16 ref19 ref18 ref24 ref23 xu (ref6) 2010; 3 ref26 ref25 ref20 ref42 ref41 ref22 sun (ref21) 2004 wey (ref36) 2008; 55 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref5 richardson (ref14) 2003 ref40 oh (ref11) 2010; 57 |
| References_xml | – ident: ref17 doi: 10.1109/TIT.2009.2034781 – ident: ref20 doi: 10.1109/TIT.2014.2363832 – ident: ref28 doi: 10.1109/TCSI.2014.2304660 – ident: ref15 doi: 10.1109/TIT.2006.887060 – ident: ref35 doi: 10.1109/18.782171 – ident: ref42 doi: 10.1109/TIT.2012.2211995 – ident: ref33 doi: 10.1109/TCOMM.2009.06.070325 – ident: ref39 doi: 10.1109/SIPS.2004.1363033 – ident: ref41 doi: 10.1109/TIT.2011.2177439 – ident: ref29 doi: 10.1109/LCOMM.2016.2517142 – ident: ref27 doi: 10.1109/ISCAS.2006.1692544 – ident: ref4 doi: 10.1109/TCOMM.2005.852852 – ident: ref8 doi: 10.1109/ICU.2006.281527 – ident: ref7 doi: 10.1109/CHINACOM.2008.4685176 – ident: ref38 doi: 10.1109/TIT.2004.838370 – ident: ref3 doi: 10.1109/18.910572 – ident: ref31 doi: 10.1109/TCOMM.2012.042712.100672 – ident: ref10 doi: 10.1109/ACSSC.2008.5074756 – volume: 57 start-page: 105 year: 2010 ident: ref11 article-title: Min-sum decoder architectures with reduced word length for LDPC codes publication-title: IEEE Trans Circuits Syst I Reg Papers doi: 10.1109/TCSI.2009.2016171 – ident: ref23 doi: 10.1109/TCOMM.2012.122112.110805 – ident: ref34 doi: 10.1109/JSSC.2010.2042255 – volume: 3 start-page: 19 year: 2010 ident: ref6 article-title: A modified offset min-sum decoding algorithm for LDPC codes publication-title: Proc 3rd Int Conf Comput Sci Inf Technol – start-page: 1701 year: 2004 ident: ref21 article-title: Analysis of trapping sets for LDPC codes using a linear system model publication-title: Proc 42nd Annu Allerton Conf – ident: ref16 doi: 10.1109/TIT.2014.2334657 – ident: ref18 doi: 10.1109/TCOMM.2019.2953232 – year: 2020 ident: ref37 publication-title: Encyclopedia of Sparse Graph Codes – ident: ref40 doi: 10.1109/MCOM.2014.6852099 – ident: ref32 doi: 10.1109/TCOMM.2007.900611 – volume: 55 start-page: 3430 year: 2008 ident: ref36 article-title: Algorithms of finding the first two minimum values and their hardware implementation publication-title: IEEE Trans Circuits Syst I Reg Papers doi: 10.1109/TCSI.2008.924892 – ident: ref1 doi: 10.1109/TIT.1962.1057683 – ident: ref2 doi: 10.1109/26.768759 – ident: ref22 doi: 10.1109/TCOMM.2013.071813.120659 – ident: ref12 doi: 10.1109/LCOMM.2006.1603377 – ident: ref5 doi: 10.1109/TCOMM.2004.836563 – ident: ref26 doi: 10.1109/LCOMM.2013.111113.131881 – ident: ref19 doi: 10.1109/JSAC.2009.090809 – ident: ref25 doi: 10.1109/TCOMM.2013.112313.120917 – ident: ref13 doi: 10.1109/LCOMM.2010.07.100508 – ident: ref9 doi: 10.1109/ISIT.2012.6284049 – ident: ref30 doi: 10.1109/TCSI.2009.2018915 – start-page: 1426 year: 2003 ident: ref14 article-title: Error floors of LDPC codes publication-title: Proc 41st Annu Allerton Conf Commun Control Comput – ident: ref24 doi: 10.1109/ISIT.2018.8437710 |
| SSID | ssj0004033 |
| Score | 2.4105284 |
| Snippet | For decoding low-density parity-check (LDPC) codes, the attenuated min-sum algorithm (AMSA) and the offset min-sum algorithm (OMSA) can outperform the... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2005 |
| SubjectTerms | absorbing sets Algorithms Binary system Bit error rate Codes Complexity theory Computer simulation decoder quantization Decoders Decoding Error correcting codes error floors Floors Iterative decoding LDPC codes Low density parity check codes Maximum likelihood decoding min-sum decoding Signal to noise ratio Trapping trapping sets Waterfalls |
| Title | A Threshold-Based Min-Sum Algorithm to Lower the Error Floors of Quantized LDPC Decoders |
| URI | https://ieeexplore.ieee.org/document/8970554 https://www.proquest.com/docview/2391257963 |
| Volume | 68 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0857 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004033 issn: 0090-6778 databaseCode: RIE dateStart: 19720101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8MwDLaAExx4DcR4KQdukK1r2q45jsE0IcpDbNJuVZsHTIwVde2FX4_TduMpxKWq1KSK7MT-ktifAU5MomsktaYW8xV1pG5TbsWcai44k8qxdEGlFNx4_aFzNXJHS3C2yIVRShXBZ6phXou7fJmI3ByVNX1uuF-cZVhu-16Zq_WRA2mxinHShLO3_XmCjMWbg-5tEOBW0LYaNvfQ_NpfnFBRVeWHKS78S28DgvnIyrCS50aexQ3x9o208b9D34T1CmiSTjkztmBJTbdh7RP9YA1GHTJAVc7MDRQ9R3cmSTCe0of8hXQmj0k6zp5eSJaQa1NJjSBSJJdpmqSkN0mSdEYSTe5zVMz4DTteX9x1yYUyGfLpbAeGvctBt0-rSgtU2NzNqK1bMXPRlyM48YSrBHNUhEtdaeVoyRwpJX6UkXalG8X4ZJ72VNRyY0RTkeJsF1amyVTtAWnFAjddhrQGgYNm0mfCVDQx95doOiJWh9Zc9KGoaMhNNYxJWGxHLB4W6gqNusJKXXU4XfR5LUk4_mxdM_JftKxEX4fDuYbDap3OQptxRHhttEL7v_c6gFXz7zJW5xBWsjRXRwhDsvi4mH_vvsXXEg |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fT9swED4xeGA8bGNsosCGH3gbLmlsp_VjKVQFGgZakfoWJf4xKtoGpckLf_3OSdptMKG9RJFiK9adfffZvvsO4MglusbaWuqxjqFc2zaVXiKplUoybbhnSyql8DoY3PHLsRivwfEqF8YYUwafmaZ7Le_ydaoKd1R20pGO-4W_gQ3BORdVttbvLEiP1ZyTLqC93VmmyHjyZNT7Hoa4GfS9pi8DNMD-X26orKvywhiXHqb_HsLl2KrAkodmkSdN9fSMtvF_B_8B3tVQk3SrubENa2b-Ebb-ICDcgXGXjFCZC3cHRU_RoWkSTub0RzEj3enPNJvk9zOSp2ToaqkRxIrkPMvSjPSnaZotSGrJbYGqmTxhx-HZTY-cGZcjny0-wV3_fNQb0LrWAlW-FDn1bSthAr05wpNACaMYNzEudmMNt5pxrTV-1LEVWsQJPllgAxO3RIJ4KjaSfYb1eTo3u0BaicJtl6OtQehgme4w5WqauBtMNB4xa0BrKfpI1UTkrh7GNCo3JJ6MSnVFTl1Rra4GfFv1eaxoOF5tvePkv2pZi74BB0sNR_VKXUQ-k4jx2miH9v7d6xA2B6NwGA0vrq_24a37TxW5cwDreVaYLwhK8uRrORd_AS422l8 |
| 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=A+Threshold-Based+Min-Sum+Algorithm+to+Lower+the+Error+Floors+of+Quantized+LDPC+Decoders&rft.jtitle=IEEE+transactions+on+communications&rft.au=Hatami%2C+Homayoon&rft.au=Mitchell%2C+David+G.+M.&rft.au=Costello%2C+Daniel+J.&rft.au=Fuja%2C+Thomas+E.&rft.date=2020-04-01&rft.pub=IEEE&rft.issn=0090-6778&rft.volume=68&rft.issue=4&rft.spage=2005&rft.epage=2015&rft_id=info:doi/10.1109%2FTCOMM.2020.2969902&rft.externalDocID=8970554 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon |