Performance analysis of iterative decoding algorithms with memory
Density evolution is often used to determine the performance of an ensemble of low-density parity-check (LDPC) codes under iterative message-passing algorithms. Conventional density evolution techniques over memoryless channels are based on the independence assumption amongst all the processed messa...
Uloženo v:
| Vydáno v: | 2010 IEEE Information Theory Workshop on Information Theory s. 1 - 5 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.01.2010
|
| Témata: | |
| ISBN: | 9781424463725, 1424463726 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Density evolution is often used to determine the performance of an ensemble of low-density parity-check (LDPC) codes under iterative message-passing algorithms. Conventional density evolution techniques over memoryless channels are based on the independence assumption amongst all the processed messages in variable and check nodes. This assumption is valid for many algorithms such as standard belief propagation (BP) and min-sum (MS) algorithms. However, there are other important iterative algorithms such as successive relaxation (SR) versions of BP and MS, and differential decoding with binary message passing (DD-BMP) algorithm of Mobini et. al., for which this assumption is not valid. The dependence created among messages for these algorithms is due to the introduction of memory in the iterative algorithm. In this work, we propose a model for iterative decoding algorithms with memory which covers SR and DD-BMP algorithms as special cases. Based on this model, we derive a Bayesian network for iterative algorithms with memory over memoryless channels and use this representation to analyze the algorithms using density evolution. The density evolution technique is developed based on truncating the memory of the decoding process and approximating it with a finite order Markov process, and can be implemented efficiently. As an example, we apply our technique to analyze the performance of DD-BMP on regular LDPC code ensembles, and make a number of interesting observations with regard to the performance/complexity trade off of DD-BMP in comparison with BP and MS algorithms. |
|---|---|
| AbstractList | Density evolution is often used to determine the performance of an ensemble of low-density parity-check (LDPC) codes under iterative message-passing algorithms. Conventional density evolution techniques over memoryless channels are based on the independence assumption amongst all the processed messages in variable and check nodes. This assumption is valid for many algorithms such as standard belief propagation (BP) and min-sum (MS) algorithms. However, there are other important iterative algorithms such as successive relaxation (SR) versions of BP and MS, and differential decoding with binary message passing (DD-BMP) algorithm of Mobini et. al., for which this assumption is not valid. The dependence created among messages for these algorithms is due to the introduction of memory in the iterative algorithm. In this work, we propose a model for iterative decoding algorithms with memory which covers SR and DD-BMP algorithms as special cases. Based on this model, we derive a Bayesian network for iterative algorithms with memory over memoryless channels and use this representation to analyze the algorithms using density evolution. The density evolution technique is developed based on truncating the memory of the decoding process and approximating it with a finite order Markov process, and can be implemented efficiently. As an example, we apply our technique to analyze the performance of DD-BMP on regular LDPC code ensembles, and make a number of interesting observations with regard to the performance/complexity trade off of DD-BMP in comparison with BP and MS algorithms. |
| Author | Janulewicz, Emil Banihashemi, Amir H |
| Author_xml | – sequence: 1 givenname: Emil surname: Janulewicz fullname: Janulewicz, Emil organization: Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada – sequence: 2 givenname: Amir H surname: Banihashemi fullname: Banihashemi, Amir H organization: Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada |
| BookMark | eNpNj01Lw0AYhFdUUGt-gR72D6S--5nkWIofxYKFBjyWTfbdupJkZTco-fcG7MG5PMwchpkbcjGEAQm5Z7BkDKqHTf3-ut_tlxzmRCkQHPgZyaqiZJJLqeWM839eFFxdkSylT5glFS9AXpPVDqMLsTdDi9QMppuSTzQ46keMZvTfSC22wfrhSE13DNGPH32iPzNoj32I0y25dKZLmJ24IPXTY71-ybdvz5v1apv7CsZcCahayYzkxoJhwgA0XFuHUjFbFciUA27nTSBKVjirG62VdkK0rKxYU4oFufur9Yh4-Iq-N3E6nH6LX7baTag |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ITWKSPS.2010.5503202 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings Accès UT - IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9781424464142 1424464153 1424464145 9781424464159 |
| EndPage | 5 |
| ExternalDocumentID | 5503202 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ADFMO ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK IEGSK IERZE OCL RIE RIL |
| ID | FETCH-LOGICAL-i90t-5309c41a42ad0a13a00b26dfe451d97e15f02d27003817fd6b6656f33c1891b83 |
| IEDL.DBID | RIE |
| ISBN | 9781424463725 1424463726 |
| IngestDate | Wed Aug 27 02:38:22 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i90t-5309c41a42ad0a13a00b26dfe451d97e15f02d27003817fd6b6656f33c1891b83 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_5503202 |
| PublicationCentury | 2000 |
| PublicationDate | 2010-Jan. |
| PublicationDateYYYYMMDD | 2010-01-01 |
| PublicationDate_xml | – month: 01 year: 2010 text: 2010-Jan. |
| PublicationDecade | 2010 |
| PublicationTitle | 2010 IEEE Information Theory Workshop on Information Theory |
| PublicationTitleAbbrev | ITWKSPS |
| PublicationYear | 2010 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0000452704 |
| Score | 1.4346291 |
| Snippet | Density evolution is often used to determine the performance of an ensemble of low-density parity-check (LDPC) codes under iterative message-passing... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Algorithm design and analysis Bayesian methods Belief propagation Iterative algorithms Iterative decoding Memoryless systems Message passing Parity check codes Performance analysis Strontium |
| Title | Performance analysis of iterative decoding algorithms with memory |
| URI | https://ieeexplore.ieee.org/document/5503202 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8MwGA7b8OBJZRN1Kjl4NC5fTZqjiEMRRmEDdxtJk-jArbJ1gv_epO02BC_ekkBC3gSS9-t5XgBuaC6tE6lChlmOuM8NUph6FFG7WlEdr70qNiFHo3Q6VVkL3O6wMM65KvnM3cVmFcu3Rb6JrrJB0KZjue82aEspaqzWzp8SqcEl5lvslmCSii2lU9NPGugcwWrwPHl9GWfjOrerWfdXgZXqfxke_W9nx6C3B-rBbPcFnYCWW3bBfbYHA0DdkI7AwsOaQTk8b9AGozPOgPrjrVjNy_fFGkaPLFzExNvvHpgMHycPT6iplIDmCpcoYVjlnGhOtcWaMI2xocJ6xxNilXQk8ZjaGGKOfHzeCiOCGucZy0mqiEnZKegsi6U7A1BJ6o0gQS-xgksT7CkhwtH6RGriCfHnoBuln33WXBizRvCLv4f74LCOtkeXxSXolKuNuwIH-Vc5X6-uqwv8AQXnlrQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH_MKehJZRO_zcGjdUmaJs1RxLGxOQoruNtIm0QHbpWtE_zvbdq6IXjxlgQS8hJI3tfv9wBuaSq04aH0El8zj9k08SSm1nOoXSWpctdeFpsQo1E4mcioAXcbLIwxpkw-M_euWcbydZaunausU2jTrtz3DuwGjFFcobU2HhVHDi4w-0FvcV9Q_kPqVPeDGjxHsOz045fBOBpX2V31yr9KrJQ_TPfwf3s7gvYWqoeizSd0DA2zaMFDtIUDIFXTjqDMoopDuXjgkC7MTjcDqffXbDnL3-Yr5HyyaO5Sb7_aEHef4seeV9dK8GYS517gY5kyohhVGiviK4wTyrU1LCBaCkMCi6l2QWbHyGc1T3ihyFnfT0koSRL6J9BcZAtzCkgKahNOCs1EcyaSwqLivDhaGwhFLCH2DFpO-ulHxYYxrQU__3v4BvZ78fNwOuyPBhdwUMXenQPjEpr5cm2uYC_9zGer5XV5md8UFJn7 |
| 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%3Abook&rft.genre=proceeding&rft.title=2010+IEEE+Information+Theory+Workshop+on+Information+Theory&rft.atitle=Performance+analysis+of+iterative+decoding+algorithms+with+memory&rft.au=Janulewicz%2C+Emil&rft.au=Banihashemi%2C+Amir+H&rft.date=2010-01-01&rft.pub=IEEE&rft.isbn=9781424463725&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1109%2FITWKSPS.2010.5503202&rft.externalDocID=5503202 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424463725/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424463725/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424463725/sc.gif&client=summon&freeimage=true |