Set Message-Passing Decoding Algorithms for Regular Non-Binary LDPC Codes

In the check node (CN) update of non-binary message-passing algorithms, each element of reliability vectors takes the same computational complexity. However, our analysis indicates that various elements in the same vector have various correct probabilities, thus have different contributions to error...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications Jg. 65; H. 12; S. 5110 - 5122
Hauptverfasser: Huang, Qin, Song, Liyuan, Wang, Zulin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.12.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithm design and analysis
Algorithms
Binary codes
Binary system
check node update
Codes
Complexity
Computation
Computational complexity
Computer simulation
Decoding
Error correcting codes
Error correction
fixed paths
Message passing
Non-binary LDPC codes
Parity check codes
Partitioning algorithms
Reliability
Reliability analysis
set partition
ISSN:0090-6778, 1558-0857
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In the check node (CN) update of non-binary message-passing algorithms, each element of reliability vectors takes the same computational complexity. However, our analysis indicates that various elements in the same vector have various correct probabilities, thus have different contributions to error performance. In order to match computational complexity with correct probability, all elements in a vector are partitioned into different sets. For the extended min-sum (EMS) decoding, various strategies are applied for sets according to their correct probability. For the trellis-based EMS decoding, it is interesting that set partition only involves fixed paths, thus it does not need to search over the whole trellis of a CN. Complexity analysis and simulation results show that the proposed algorithms efficiently decode non-binary low-density parity-check codes, including ultra-sparse ones.
AbstractList In the check node (CN) update of non-binary message-passing algorithms, each element of reliability vectors takes the same computational complexity. However, our analysis indicates that various elements in the same vector have various correct probabilities, thus have different contributions to error performance. In order to match computational complexity with correct probability, all elements in a vector are partitioned into different sets. For the extended min-sum (EMS) decoding, various strategies are applied for sets according to their correct probability. For the trellis-based EMS decoding, it is interesting that set partition only involves fixed paths, thus it does not need to search over the whole trellis of a CN. Complexity analysis and simulation results show that the proposed algorithms efficiently decode non-binary low-density parity-check codes, including ultra-sparse ones.
Author Huang, Qin
Song, Liyuan
Wang, Zulin
Author_xml – sequence: 1
  givenname: Qin
  orcidid: 0000-0003-1621-6984
  surname: Huang
  fullname: Huang, Qin
  email: qhuang.smash@gmail.com
  organization: School of Electronic and Information Engineering, Beihang University, Beijing, China
– sequence: 2
  givenname: Liyuan
  surname: Song
  fullname: Song, Liyuan
  email: slybuaa@163.com
  organization: School of Electronic and Information Engineering, Beihang University, Beijing, China
– sequence: 3
  givenname: Zulin
  surname: Wang
  fullname: Wang, Zulin
  email: wzulin_201@163.com
  organization: School of Electronic and Information Engineering, Beihang University, Beijing, China
BookMark eNp9kD1PwzAQhi1UJNrCH4AlEnPKObbjZCwpH5VaWkGZI8e5BFdtXOx04N-T0oqBgelueJ_7eAak19gGCbmmMKIU0rtVtpjPRxFQOYokjynQM9KnQiQhJEL2SB8ghTCWMrkgA-_XAMCBsT6ZvmEbzNF7VWO4VN6bpg4mqG15aMab2jrTfmx9UFkXvGK93ygXvNgmvDeNcl_BbLLMgsyW6C_JeaU2Hq9OdUjeHx9W2XM4WzxNs_Es1FEq2lCnAmINBaNSdBdUKkEui7hQDCMdCcFLxhXTqY6lFgwLCqLSXAlMNWBSFmxIbo9zd85-7tG3-druXdOtzCMqOaei09ClkmNKO-u9wyrXplWtsU3rlNnkFPKDuPxHXH4Ql5_EdWj0B905s-2e_R-6OUIGEX-BpIsIIdg3fOV6Lg
CODEN IECMBT
CitedBy_id crossref_primary_10_1155_2018_7063758
crossref_primary_10_1002_dac_4439
crossref_primary_10_1186_s43020_022_00063_5
crossref_primary_10_1002_navi_392
crossref_primary_10_1007_s11432_018_9778_x
crossref_primary_10_1109_ACCESS_2019_2910240
crossref_primary_10_1155_2019_7468792
crossref_primary_10_1371_journal_pone_0250930
crossref_primary_10_1155_2018_7658093
crossref_primary_10_1155_2021_4099918
crossref_primary_10_1007_s11235_019_00630_3
crossref_primary_10_1109_TVT_2020_3048506
crossref_primary_10_1155_2018_5264724
crossref_primary_10_1109_TCOMM_2024_3450606
crossref_primary_10_1109_ACCESS_2018_2889501
Cites_doi 10.1109/TCOMM.2007.894088
10.1109/TIT.2004.839541
10.1109/ITW.2012.6404676
10.1109/TCSI.2012.2190668
10.1109/TCOMM.2010.05.070096
10.1109/TVLSI.2014.2344113
10.1109/TCOMM.2011.092011.110082
10.1109/TCOMM.2012.101712.110173
10.1109/TCSI.2014.2354753
10.1109/ISIT.2016.7541851
10.1109/TCOMM.2015.2403856
10.1109/TCOMM.2015.2512582
10.1109/LCOMM.2013.070113.130806
10.1109/TCOMM.2009.06.070313
10.1109/TCOMM.2012.101712.110709
10.1109/ISIT.2008.4595129
10.1109/TCOMM.2013.050813.120489
10.1109/TCSI.2013.2279186
10.1002/sat.1004
10.1109/ISWCS.2011.6125307
10.1109/4234.681360
10.1109/ICC.2004.1312606
10.1109/TIT.2012.2234207
10.1109/TCOMM.2008.060527
10.1109/TCOMM.2013.041113.120539
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/TCOMM.2017.2746101
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Electronic Library (IEL)
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://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-0857
EndPage 5122
ExternalDocumentID 10_1109_TCOMM_2017_2746101
8017555
Genre orig-research
GrantInformation_xml – fundername: NSAF
  grantid: U1530117
