Bit-Reliability Based Low-Complexity Decoding Algorithms for Non-Binary LDPC Codes
This paper presents bit-reliability based majority-logic decoding (MLgD) algorithms for non-binary LDPC codes. The proposed algorithms pass only one Galois field element and its reliability along each edge of the Tanner graph of a non-binary LDPC code. Since their reliability updates are in terms of...
Saved in:
Published in | IEEE transactions on communications Vol. 62; no. 12; pp. 4230 - 4240 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.12.2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | This paper presents bit-reliability based majority-logic decoding (MLgD) algorithms for non-binary LDPC codes. The proposed algorithms pass only one Galois field element and its reliability along each edge of the Tanner graph of a non-binary LDPC code. Since their reliability updates are in terms of bits rather than symbols, they are more efficient than traditional MLgD based decoding algorithms. By weighting the soft reliability of the extrinsic information-sums based on their hard reliability, the proposed algorithms can achieve good error performance for non-binary LDPC codes with various column weights. Moreover, their computational complexity and memory consumption are remarkably reduced compared with existing MLgD based decoding algorithms. As a result, they provide effective tradeoffs between error performance and complexity for decoding of non-binary LDPC codes. |
---|---|
AbstractList | This paper presents bit-reliability based majority-logic decoding (MLgD) algorithms for non-binary LDPC codes. The proposed algorithms pass only one Galois field element and its reliability along each edge of the Tanner graph of a non-binary LDPC code. Since their reliability updates are in terms of bits rather than symbols, they are more efficient than traditional MLgD based decoding algorithms. By weighting the soft reliability of the extrinsic information-sums based on their hard reliability, the proposed algorithms can achieve good error performance for non-binary LDPC codes with various column weights. Moreover, their computational complexity and memory consumption are remarkably reduced compared with existing MLgD based decoding algorithms. As a result, they provide effective tradeoffs between error performance and complexity for decoding of non-binary LDPC codes. |
Author | Qin Huang Zulin Wang Lu Wang Mu Zhang |
Author_xml | – sequence: 1 givenname: Qin surname: Huang fullname: Huang, Qin – sequence: 2 givenname: Mu surname: Zhang fullname: Zhang, Mu – sequence: 3 givenname: Zulin surname: Wang fullname: Wang, Zulin – sequence: 4 givenname: Lu surname: Wang fullname: Wang, Lu |
BookMark | eNo9kFtPwkAQhTcGEwH9A_rSxOfi7KXd5RGKt6SIIfjcbLdTXFK62C1R_r1FiE8zmTlnzuQbkF7taiTklsKIUhg_rJLFfD5iQMWIcQnA2QXp0yhSIahI9kgfYAxhLKW6IgPvNwAggPM-WU5tGy6xsjq3lW0PwVR7LILUfYeJ2-4q_DkOZ2hcYet1MKnWrrHt59YHpWuCN1eHU1vr5hCks_ckSFyB_ppclrryeHOuQ_Lx9LhKXsJ08fyaTNLQ8Ji2YQxjLFCKPNIoZKFKIQoscxUbRTUXrERqDNNaauj2gqmYm4Ixww1jXZfzIbk_3d017muPvs02bt_UXWRGY65ExEGxTsVOKtM47xsss11jt93HGYXsyC77Y5cd2WVndp3p7mSyiPhviMeREELyX_tHbDo |
CODEN | IECMBT |
CitedBy_id | crossref_primary_10_1109_TCOMM_2017_2719027 crossref_primary_10_1109_TCOMM_2018_2827994 crossref_primary_10_1109_LCOMM_2022_3201236 crossref_primary_10_1109_ACCESS_2017_2702196 crossref_primary_10_1109_TCOMM_2015_2487454 crossref_primary_10_1109_ACCESS_2024_3387278 crossref_primary_10_1155_2018_7658093 crossref_primary_10_1587_transfun_E102_A_930 crossref_primary_10_3390_app14020746 crossref_primary_10_1587_transcom_2021EBI0001 crossref_primary_10_1109_TMAG_2019_2918985 crossref_primary_10_1109_ACCESS_2020_3013814 crossref_primary_10_1109_LCOMM_2015_2494581 crossref_primary_10_1109_LCOMM_2016_2537812 crossref_primary_10_1109_TVT_2020_3048506 crossref_primary_10_1109_LCOMM_2021_3049602 crossref_primary_10_1109_TDMR_2020_2980754 crossref_primary_10_1109_TCOMM_2015_2501298 crossref_primary_10_1109_LCOMM_2016_2564401 crossref_primary_10_1109_ACCESS_2021_3079939 crossref_primary_10_1109_TCOMM_2017_2677438 crossref_primary_10_1109_OJCOMS_2022_3211418 crossref_primary_10_1109_TCOMM_2016_2609906 crossref_primary_10_1109_ACCESS_2021_3060806 crossref_primary_10_1109_TCOMM_2015_2512582 |
Cites_doi | 10.1109/TCOMM.2012.101712.110709 10.1109/TCOMM.2007.894088 10.1109/18.556669 10.1098/rstl.1763.0053 10.1109/ISIT.2008.4595129 10.1109/TCOMM.2008.060025 10.1109/TCOMM.2009.06.070313 10.1109/ISWCS.2011.6125307 10.1109/TIT.1962.1057683 10.1109/18.959255 10.1109/TCOMM.2010.05.070096 10.1109/MILCOM.2007.4454753 10.1109/LCOMM.2010.100810.101403 10.1109/TCOMM.2010.091310.090327 10.1109/TIT.2007.899516 10.1109/TVLSI.2011.2164951 10.1109/TCOMM.2013.050813.120489 10.1109/ACSSC.2011.6190138 |
ContentType | Journal Article |
Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2014 |
Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2014 |
DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M |
DOI | 10.1109/TCOMM.2014.2370032 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005-present 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 Xplore url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1558-0857 |
EndPage | 4240 |
ExternalDocumentID | 3532144631 10_1109_TCOMM_2014_2370032 6954447 |
Genre | orig-research |
GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 61201156; 61471022 funderid: 10.13039/501100001809 |
GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AASAJ AAYOK ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACKIV ACNCT AENEX AETIX AI. AIBXA AKJIK ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV B-7 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 RIG RNS TAE TN5 VH1 XFK ZCA ZCG AAYXX CITATION 7SP 8FD L7M |
ID | FETCH-LOGICAL-c361t-609ede74b5ae47d8f44defb86c81a342fe1cc2aa7a0e4742863cd22c3c223cdb3 |
IEDL.DBID | RIE |
ISSN | 0090-6778 |
IngestDate | Thu Oct 10 18:35:54 EDT 2024 Fri Aug 23 01:40:11 EDT 2024 Wed Jun 26 19:28:47 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 12 |
Keywords | Non-binary LDPC codes majority-logic decoding binary representation bit-reliability hamming distance |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c361t-609ede74b5ae47d8f44defb86c81a342fe1cc2aa7a0e4742863cd22c3c223cdb3 |
PQID | 1638453082 |
PQPubID | 85472 |
PageCount | 11 |
ParticipantIDs | ieee_primary_6954447 proquest_journals_1638453082 crossref_primary_10_1109_TCOMM_2014_2370032 |
PublicationCentury | 2000 |
PublicationDate | 2014-Dec. 2014-12-00 20141201 |
PublicationDateYYYYMMDD | 2014-12-01 |
PublicationDate_xml | – month: 12 year: 2014 text: 2014-Dec. |
PublicationDecade | 2010 |
PublicationPlace | New York |
PublicationPlace_xml | – name: New York |
PublicationTitle | IEEE transactions on communications |
PublicationTitleAbbrev | TCOMM |
PublicationYear | 2014 |
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 ref12 ref15 ref14 barnault (ref10) 0 ref20 ref11 ref22 ref21 ref1 ref17 ref16 ref19 mackay (ref2) 0 ref18 davey (ref8) 0 ref7 ref4 ref3 ref6 ref5 wymeersch (ref9) 0; 2 |
References_xml | – ident: ref14 doi: 10.1109/TCOMM.2012.101712.110709 – start-page: 70 year: 0 ident: ref8 article-title: Low density parity check codes over ${\rm GF}(q)$ publication-title: Proc IEEE Inf Theory Workshop contributor: fullname: davey – ident: ref11 doi: 10.1109/TCOMM.2007.894088 – ident: ref3 doi: 10.1109/18.556669 – ident: ref22 doi: 10.1098/rstl.1763.0053 – ident: ref15 doi: 10.1109/ISIT.2008.4595129 – start-page: 100 year: 0 ident: ref2 article-title: Good codes based on very sparse matrices publication-title: Proc 5th IMA Conf Rec IEEE IAS Annu Meeting Cryptography Coding contributor: fullname: mackay – ident: ref5 doi: 10.1109/TCOMM.2008.060025 – ident: ref6 doi: 10.1109/TCOMM.2009.06.070313 – ident: ref13 doi: 10.1109/ISWCS.2011.6125307 – ident: ref1 doi: 10.1109/TIT.1962.1057683 – ident: ref7 doi: 10.1109/18.959255 – ident: ref12 doi: 10.1109/TCOMM.2010.05.070096 – ident: ref4 doi: 10.1109/MILCOM.2007.4454753 – ident: ref17 doi: 10.1109/LCOMM.2010.100810.101403 – volume: 2 start-page: 772 year: 0 ident: ref9 article-title: Log-domain decoding of LDPC codes over ${\rm GF}(q)$ publication-title: Proc IEEE Int Conf Commun contributor: fullname: wymeersch – ident: ref18 doi: 10.1109/TCOMM.2010.091310.090327 – ident: ref21 doi: 10.1109/TIT.2007.899516 – ident: ref19 doi: 10.1109/TVLSI.2011.2164951 – ident: ref16 doi: 10.1109/TCOMM.2013.050813.120489 – ident: ref20 doi: 10.1109/ACSSC.2011.6190138 – start-page: 70 year: 0 ident: ref10 article-title: Fast decoding algorithm for LDPC over ${\rm GF}(2^{q})$ publication-title: Proc IEEE Inf Theory Workshop contributor: fullname: barnault |
SSID | ssj0004033 |
Score | 2.3652663 |
Snippet | This paper presents bit-reliability based majority-logic decoding (MLgD) algorithms for non-binary LDPC codes. The proposed algorithms pass only one Galois... |
SourceID | proquest crossref ieee |
SourceType | Aggregation Database Publisher |
StartPage | 4230 |
SubjectTerms | binary representation bit-reliability Computational complexity Decoding Hamming distance Iterative decoding majority-logic decoding Non-binary LDPC codes Parity check codes |
Title | Bit-Reliability Based Low-Complexity Decoding Algorithms for Non-Binary LDPC Codes |
URI | https://ieeexplore.ieee.org/document/6954447 https://www.proquest.com/docview/1638453082 |
Volume | 62 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwEB1BT3BgRxQK8oEbuDiOsx27gCrUFoRaqbcoXgIV0KA2FYKvx3bSsh64RVksa2bimZe8eQY41RnY8VLKMOeeBiih9DEniYNlZDZc9XlCpCXI9v3OkF2PvNEKnC97YZRSlnym6ubQ_suXmZibT2UXfuQxxoJVWA0JLXq1PnsgiVsqTho6exAuGmRIdDFo3fR6hsXF6tQNdBjTb0nI7qryaym2-eVqE3qLmRW0ksf6POd18f5DtPG_U9-CjbLQRI0iMrZhRU12YP2L_OAu3DXHOTac5EKr-w01dUqTqJu9YrNMGKlMfbKtAapJcKjxdJ9Nx_nD8wzpShf1swlu2m5e1G3ftlArk2q2B8Ory0Grg8s9FrBwfSfHPomUVAHjXqJYIMOUMalSHvoidBKX0VQ5QtAkCRKir2us4rtCUipcoesKIbm7D5VJNlEHgFyDVQLKuU5xeigecaLShKYaBgdS-78KZwujxy-FlEZsIQiJYuui2LgoLl1UhV1jxeWdpQGrUFv4KS7ftllsakrmGeGdw7-fOoI1M3ZBQ6lBJZ_O1bEuJnJ-YqPoA65hxR8 |
link.rule.ids | 315,786,790,802,27955,27956,55107 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwEB2xHIADO6KsPnADF8dx4uRIC6hAWxAqErcoXgIIaBBNheDrsZ2U_cAtymrNTPxmkjfPADsGgb0gowwLEZgCJVIhFiT1sIrtgquhSIlyBNlu2Lpip9fB9RjsffTCaK0d-UzX7ab7l69yObSfyvbDOGCM8XGYNDhPeNmt9dkFSfxKc9IS2nk0apEh8X6ved7pWB4Xq1Ofm0Cm32DIravyazJ2CHM8B53R2EpiyX19WIi6fPsh2_jfwc_DbJVqooMyNhZgTPcXYeaLAOESXDbuCmxZyaVa9ytqGFBTqJ2_YDtRWLFMs_PQlKgW4tDBw03-fFfcPg6QyXVRN-_jhuvnRe3DiyZq5koPluHq-KjXbOFqlQUs_dArcEhirTRnIkg14yrKGFM6E1EoIy_1Gc20JyVNU54Sc9xUK6EvFaXSlyazkEr4KzDRz_t6FZBvqxVOhTAgZ24lYkF0ltLMFMJcmQiowe7I6MlTKaaRuCKExIlzUWJdlFQuqsGSteLHmZUBa7Ax8lNSvW-DxGaVLLDSO2t_X7UNU61ep520T7pn6zBtn1OSUjZgonge6k2TWhRiy0XUOz71yHM |
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=Bit-Reliability+Based+Low-Complexity+Decoding+Algorithms+for+Non-Binary+LDPC+Codes&rft.jtitle=IEEE+transactions+on+communications&rft.au=Huang%2C+Qin&rft.au=Zhang%2C+Mu&rft.au=Wang%2C+Zulin&rft.au=Wang%2C+Lu&rft.date=2014-12-01&rft.issn=0090-6778&rft.volume=62&rft.issue=12&rft.spage=4230&rft.epage=4240&rft_id=info:doi/10.1109%2FTCOMM.2014.2370032&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TCOMM_2014_2370032 |
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 |