Improving belief propagation on graphs with cycles
In this letter, we propose two modifications to belief propagation (BP) decoding algorithm. The modifications are based on reducing the reliability of messages throughout the iteration process, and are particularly effective for short low-density parity-check codes, where the existence of cycles mak...
Uložené v:
| Vydané v: | IEEE communications letters Ročník 8; číslo 1; s. 57 - 59 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
IEEE
01.01.2004
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| 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 | In this letter, we propose two modifications to belief propagation (BP) decoding algorithm. The modifications are based on reducing the reliability of messages throughout the iteration process, and are particularly effective for short low-density parity-check codes, where the existence of cycles makes the original BP algorithm perform suboptimal. The proposed algorithms, referred to as "normalized BP" and "offset BP," reduce the absolute value of the outgoing log-likelihood ratio messages at variable nodes by using a multiplicative factor and an additive factor, respectively. Simulation results show that both algorithms perform more or less the same, and both outperform BP in error performance. |
|---|---|
| AbstractList | In this letter, we propose two modifications to belief propagation (BP) decoding algorithm. The modifications are based on reducing the reliability of messages throughout the iteration process, and are particularly effective for short low-density parity-check codes, where the existence of cycles makes the original BP algorithm perform suboptimal. The proposed algorithms, referred to as "normalized BP" and "offset BP," reduce the absolute value of the outgoing log-likelihood ratio messages at variable nodes by using a multiplicative factor and an additive factor, respectively. Simulation results show that both algorithms perform more or less the same, and both outperform BP in error performance. |
| Author | Banihashemi, A.H. Yazdani, M.R. Hemati, S. |
| Author_xml | – sequence: 1 givenname: M.R. surname: Yazdani fullname: Yazdani, M.R. organization: Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada – sequence: 2 givenname: S. surname: Hemati fullname: Hemati, S. organization: Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada – sequence: 3 givenname: A.H. surname: Banihashemi fullname: Banihashemi, A.H. organization: Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15410241$$DView record in Pascal Francis |
| BookMark | eNp9kU1LAzEQhoMoWKs_QLwsgnramkl2N5OjFL-g4kXPIU2TNrLdrclW6b83bUWhh8KQycDzTmbynpDDpm0sIedABwBU3o6Gry8vA0YpHyBjhZQHpAdliTlLx2G6U5S5EBKPyUmMH5RSZCX0CHueL0L75ZtpNra1ty5L5UJPdefbJksxDXoxi9m372aZWZnaxlNy5HQd7dlv7pP3h_u34VM-en18Ht6NclMA63I5EXQieWW1m0g2LisxlkaCBjR2YkA4WxSu4EBLJ7h0EiUIjmMQwBwWouR9crPtmyb6XNrYqbmPxta1bmy7jAplBZg2ZYm83ksy5JjewARe7oAf7TI0aQuFyGWFlK-hq19IR6NrF3RjfFSL4Oc6rBSUBVBWQOLEljOhjTFYp4zvNv_WBe1rBVStrVEba9TaGrW1JilhR_nXfI_mYqvx1tp_nlUgWcV_ALcWmXU |
| CODEN | ICLEF6 |
| CitedBy_id | crossref_primary_10_1109_TCOMM_2012_042712_110108 crossref_primary_10_1109_TCOMM_2012_072412_110464 crossref_primary_10_1049_iet_com_20070257 crossref_primary_10_1109_TCOMM_2009_12_050230 crossref_primary_10_1109_TCOMM_2007_900611 crossref_primary_10_1002_dac_4765 crossref_primary_10_1109_TSP_2008_929337 crossref_primary_10_1109_TVLSI_2013_2293224 crossref_primary_10_1109_TCOMM_2004_838704 crossref_primary_10_1109_TQE_2021_3113936 crossref_primary_10_1109_TCOMM_2005_852852 crossref_primary_10_1049_iet_cds_2018_5102 crossref_primary_10_1109_TWC_2011_021611_101103 crossref_primary_10_1109_TCOMM_2017_2704125 crossref_primary_10_1109_LCOMM_2016_2517142 crossref_primary_10_1109_TIT_2012_2236916 crossref_primary_10_1109_COMST_2015_2436705 crossref_primary_10_1109_TCOMM_2009_08_070257 crossref_primary_10_1109_TCOMM_2009_09_070617 crossref_primary_10_1109_LCOMM_2015_2492965 crossref_primary_10_1049_iet_com_2013_0753 crossref_primary_10_1186_1687_1499_2013_60 crossref_primary_10_1109_TCSI_2018_2812779 crossref_primary_10_1007_s11767_005_0044_7 crossref_primary_10_1109_LCOMM_2007_070269 crossref_primary_10_1109_TCOMM_2005_861668 crossref_primary_10_1109_TSP_2008_929671 crossref_primary_10_1049_iet_cds_2019_0160 crossref_primary_10_1109_LCOMM_2010_07_100508 crossref_primary_10_1002_dac_3275 |
| Cites_doi | 10.1109/4234.957379 10.1109/TIT.2005.850085 10.1109/18.910594 10.1007/978-1-4613-0165-3_6 10.1109/TIT.1981.1056404 10.7551/mitpress/4347.001.0001 10.1109/49.924874 10.1109/26.848552 10.1109/4234.1001666 |
| ContentType | Journal Article |
| Copyright | 2004 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2004 |
| Copyright_xml | – notice: 2004 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2004 |
| DBID | RIA RIE AAYXX CITATION IQODW 7SP 8FD L7M F28 FR3 |
| DOI | 10.1109/LCOMM.2003.822499 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis 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 Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1558-2558 |
| EndPage | 59 |
| ExternalDocumentID | 2427553781 15410241 10_1109_LCOMM_2003_822499 1261926 |
| 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 IQODW RIG 7SP 8FD L7M F28 FR3 |
| ID | FETCH-LOGICAL-c412t-9d70d936eafd92b567b9c91a18cedc17fe44f43105f739f9891738b1712f84753 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 62 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000189190000020&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 | Thu Oct 02 06:27:50 EDT 2025 Sat Sep 27 21:41:30 EDT 2025 Fri Jul 25 06:47:28 EDT 2025 Mon Jul 21 09:13:39 EDT 2025 Sat Nov 29 08:07:57 EST 2025 Tue Nov 18 22:30:42 EST 2025 Wed Aug 27 02:48:15 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Performance evaluation iterative decoding low-density parity-check (LDPC) codes offset belief propagation Signal processing Iterative method message-passing decoding algorithms Decoding Bipartite graph Algorithm normalized belief propagation Belief propagation |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c412t-9d70d936eafd92b567b9c91a18cedc17fe44f43105f739f9891738b1712f84753 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| PQID | 883968038 |
| PQPubID | 23500 |
| PageCount | 3 |
| ParticipantIDs | crossref_citationtrail_10_1109_LCOMM_2003_822499 proquest_miscellaneous_28387398 crossref_primary_10_1109_LCOMM_2003_822499 pascalfrancis_primary_15410241 proquest_journals_883968038 proquest_miscellaneous_896184992 ieee_primary_1261926 |
| PublicationCentury | 2000 |
| PublicationDate | 2004-Jan. 2004-01-00 2004 20040101 |
| PublicationDateYYYYMMDD | 2004-01-01 |
| PublicationDate_xml | – month: 01 year: 2004 text: 2004-Jan. |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE communications letters |
| PublicationTitleAbbrev | COML |
| PublicationYear | 2004 |
| 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 | ref8 ref7 ref4 ref3 ref6 Fossorier (ref9) 2003 ref5 ref10 ref2 ref1 |
| References_xml | – ident: ref4 doi: 10.1109/4234.957379 – ident: ref5 doi: 10.1109/TIT.2005.850085 – ident: ref10 doi: 10.1109/18.910594 – ident: ref7 doi: 10.1007/978-1-4613-0165-3_6 – ident: ref2 doi: 10.1109/TIT.1981.1056404 – ident: ref1 doi: 10.7551/mitpress/4347.001.0001 – ident: ref3 doi: 10.1109/49.924874 – volume-title: private communication year: 2003 ident: ref9 – ident: ref8 doi: 10.1109/26.848552 – ident: ref6 doi: 10.1109/4234.1001666 |
| SSID | ssj0008251 |
| Score | 1.9971728 |
| Snippet | In this letter, we propose two modifications to belief propagation (BP) decoding algorithm. The modifications are based on reducing the reliability of messages... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 57 |
| SubjectTerms | Additives Algorithms Applied sciences Associate members Back propagation Belief propagation Bipartite graph Block codes Coding, codes Computer simulation Decoding Digital communication Errors Exact sciences and technology Graphs Information, signal and communications theory Iterative algorithms Iterative decoding Maximum likelihood decoding Messages Parity check codes Processor scheduling Signal and communications theory Telecommunications and information theory |
| Title | Improving belief propagation on graphs with cycles |
| URI | https://ieeexplore.ieee.org/document/1261926 https://www.proquest.com/docview/883968038 https://www.proquest.com/docview/28387398 https://www.proquest.com/docview/896184992 |
| Volume | 8 |
| WOSCitedRecordID | wos000189190000020&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/eLvHCXMwlV3Na9VAEB_a4kEPaq1iWm1z8CSmzWY32Z2jFEsPbfWg0FtIJrMgyHuleU_wv-_sbpqn-AFCAgk7gc3s129nZucH8IY0OmXqYKgiXRjbDEXHyhS9cj37pqa-SWQT9urKXV_jpy14N5-FYeYYfMbH4TH68oclrYOp7ERFuN9sw7a1Np3VmmfdcAQzBdOjIEZ0kwdTlXhycfrx8jKm_jwOMZMxzetmDYqkKiEkshtFKz7RWfw2M8fl5uzJ_1X0KTyeYGX-PvWDXdjixTN49FOywT2oZvtB3rMgT5_Lq0wnsWlyuWLu6jEPltmcfoRouefw5ezD59PzYmJMKMioalXgYMsBdcOdH7Dq68b2SKg65YgHUtazMV4gQ1l7q9Gjk82adr2yqvKyTNX6Bewslgt-CTlr77AmKhuqTUeNK5kGFClGQ3JnUN7rsKUpnXhgtfjWxm1FiW1Ue6C51G1SewZv509uUi6NfwnvBb1uBJNKMzj8paE25bURrGRUBgf3LddOw3FsncBA-QPtMjiaS2UcBedIt-DlemwFZjnRiUjkf5FwkRwHsdr_c9UO4GEK6wn2mVews7pd82t4QN9XX8fbw9hb7wA_6eap |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9RAEB9qK1gfrFpLY7XNg09i2mx2N9l5lGJp6d3pQ4W-hWQzC4LcSXNX6H_f2d00p_gBQgIJO4HN7NdvZ2bnB_DOSjRCaW-osjJTVdllDQmVtcK05Ept2zKSTVSzmbm-xi8b8GE8C0NEIfiMjv1j8OV3C7vyprITEeB--Qi2tFKFiKe1xnnXH8KM4fTImBHN4MMUOZ5MTj9PpyH557GPmgyJXterUKBV8UGRTc96cZHQ4re5OSw4Zzv_V9Xn8GwAlunH2BNewAbNX8LTn9IN7kIxWhDSlhh7upRfeUIJjZPyFbJX96m3zab2zsfLvYKvZ5-uTs-zgTMhs0oUywy7Ku9QltS4DotWl1WLFkUjjKXOisqRUo5BQ65dJdGh4e2aNK2oROF4odJyDzbnizntQ0rSGdTW5qXVqrGlycl2yFKEyvKdQP6gw9oOCcU9r8X3OmwscqyD2j3Rpayj2hN4P37yI2bT-JfwrtfrWjCqNIHDXxpqXa4VoyUlEjh4aLl6GJB9bRgI8h9Ik8DRWMojybtHmjktVn3NQMuwTlgi_YuECfQ4iMXrP1ftCJ6cX00n9eRidnkA2zHIx1tr3sDm8mZFb-GxvV1-628OQ8-9B2Pj6fA |
| 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=Improving+belief+propagation+on+graphs+with+cycles&rft.jtitle=IEEE+communications+letters&rft.au=YAZDANI%2C+Mohammad+R&rft.au=HEMATI%2C+Saied&rft.au=BANIHASHEMI%2C+Amir+H&rft.date=2004&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=1089-7798&rft.volume=8&rft.issue=1&rft.spage=57&rft.epage=59&rft_id=info:doi/10.1109%2Flcomm.2003.822499&rft.externalDBID=n%2Fa&rft.externalDocID=15410241 |
| 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 |