Channel-Aware Gradient Descent Bit-Flipping Algorithm for LDPC Codes
The gradient descent bit-flipping with momentum (GDBF-w/M) and probabilistic GDBF-w/M (PGDBF-w/M) algorithms significantly improve the decoding performance of the bit-flipping (BF) algorithm. In this letter, we propose a channel-aware GDBF-w/M algorithm which operates deterministically based on the...
Saved in:
| Published in: | IEEE communications letters Vol. 29; no. 4; pp. 809 - 813 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.04.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 1089-7798, 1558-2558 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The gradient descent bit-flipping with momentum (GDBF-w/M) and probabilistic GDBF-w/M (PGDBF-w/M) algorithms significantly improve the decoding performance of the bit-flipping (BF) algorithm. In this letter, we propose a channel-aware GDBF-w/M algorithm which operates deterministically based on the received values from the additive white Gaussian noise (AWGN) channel. Numerical results show that the proposed algorithm does not only mitigate the error-floor phenomenon of the GDBF-w/M algorithm, but it also has better decoding performance than the PGDBF-w/M algorithm without the need for a random number generator. Furthermore, the complexity of the proposed algorithm is slightly higher than that of the GDBF-w/M algorithm. |
|---|---|
| AbstractList | The gradient descent bit-flipping with momentum (GDBF-w/M) and probabilistic GDBF-w/M (PGDBF-w/M) algorithms significantly improve the decoding performance of the bit-flipping (BF) algorithm. In this letter, we propose a channel-aware GDBF-w/M algorithm which operates deterministically based on the received values from the additive white Gaussian noise (AWGN) channel. Numerical results show that the proposed algorithm does not only mitigate the error-floor phenomenon of the GDBF-w/M algorithm, but it also has better decoding performance than the PGDBF-w/M algorithm without the need for a random number generator. Furthermore, the complexity of the proposed algorithm is slightly higher than that of the GDBF-w/M algorithm. |
| Author | Min, Woohong Yang, Kyeongcheol |
| Author_xml | – sequence: 1 givenname: Woohong orcidid: 0009-0002-5049-9324 surname: Min fullname: Min, Woohong email: whmin@postech.ac.kr organization: Department of Electrical Engineering, Pohang University of Science and Technology (POSTECH), Pohang-si, Gyeongsangbuk-do, Republic of Korea – sequence: 2 givenname: Kyeongcheol orcidid: 0000-0001-8303-2304 surname: Yang fullname: Yang, Kyeongcheol email: kcyang@postech.ac.kr organization: Department of Electrical Engineering, Pohang University of Science and Technology (POSTECH), Pohang-si, Gyeongsangbuk-do, Republic of Korea |
| BookMark | eNpNkE9PAjEQxRuDiYB-AeNhE8-79s-WtkdcBE2W4EHPTSlTWLJ013aJ8du7CAfnMG8O781MfiM08I0HhO4JzgjB6qksVstlRjHlGeM5k0pcoSHhXKa0b4N-xlKlQih5g0Yx7jHGknIyRLNiZ7yHOp1-mwDJIphNBb5LZhDtSZ-rLp3XVdtWfptM620Tqm53SFwTknL2XiRFs4F4i66dqSPcXXSMPucvH8VrWq4Wb8W0TC3NVZca7Ki01jI8EVQqAwYsJ0Jg6YRihG1UbiecrBkHLqxYr520LjfWMDthyhk2Ro_nvW1ovo4QO71vjsH3JzUjsi-qGO9d9OyyoYkxgNNtqA4m_GiC9YmW_qOlT7T0hVYfejiHKgD4F5Cq_1WwX0cEZwk |
| CODEN | ICLEF6 |
| Cites_doi | 10.1109/TCOMM.2010.06.090046 10.1109/LCOMM.2014.2344031 10.1016/0041-5553(64)90137-5 10.1109/26.768759 10.1109/18.910577 10.1109/ICC.2019.8761536 10.1109/TIT.1962.1057683 10.1109/ISTC49272.2021.9594128 10.1109/ieeestd.2006.231802 10.1109/18.748992 10.1109/LCOMM.2005.1506712 10.1109/18.959255 10.1109/LCOMM.2022.3195026 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M |
| DOI | 10.1109/LCOMM.2025.3543897 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore 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/IET Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-2558 |
| EndPage | 813 |
| ExternalDocumentID | 10_1109_LCOMM_2025_3543897 10896727 |
| 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 7SP 8FD L7M |
| ID | FETCH-LOGICAL-c249t-a0f28ccc3067289aeaec517708f79313d94c651b35e57c7bbf8cf4aca3c639fa3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001465468900028&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 | Tue Jul 22 15:13:12 EDT 2025 Sat Nov 29 08:00:50 EST 2025 Wed Aug 27 02:04:39 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-c249t-a0f28ccc3067289aeaec517708f79313d94c651b35e57c7bbf8cf4aca3c639fa3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0009-0002-5049-9324 0000-0001-8303-2304 |
| PQID | 3188882935 |
| PQPubID | 85419 |
| PageCount | 5 |
| ParticipantIDs | crossref_primary_10_1109_LCOMM_2025_3543897 ieee_primary_10896727 proquest_journals_3188882935 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-04-01 |
| PublicationDateYYYYMMDD | 2025-04-01 |
| PublicationDate_xml | – month: 04 year: 2025 text: 2025-04-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE communications letters |
| PublicationTitleAbbrev | LCOMM |
| PublicationYear | 2025 |
| 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 | ref13 ref14 Nesterov (ref12) 1983; 27 ref11 ref10 ref2 Savin (ref15) 2022 ref1 ref16 ref7 ref9 ref4 ref3 ref6 ref5 Cauchy (ref8) 1847; 25 |
| References_xml | – ident: ref9 doi: 10.1109/TCOMM.2010.06.090046 – ident: ref13 doi: 10.1109/LCOMM.2014.2344031 – ident: ref11 doi: 10.1016/0041-5553(64)90137-5 – volume: 27 start-page: 367 issue: 2 year: 1983 ident: ref12 article-title: A method for solving a convex programming problem with convergence rate O(1/k2) publication-title: Sov. Math. Doklady – ident: ref4 doi: 10.1109/26.768759 – ident: ref2 doi: 10.1109/18.910577 – ident: ref5 doi: 10.1109/ICC.2019.8761536 – ident: ref1 doi: 10.1109/TIT.1962.1057683 – ident: ref10 doi: 10.1109/ISTC49272.2021.9594128 – ident: ref16 doi: 10.1109/ieeestd.2006.231802 – ident: ref3 doi: 10.1109/18.748992 – ident: ref7 doi: 10.1109/LCOMM.2005.1506712 – ident: ref6 doi: 10.1109/18.959255 – ident: ref14 doi: 10.1109/LCOMM.2022.3195026 – volume: 25 start-page: 536 year: 1847 ident: ref8 article-title: Methode generale pour la resolution des systemes d equations simultanees publication-title: Comp. Rend. Acad. Sci. Paris – year: 2022 ident: ref15 article-title: Gradient descent bit-flipping decoding with momentum publication-title: arXiv:2204.02359 |
| SSID | ssj0008251 |
| Score | 2.4528341 |
| Snippet | The gradient descent bit-flipping with momentum (GDBF-w/M) and probabilistic GDBF-w/M (PGDBF-w/M) algorithms significantly improve the decoding performance of... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 809 |
| SubjectTerms | Algorithms AWGN channels bit-flipping algorithm Decoding decoding algorithms Indexes Iterative decoding LDPC codes Maximum likelihood decoding Optimization Probabilistic logic Random noise Random numbers Reliability Training Vectors |
| Title | Channel-Aware Gradient Descent Bit-Flipping Algorithm for LDPC Codes |
| URI | https://ieeexplore.ieee.org/document/10896727 https://www.proquest.com/docview/3188882935 |
| Volume | 29 |
| WOSCitedRecordID | wos001465468900028&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/IET 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/eLvHCXMwlV09T8MwFLSgYoCBzyIKBXlgQy5JE8f2WFIKQ1s6gNQt8ldKpZKgNIW_j-2kqAgxkMlDEkWXPPsufvceANeGErDQDwWKBA5Q6HOBKFUR0qmOaCSpDIlyzSbIeEynUzapzerOC6O1dslnumOHbi9f5XJlf5WZCKfM7hxug21CSGXW-p52rQezyqZnhjIyunbIeOx2GD-NRkYLdnEnwLbdN_mxCrm2Kr_mYrfADA7--WiHYL9mkrBXvfojsKWzY7C3UV_wBPStdyDTC9T75IWGD4XL7yphv6rhBO_mJRosXImGGewtZnkxL1_foOGxcNifxDDOlV42wcvg_jl-RHXbBCSNlioR99IulVJaMWDkFNdcS-wT4tHUBKMfKBbKCPsiwBoTSYRIqUxDLnkgDV1JeXAKGlme6TMAhU-46nopE9rIJkx4ijGNeBAqYkZctcDNGsbkvaqOkThV4bHEgZ5Y0JMa9BZoWuA2zqwwa4H2GvqkjqBlYuYacxgygs__uOwC7Nq7V2k0bdAoi5W-BDvyo5wviyv3cXwB7S-2XQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED1BQQIGvhHl0wMbMiSNHdtjaSlFtKVDkdgix3GgUmlRmsLfx3ZSVIQYyOQhUaKXnP1efO8O4MJQAkF8EuMwpgEmvowx50mIdapDHiquCEtcswnW6_HnZ9EvzerOC6O1dsln-soO3V5-MlEz-6vMRDgXdudwGVYoITW_sGt9T7zWhVnk0wtDGgWfe2Q8cd1pPHa7Rg3W6FVAbcNv9mMdco1Vfs3Gbolpbf3z4bZhs-SSqF68_B1Y0uNd2FioMLgHTeseGOsRrn_KTKO7zGV45ahZVHFCN8Mct0auSMMLqo9eJtkwf31DhsmiTrPfQI1Joqf78NS6HTTauGycgJVRUzmWXlrjSikrB4ygklpqRX3GPJ6acPSDRBAVUj8OqKZMsThOuUqJVDJQhrCkMjiAyngy1oeAYp_JpOalItZGOFEmU0p5KAOSMDOSSRUu5zBG70V9jMjpCk9EDvTIgh6VoFdh3wK3cGaBWRVO5tBHZQxNIzPbmMPQEXr0x2XnsNYedDtR5773cAzr9k5FUs0JVPJspk9hVX3kw2l25j6UL5kYuaQ |
| 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=Channel-Aware+Gradient+Descent+Bit-Flipping+Algorithm+for+LDPC+Codes&rft.jtitle=IEEE+communications+letters&rft.au=Woohong+Min&rft.au=Yang%2C+Kyeongcheol&rft.date=2025-04-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1089-7798&rft.eissn=1558-2558&rft.volume=29&rft.issue=4&rft.spage=809&rft_id=info:doi/10.1109%2FLCOMM.2025.3543897&rft.externalDBID=NO_FULL_TEXT |
| 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 |