– fundername: National Natural Science Foundation of China
  grantid: 61471022
  funderid: 10.13039/501100001809
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACKIV
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
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
RNS
TAE
TN5
VH1
ZCA
ZCG
AAYXX
CITATION
7SP
8FD
L7M
RIG
ID FETCH-LOGICAL-c295t-c9506c0b3175033fa8e47b6ba3e2c2554d34a3c9c67c53eb105fc4a5e9c0e8db3
IEDL.DBID RIE
ISICitedReferencesCount 18
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000418518900002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0090-6778
IngestDate Mon Jun 30 10:12:58 EDT 2025
Sat Nov 29 01:41:39 EST 2025
Tue Nov 18 22:35:24 EST 2025
Wed Aug 27 02:36:21 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 12
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c295t-c9506c0b3175033fa8e47b6ba3e2c2554d34a3c9c67c53eb105fc4a5e9c0e8db3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-1621-6984
PQID 2174415201
PQPubID 85472
PageCount 13
ParticipantIDs ieee_primary_8017555
proquest_journals_2174415201
crossref_citationtrail_10_1109_TCOMM_2017_2746101
crossref_primary_10_1109_TCOMM_2017_2746101
PublicationCentury 2000
PublicationDate 2017-12-01
PublicationDateYYYYMMDD 2017-12-01
PublicationDate_xml – month: 12
  year: 2017
  text: 2017-12-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on communications
PublicationTitleAbbrev TCOMM
PublicationYear 2017
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 ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref17
ref16
ref19
ref18
gutierrez (ref5) 2010
pfletschinger (ref6) 2009
(ref13) 2012
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref8
ref7
ref9
ref4
ref3
References_xml – ident: ref10
  doi: 10.1109/TCOMM.2007.894088
– ident: ref28
  doi: 10.1109/TIT.2004.839541
– ident: ref2
  doi: 10.1109/ITW.2012.6404676
– ident: ref21
  doi: 10.1109/TCSI.2012.2190668
– ident: ref15
  doi: 10.1109/TCOMM.2010.05.070096
– ident: ref25
  doi: 10.1109/TVLSI.2014.2344113
– ident: ref16
  doi: 10.1109/TCOMM.2011.092011.110082
– ident: ref4
  doi: 10.1109/TCOMM.2012.101712.110173
– ident: ref24
  doi: 10.1109/TCSI.2014.2354753
– ident: ref19
  doi: 10.1109/ISIT.2016.7541851
– ident: ref11
  doi: 10.1109/TCOMM.2015.2403856
– ident: ref12
  doi: 10.1109/TCOMM.2015.2512582
– ident: ref18
  doi: 10.1109/LCOMM.2013.070113.130806
– ident: ref1
  doi: 10.1109/TCOMM.2009.06.070313
– ident: ref20
  doi: 10.1109/TCOMM.2012.101712.110709
– ident: ref27
  doi: 10.1109/ISIT.2008.4595129
– ident: ref23
  doi: 10.1109/TCOMM.2013.050813.120489
– ident: ref17
  doi: 10.1109/TCSI.2013.2279186
– ident: ref7
  doi: 10.1002/sat.1004
– ident: ref22
  doi: 10.1109/ISWCS.2011.6125307
– ident: ref9
  doi: 10.1109/4234.681360
– start-page: 1
  year: 2010
  ident: ref5
  article-title: Davinci non-binary LDPC codes: Performance and complexity assessment
  publication-title: Proc Future Netw Mobile Summit
