Improved Decoding Algorithm of Bit-Interleaved Coded Modulation for LDPC Code
Bit-interleaved coded modulation (BICM), which has been proven to be powerful when applied in low-density parity-check (LDPC) sum-product algorithm (SPA) decoder, is a bandwidth efficient coding scheme. However, the BICM-SPA decoder does not take the statistical dependencies between bits from the sa...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on broadcasting Jg. 56; H. 1; S. 103 - 109 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
IEEE
01.03.2010
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 0018-9316, 1557-9611 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Bit-interleaved coded modulation (BICM), which has been proven to be powerful when applied in low-density parity-check (LDPC) sum-product algorithm (SPA) decoder, is a bandwidth efficient coding scheme. However, the BICM-SPA decoder does not take the statistical dependencies between bits from the same L -ary modulated symbol into account so that it cannot converge to the maximum a-posteriori (MAP) decoding algorithm. In this paper, an improved SPA decoding algorithm for the LDPC code, which combines decoding and demodulation, is proposed. The proposed decoding algorithm, referred to as the BICM-ISPA, is based on generalized distributive law and derived from the generalized symbol SPA under certain rational assumptions. And the BICM-ISPA can asymptotically converge to the MAP decoding solution algorithm. Simulation results show that the BICM-ISPA decoder jointly optimizes the decoding error performance and the computational complexity of the LDPC code over the additive white Gaussian noise channel. Compared with the BICM-SPA decoder, the advantage of the BICM-ISPA is quite significant with a large modulation size and in the scenario where Gray mapping cannot be used. |
|---|---|
| AbstractList | Bit-Interleaved Coded Modulation (BICM), which has been proven to be powerful when applied in Low-Density Parity-Check (LDPC) Sum-Product} Algorithm (SPA) decoder, is a bandwidth efficient coding scheme. However, the BICM-SPA decoder does not take the statistical dependencies between bits from the same L -ary modulated symbol into account so that it cannot converge to the Maximum A-Posteriori (MAP) decoding algorithm. In this paper, an improved SPA decoding algorithm for the LDPC code, which combines decoding and demodulation, is proposed. The proposed decoding algorithm, referred to as the BICM-ISPA, is based on generalized distributive law Generalized Distributive Law and derived from the generalized symbol SPA under certain rational assumptions. And the BICM-ISPA can asymptotically converge to the MAP decoding solution algorithm. Simulation results show that the BICM-ISPA decoder jointly optimizes the decoding error performance and the computational complexity of the LDPC code over the additive white Gaussian noise channel. Compared with the BICM-SPA decoder, the advantage of the BICM-ISPA is quite significant with a large modulation size and in the scenario where Gray mapping cannot be used. Bit-Interleaved Coded Modulation (BICM), which has been proven to be powerful when applied in Low-Density Parity-Check (LDPC) Sum-Product} Algorithm (SPA) decoder, is a bandwidth efficient coding scheme. However, the BICM-SPA decoder does not take the statistical dependencies between bits from the same [Formula Omitted]-ary modulated symbol into account so that it cannot converge to the Maximum A-Posteriori (MAP) decoding algorithm. In this paper, an improved SPA decoding algorithm for the LDPC code, which combines decoding and demodulation, is proposed. The proposed decoding algorithm, referred to as the BICM-ISPA, is based on generalized distributive law Generalized Distributive Law and derived from the generalized symbol SPA under certain rational assumptions. And the BICM-ISPA can asymptotically converge to the MAP decoding solution algorithm. Simulation results show that the BICM-ISPA decoder jointly optimizes the decoding error performance and the computational complexity of the LDPC code over the additive white Gaussian noise channel. Compared with the BICM-SPA decoder, the advantage of the BICM-ISPA is quite significant with a large modulation size and in the scenario where Gray mapping cannot be used. Bit-interleaved coded modulation (BICM), which has been proven to be powerful when applied in low-density parity-check (LDPC) sum-product algorithm (SPA) decoder, is a bandwidth efficient coding scheme. However, the BICM-SPA decoder does not take the statistical dependencies between bits from the same L -ary modulated symbol into account so that it cannot converge to the maximum a-posteriori (MAP) decoding algorithm. In this paper, an improved SPA decoding algorithm for the LDPC code, which combines decoding and demodulation, is proposed. The proposed decoding algorithm, referred to as the BICM-ISPA, is based on generalized distributive law and derived from the generalized symbol SPA under certain rational assumptions. And the BICM-ISPA can asymptotically converge to the MAP decoding solution algorithm. Simulation results show that the BICM-ISPA decoder jointly optimizes the decoding error performance and the computational complexity of the LDPC code over the additive white Gaussian noise channel. Compared with the BICM-SPA decoder, the advantage of the BICM-ISPA is quite significant with a large modulation size and in the scenario where Gray mapping cannot be used. |
| Author | Ying Wang Kuang Wang Huifang Chen Lei Xie |
| Author_xml | – sequence: 1 givenname: Ying surname: Wang fullname: Wang, Ying – sequence: 2 givenname: Lei surname: Xie fullname: Xie, Lei – sequence: 3 givenname: Huifang surname: Chen fullname: Chen, Huifang – sequence: 4 givenname: Kuang surname: Wang fullname: Wang, Kuang |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22492093$$DView record in Pascal Francis |
| BookMark | eNp9kb1P5DAQxS0EEgtHj0QTISGuCYzjr3UJ4eBWWgQF1JY3GYNRNgY7i8R_j8OuKChoxsX83psZvz2y3YceCTmkcEYp6POHy_qsAtC5MKkFbJEJFUKVWlK6TSYAdFpqRuUu2UvpBQAYQDUht7Plawzv2BZX2ITW90_FRfcUoh-el0VwxaUfylk_YOzQjlQd2lxvQ7vq7OBDX7gQi_nVff3V-UN2nO0SHmzeffJ4_e-h_l_O725m9cW8bBgVQ2nzTgvluGKSN1o6CYhty5UCSxEclagcKIWaI0fBOFOw0CgslVLTqViwfXK69s27v60wDWbpU4NdZ3sMq2TUKOFSVJn8-ytJpaIVg0qwjB7_QF_CKvb5DjMVUuhsOM3QyQayqbGdi7ZvfDKv0S9t_DBVxXUFejSDNdfEkFJE941QMGNgJgdmxsDMJrAskT8kjR--PnmI1ne_CY_WQo-I33MEE4rnsz4BNqWgww |
| CODEN | IETBAC |
| CitedBy_id | crossref_primary_10_1109_TCOMM_2023_3327779 crossref_primary_10_1109_TBC_2011_2115010 crossref_primary_10_1109_TBC_2018_2883918 crossref_primary_10_1109_JPHOT_2014_2331256 crossref_primary_10_1109_TBC_2015_2419177 crossref_primary_10_1080_00207217_2012_727348 |
| Cites_doi | 10.1109/TCOMM.2006.869865 10.1109/TCOMM.2006.881181 10.1109/26.141453 10.1109/18.669123 10.1109/18.910578 10.1109/LCOMM.2006.060444 10.1109/18.771140 10.1109/TBC.2008.2012359 10.1109/TCOMM.2002.801524 10.1109/TBC.2009.2016498 10.1049/el:19980651 10.1109/GLOCOM.2001.965575 10.1109/LCOMM.2005.1375222 10.1109/TIT.1981.1056404 10.1109/18.910577 10.1109/TIT.1962.1057683 10.1109/18.825794 10.1109/ISIT.2007.4557538 10.1109/18.748992 10.1109/TBC.2007.911365 10.1109/LCOMM.2003.821325 10.1109/LCOMM.2006.1633328 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2010 |
| Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2010 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SP 8FD L7M F28 FR3 |
| DOI | 10.1109/TBC.2009.2036950 |
| DatabaseName | IEEE Xplore (IEEE) 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 Engineering Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Journalism & Communications Engineering Applied Sciences Law |
| EISSN | 1557-9611 |
| EndPage | 109 |
| ExternalDocumentID | 2289594471 22492093 10_1109_TBC_2009_2036950 5357453 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 VJK AAYXX CITATION IQODW RIG 7SP 8FD L7M F28 FR3 |
| ID | FETCH-LOGICAL-c315t-a611b7f47364c96f60eedd4770a1e0f16e7f077e94e4e534370b9e5a1669185b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000274991100013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9316 |
| IngestDate | Sun Sep 28 10:52:00 EDT 2025 Wed Oct 01 00:32:09 EDT 2025 Mon Jun 30 10:14:17 EDT 2025 Mon Jul 21 09:18:37 EDT 2025 Sat Nov 29 04:03:03 EST 2025 Tue Nov 18 21:31:46 EST 2025 Tue Aug 26 16:39:53 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Error estimation Mapping Decoding Algorithm Computational complexity Low-Density Parity-Check (LDPC) code AWGN channels Bit-Interleaved Coded Modulation (BICM) Generalized Distributive Law (GDL) Simulation Coding Sum-Product Algorithm (SPA) Modulation A posteriori estimation Interleaved codes Error correcting code Parity check codes Parity check Demodulation |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c315t-a611b7f47364c96f60eedd4770a1e0f16e7f077e94e4e534370b9e5a1669185b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 ObjectType-Article-2 ObjectType-Feature-1 |
| PQID | 856590468 |
| PQPubID | 23500 |
| PageCount | 7 |
| ParticipantIDs | pascalfrancis_primary_22492093 proquest_miscellaneous_1671230253 proquest_miscellaneous_743704652 ieee_primary_5357453 crossref_citationtrail_10_1109_TBC_2009_2036950 crossref_primary_10_1109_TBC_2009_2036950 proquest_journals_856590468 |
| PublicationCentury | 2000 |
| PublicationDate | 2010-03-01 |
| PublicationDateYYYYMMDD | 2010-03-01 |
| PublicationDate_xml | – month: 03 year: 2010 text: 2010-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on broadcasting |
| PublicationTitleAbbrev | TBC |
| PublicationYear | 2010 |
| 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 | ref13 (ref18) 0 ref12 ref15 ref14 ref11 ref10 ref2 ref1 ref17 ref16 ref19 hu (ref6) 2001; 2 (ref26) 0 ref24 ref23 ref25 ref22 wiberg (ref20) 1996 ref21 ref8 ref7 ref4 (ref9) 2005 ref3 ref5 |
| References_xml | – ident: ref16 doi: 10.1109/TCOMM.2006.869865 – ident: ref24 doi: 10.1109/TCOMM.2006.881181 – ident: ref11 doi: 10.1109/26.141453 – ident: ref12 doi: 10.1109/18.669123 – ident: ref5 doi: 10.1109/18.910578 – ident: ref7 doi: 10.1109/LCOMM.2006.060444 – ident: ref13 doi: 10.1109/18.771140 – ident: ref8 doi: 10.1109/TBC.2008.2012359 – ident: ref22 doi: 10.1109/TCOMM.2002.801524 – year: 1996 ident: ref20 publication-title: Codes and decoding on general graphs – ident: ref14 doi: 10.1109/TBC.2009.2016498 – ident: ref21 doi: 10.1049/el:19980651 – volume: 2 start-page: 1036 year: 2001 ident: ref6 article-title: efficient implementations of the sum-product algorithm for decoding ldpc codes publication-title: IEEE Global Telecommunications Conference doi: 10.1109/GLOCOM.2001.965575 – year: 2005 ident: ref9 publication-title: Digital video broadcasting (DVB) User guidelines for the second generation system for broadcasting interactive services news gathering and other broad-band satellite applications (DVB-S2) – year: 0 ident: ref18 publication-title: Framing Structure Channel Coding and Modulation for Digital Television Terrestrial Broadcasting System – ident: ref15 doi: 10.1109/LCOMM.2005.1375222 – ident: ref2 doi: 10.1109/TIT.1981.1056404 – ident: ref4 doi: 10.1109/18.910577 – ident: ref1 doi: 10.1109/TIT.1962.1057683 – ident: ref25 doi: 10.1109/18.825794 – year: 0 ident: ref26 article-title: pegreg252 <tex notation="tex">$\times$</tex> 504 <tex notation="tex">$({\rm n}=504,{\rm k}=252,{\rm m}=252,{\rm r}=0.5)$</tex> publication-title: Encyclopedia of Sparse Graph Codes – ident: ref17 doi: 10.1109/ISIT.2007.4557538 – ident: ref3 doi: 10.1109/18.748992 – ident: ref10 doi: 10.1109/TBC.2007.911365 – ident: ref23 doi: 10.1109/LCOMM.2003.821325 – ident: ref19 doi: 10.1109/LCOMM.2006.1633328 |
| SSID | ssj0003002 |
| Score | 1.9671057 |
| Snippet | Bit-interleaved coded modulation (BICM), which has been proven to be powerful when applied in low-density parity-check (LDPC) sum-product algorithm (SPA)... Bit-Interleaved Coded Modulation (BICM), which has been proven to be powerful when applied in Low-Density Parity-Check (LDPC) Sum-Product} Algorithm (SPA)... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 103 |
| SubjectTerms | Algorithms Applied sciences Asymptotic properties Bandwidth Bit-Interleaved Coded Modulation (BICM) Channels Codes Coding, codes Computational complexity Computational modeling Decoders Decoding Demodulation Exact sciences and technology Generalized Distributive Law (GDL) Information, signal and communications theory Interleaved codes Law Low density parity check codes Low-Density Parity-Check (LDPC) code Maximum a posteriori estimation Modulation Modulation coding Modulation, demodulation Parity check codes Signal and communications theory Sum product algorithm Sum-Product Algorithm (SPA) Symbols Telecommunications and information theory |
| Title | Improved Decoding Algorithm of Bit-Interleaved Coded Modulation for LDPC Code |
| URI | https://ieeexplore.ieee.org/document/5357453 https://www.proquest.com/docview/856590468 https://www.proquest.com/docview/1671230253 https://www.proquest.com/docview/743704652 |
| Volume | 56 |
| WOSCitedRecordID | wos000274991100013&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: 1557-9611 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003002 issn: 0018-9316 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dSxwxEB9U-tA-9ENbep6VFEqh0O0ll2yyedSz0gcVH2zxbckmE3tw3pbbPf_-Jtl1UaxCX5aFzC5hJslM5usH8CkvlKGF9pky0XXDmcm0r0xWWOQ2hnVkgmT5daLOzorLS32-AV-HWhhETMln-C2-pli-q-06usomOc-VyPkmbColu1qt4dTllHadwVnYwJwNIUmqJxeHs64xZQy66Vhhf0cFJUyVmBFpmsAU36FZPDiYk7Y5fvV_83wNL3urkhx0y-ANbOByG17c6TW4DeOeaN5ck8_kXl1IswOnnXMBHTkK99Goz8jB4qpezdvf16T25HDeZsl5uEATqWa1C8_T2vXoXyTYvuTk6HyWRt7Cz-PvF7MfWY-0kFnO8jYzkrFKeaG4FFZLL2lQnU4oRQ1D6plE5alSqAUKzLngilYac8Ok1EHhV_wdbC3rJb4HQoVC650xLvBgWsnKYSGENrxwwuayGsHklvml7duQRzSMRZmuI1SXQVwRHFOXvbhG8GX44k_XguMJ2p0ojoGul8QI9u_JdxifxoaJVAeC8a3Ay34TN2URjF1NhSxG8HEYDbsvhlTMEut1UzKpguoPdmP4A3mERkV2CZlPd_89uTE871ISYmLbHmy1qzV-gGf2pp03q_20yv8C65X4eQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwED-NgcR44GNjohSGkRASEqF2_RU_bh3TEG21h4L2FjnJGSp1DWpS_n5sJ4s28SHxEkXyJbLubN_5vn4Ab2SqLU2NS7QNrhvObGJcbpO0QF6EsI6KkCxfp3o-Ty8vzcUOvO9rYRAxJp_hh_AaY_llVWyDq2wkudRC8jtwVwoxpm21Vn_uckrb3uDMb2HO-qAkNaPFyaRtTRnCbibU2N9QQhFVJeRE2tqzxbV4Fr8dzVHfnD36v5k-hoedXUmO24XwBHZwvQ8PbnQb3IdhR7Ssr8hbcqsypD6AWetewJKc-htp0GjkePWt2iyb71ekcuRk2STRfbhCG6gmVemfs6rs8L-It37J9PRiEkeewpezj4vJedJhLSQFZ7JJrGIs105orkRhlFPUK89SaE0tQ-qYQu2o1mgECpRccE1zg9IypYxX-Tk_hN11tcZnQKjQWLjS2tLzYJyrvMRUCGN5WopCqnwAo2vmZ0XXiDzgYayyeCGhJvPiCvCYJuvENYB3_Rc_2iYc_6A9COLo6TpJDODolnz78XFomUiNJxheCzzrtnGdpd7cNVSodACv-1G__0JQxa6x2tYZU9orf285-j-Qv9DowC6h5Pj5nyf3Cu6fL2bTbPpp_nkIe22CQkhzewG7zWaLL-Fe8bNZ1pujuOJ_Afl6-8A |
| 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=Improved+Decoding+Algorithm+of+Bit-Interleaved+Coded+Modulation+for+LDPC+Code&rft.jtitle=IEEE+transactions+on+broadcasting&rft.au=YING+WANG&rft.au=LEI+XIE&rft.au=HUIFANG+CHEN&rft.au=KUANG+WANG&rft.date=2010-03-01&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=0018-9316&rft.volume=56&rft.issue=1&rft.spage=103&rft.epage=109&rft_id=info:doi/10.1109%2FTBC.2009.2036950&rft.externalDBID=n%2Fa&rft.externalDocID=22492093 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9316&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9316&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9316&client=summon |