– year: 2012
  ident: ref13
  publication-title: Short Blocklength LDPC Codes for TC Synchronization and Channel Coding
– ident: ref14
  doi: 10.1109/ICC.2004.1312606
– start-page: 1
  year: 2009
  ident: ref6
  article-title: Performance evaluation of non-binary LDPC codes on wireless channels
  publication-title: Proc ICT Mobile Summit
– ident: ref8
  doi: 10.1109/TIT.2012.2234207
– ident: ref26
  doi: 10.1109/TCOMM.2008.060527
– ident: ref3
  doi: 10.1109/TCOMM.2013.041113.120539
SSID ssj0004033
Score 2.3527057
Snippet In the check node (CN) update of non-binary message-passing algorithms, each element of reliability vectors takes the same computational complexity. However,...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 5110
SubjectTerms Algorithm design and analysis
Algorithms
Binary codes
Binary system
check node update
Codes
Complexity
Computation
Computational complexity
Computer simulation
Decoding
Error correcting codes
Error correction
fixed paths
Message passing
Non-binary LDPC codes
Parity check codes
Partitioning algorithms
Reliability
Reliability analysis
set partition
Title Set Message-Passing Decoding Algorithms for Regular Non-Binary LDPC Codes
URI https://ieeexplore.ieee.org/document/8017555
https://www.proquest.com/docview/2174415201
Volume 65
WOSCitedRecordID wos000418518900002&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: 1558-0857
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004033
  issn: 0090-6778
  databaseCode: RIE
  dateStart: 19720101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH4B4kEP_kIjiqYHb1roWLeuRwSJJoBEMeG2bG2HJMgMDP9-2zJQozEx2WFZ2mX7ur33ve299wFcJlz6CfcFDgIhMaXExZH2epjKyKecSi4T28S1y_r9YDTigwJcb2phlFI2-UzVzK79ly9TsTSfyuramjLP84pQZIytarU-ayCJm3ecNOnsLFgXyBBeH7Yeej2TxcVqOgbTfMH55oSsqsoPU2z9S2fvf1e2D7s5j0TN1cIfQEHNDmHnS3fBMtw_qQz1jMTJWOGBJsn6KGrrcNO4K9ScjtP5JHt5XSDNW9Gj1aSfo346wze2Rhd124MWaqVSLY7guXM7bN3hXDkBiwb3Miy4R3xBYkMONC5JFCjKYj-OXNUQOoig0qWRK7jwmfBcba6JlwgaeYoLogIZu8dQmqUzdQJI-o0odoIkcahDBWMxSXy9UX27cSRdUgFnDWUo8rbiRt1iGtrwgvDQwh8a-MMc_gpcbea8rZpq_Dm6bADfjMyxrkB1vWJh_t4tQhNgGUpCnNPfZ53Btjn3KiGlCqVsvlTnsCXes8lifmEfqQ9BuMcQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fT8IwEL4omqgP_jbizz74ppWOtdv6iCiBCEgUE96Wre2QBJmB4d9vWwZqNCYme1iWNtu-bnffbXf3AVwkXHoJ9wQOAiExpcTFkfZ6mMrIo5xKLhPbxLXpt9tBr8c7S3C1qIVRStnkM3Vtdu2_fJmKqflUVtLW1GeMLcMKo7TszKq1PqsgiZv3nDQJ7X4wL5EhvNStPrRaJo_Lv9ZRmGYMzjc3ZHVVfhhj62FqW_-7tm3YzJkkqsyWfgeW1GgXNr70F9yDxpPKUMuInPQV7miarI-iWx1wGoeFKsN-Oh5kL68TpJkrerSq9GPUTkf4xlbpouZtp4qqqVSTfXiu3XWrdZxrJ2BR5izDgjPiCRIbeqBxSaJAUT_24shVZaHDCCpdGrmCC88XzNUGm7BE0IgpLogKZOweQGGUjtQhIOmVo9gJksShDhW-H5PE0xvVtxtH0iVFcOZQhiJvLG70LYahDTAIDy38oYE_zOEvwuViztusrcafo_cM4IuROdZFOJmvWJi_eZPQhFiGlBDn6PdZ57BW77aaYbPRvj-GdXOeWXrKCRSy8VSdwqp4zwaT8Zl9vD4AyavKVw
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=Set+Message-Passing+Decoding+Algorithms+for+Regular+Non-Binary+LDPC+Codes&rft.jtitle=IEEE+transactions+on+communications&rft.au=Huang%2C+Qin&rft.au=Song%2C+Liyuan&rft.au=Wang%2C+Zulin&rft.date=2017-12-01&rft.issn=0090-6778&rft.eissn=1558-0857&rft.volume=65&rft.issue=12&rft.spage=5110&rft.epage=5122&rft_id=info:doi/10.1109%2FTCOMM.2017.2746101&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TCOMM_2017_2746101
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