Symbol Flipping Decoding Algorithms Based on Prediction for Non-Binary LDPC Codes

This paper constructs an objective function for symbol flipping decoding algorithms, considering not only soft reliability, but also hard reliability. The maximization of this objective function indicates that the flipping metric should involve both the information before and after symbol flipping,...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 65; no. 5; pp. 1913 - 1924
Main Authors Wang, Shuai, Huang, Qin, Wang, Zulin
Format Journal Article
LanguageEnglish
Published New York IEEE 01.05.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract This paper constructs an objective function for symbol flipping decoding algorithms, considering not only soft reliability, but also hard reliability. The maximization of this objective function indicates that the flipping metric should involve both the information before and after symbol flipping, while the existing algorithms consider the information before symbol flipping. Theoretical analysis shows that such prediction mechanism, together with hard reliability, can significantly improve the error performance of symbol flipping algorithms. Simulation results show that the proposed algorithms provide effective tradeoff between error performance and complexity for decoding non-binary LDPC codes.
AbstractList This paper constructs an objective function for symbol flipping decoding algorithms, considering not only soft reliability, but also hard reliability. The maximization of this objective function indicates that the flipping metric should involve both the information before and after symbol flipping, while the existing algorithms consider the information before symbol flipping. Theoretical analysis shows that such prediction mechanism, together with hard reliability, can significantly improve the error performance of symbol flipping algorithms. Simulation results show that the proposed algorithms provide effective tradeoff between error performance and complexity for decoding non-binary LDPC codes.
Author Shuai Wang
Qin Huang
Zulin Wang
Author_xml – sequence: 1
  givenname: Shuai
  surname: Wang
  fullname: Wang, Shuai
– sequence: 2
  givenname: Qin
  orcidid: 0000-0003-1621-6984
  surname: Huang
  fullname: Huang, Qin
– sequence: 3
  givenname: Zulin
  surname: Wang
  fullname: Wang, Zulin
BookMark eNo9kEFPwkAQhTcGEwH9A3rZxHNxZpd2t0cooiYgGPHcbLdbLCndulsO_HuLEE_zkvfezOQbkF5ta0PIPcIIEeKnTbJaLkcMUIxYJMSYyyvSxzCUAchQ9EgfIIagc-QNGXi_A4AxcN4nH5_HfWYrOq_KpinrLZ0ZbfOTmFRb68r2e-_pVHmTU1vTtTN5qduyk4V19N3WwbSslTvSxWyd0MTmxt-S60JV3txd5pB8zZ83yWuwWL28JZNFoHmEbaAEos4jg0WhueaMFxpyEQLISOcGmcQYOyNWgqFWeRaCyjRIpjLOQsw0H5LH897G2Z-D8W26swdXdydTjAHHMUMpuhQ7p7Sz3jtTpI0r993HKUJ6Qpf-oUtP6NILuq70cC6Vxpj_gpBRzELJfwFWH2uj
CODEN IECMBT
CitedBy_id crossref_primary_10_1109_TVT_2019_2915802
crossref_primary_10_1109_LCOMM_2022_3201236
crossref_primary_10_1109_TCOMM_2017_2745238
crossref_primary_10_1002_cpe_4442
crossref_primary_10_1109_OJCOMS_2024_3390000
crossref_primary_10_1109_TIT_2023_3321173
crossref_primary_10_1155_2019_7468792
crossref_primary_10_1109_ACCESS_2021_3079939
crossref_primary_10_1109_TVT_2023_3245188
crossref_primary_10_1155_2021_4099918
crossref_primary_10_1587_transfun_E102_A_930
crossref_primary_10_1109_OJCOMS_2022_3211418
crossref_primary_10_3390_app14020746
crossref_primary_10_1109_TMAG_2019_2918985
crossref_primary_10_1109_ACCESS_2020_3013814
crossref_primary_10_1109_TVT_2020_3048506
crossref_primary_10_1155_2018_5264724
Cites_doi 10.1109/NSWCTC.2010.59
10.7551/mitpress/4347.001.0001
10.1109/TCOMM.2015.2512582
10.1109/LCOMM.2014.030914.132867
10.1109/LCOMM.2013.051313.130303
10.1109/18.959255
10.1109/TCOMM.2015.2403856
10.1109/TCOMM.2009.06.070313
10.1109/TCOMM.2010.05.070096
10.1109/TCOMM.2008.060527
10.1017/CBO9780511803253
10.1109/ISIT.2008.4595129
10.1109/TCOMM.2010.06.090046
10.1109/TCOMM.2014.2356458
10.1109/LCOMM.2016.2537812
10.1109/4234.681360
10.1109/TCSI.2014.2354753
10.1109/LCOMM.2010.100810.101403
10.1109/TCOMM.2012.100912.110752
10.1109/TCOMM.2013.050813.120489
10.1109/TCOMM.2007.894088
10.1109/TCOMM.2011.092011.110082
10.1109/TCOMM.2010.091310.090327
10.1109/TCOMM.2014.2370032
10.1109/LCOMM.2015.2418260
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.2677438
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 1924
ExternalDocumentID 10_1109_TCOMM_2017_2677438
7869258
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 61471022
  funderid: 10.13039/501100001809
– fundername: NSAF
  grantid: U1530117
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-a711cd6e1ffc3c323fc0d750086cde128191c3c9a721cadb50abc082ab3251bc3
IEDL.DBID RIE
ISSN 0090-6778
IngestDate Thu Oct 10 17:28:48 EDT 2024
Fri Aug 23 01:40:16 EDT 2024
Wed Jun 26 19:28:13 EDT 2024
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c361t-a711cd6e1ffc3c323fc0d750086cde128191c3c9a721cadb50abc082ab3251bc3
ORCID 0000-0003-1621-6984
PQID 1901492187
PQPubID 85472
PageCount 12
ParticipantIDs crossref_primary_10_1109_TCOMM_2017_2677438
proquest_journals_1901492187
ieee_primary_7869258
PublicationCentury 2000
PublicationDate 2017-05-01
PublicationDateYYYYMMDD 2017-05-01
PublicationDate_xml – month: 05
  year: 2017
  text: 2017-05-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 ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref16
ref19
ref18
barnault (ref5) 2003
ref24
ref23
ref26
ref25
ref20
ref22
ref27
jagiello (ref17) 2011
ref8
ref7
ref9
ref4
ref3
ref6
gallager (ref21) 1963
References_xml – ident: ref16
  doi: 10.1109/NSWCTC.2010.59
– year: 1963
  ident: ref21
  publication-title: Low-Density Parity-Check Codes
  doi: 10.7551/mitpress/4347.001.0001
  contributor:
    fullname: gallager
– ident: ref14
  doi: 10.1109/TCOMM.2015.2512582
– ident: ref20
  doi: 10.1109/LCOMM.2014.030914.132867
– ident: ref18
  doi: 10.1109/LCOMM.2013.051313.130303
– ident: ref1
  doi: 10.1109/18.959255
– ident: ref24
  doi: 10.1109/TCOMM.2015.2403856
– ident: ref3
  doi: 10.1109/TCOMM.2009.06.070313
– ident: ref7
  doi: 10.1109/TCOMM.2010.05.070096
– ident: ref2
  doi: 10.1109/TCOMM.2008.060527
– ident: ref26
  doi: 10.1017/CBO9780511803253
– ident: ref8
  doi: 10.1109/ISIT.2008.4595129
– ident: ref22
  doi: 10.1109/TCOMM.2010.06.090046
– ident: ref23
  doi: 10.1109/TCOMM.2014.2356458
– start-page: 70
  year: 2003
  ident: ref5
  article-title: Fast decoding algorithm for LDPC over GF $(2^{q})$
  publication-title: Proc IEEE Inf Theory Workshop
  contributor:
    fullname: barnault
– ident: ref15
  doi: 10.1109/LCOMM.2016.2537812
– ident: ref4
  doi: 10.1109/4234.681360
– ident: ref25
  doi: 10.1109/TCSI.2014.2354753
– ident: ref11
  doi: 10.1109/LCOMM.2010.100810.101403
– ident: ref27
  doi: 10.1109/TCOMM.2012.100912.110752
– ident: ref10
  doi: 10.1109/TCOMM.2013.050813.120489
– ident: ref6
  doi: 10.1109/TCOMM.2007.894088
– ident: ref9
  doi: 10.1109/TCOMM.2011.092011.110082
– start-page: 1
  year: 2011
  ident: ref17
  article-title: Iterative plurality-logic and generalized algorithm B decoding of q-ary LDPC codes
  publication-title: Proc IEEE Inf Theory Appl Workshop
  contributor:
    fullname: jagiello
– ident: ref12
  doi: 10.1109/TCOMM.2010.091310.090327
– ident: ref13
  doi: 10.1109/TCOMM.2014.2370032
– ident: ref19
  doi: 10.1109/LCOMM.2015.2418260
SSID ssj0004033
Score 2.394151
Snippet This paper constructs an objective function for symbol flipping decoding algorithms, considering not only soft reliability, but also hard reliability. The...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Publisher
StartPage 1913
SubjectTerms Algorithms
Binary codes
Computer simulation
Decoding
Error correcting codes
Hamming distance
hard reliability
Iterative decoding
Low density parity check codes
Non-binary LDPC codes
Parity check codes
prediction mechanism
Production planning
Reliability
Reliability analysis
symbol flipping
Title Symbol Flipping Decoding Algorithms Based on Prediction for Non-Binary LDPC Codes
URI https://ieeexplore.ieee.org/document/7869258
https://www.proquest.com/docview/1901492187
Volume 65
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED4VJhh4FUR5yQMbpM2jTeIRWiqEKBRBpW5RfHYKok1Qmw7w6_E5KVTAwBbJcWT5bN93ufs-A5yiDpJ95LElXaLkkBYAd0Lf0khfxOgihSxUbXHnXw-aN8PWsALnX1wYpZQpPlN1ejS5fJnhnH6VNYLQ524rXIGV0HYLrtY3B9L2SsVJKmcPwgVBxuaNp_Z9r0dVXEHd1U1N4qIsOSFzq8qvo9j4l-4m9BYjK8pKXuvzXNTx44do43-HvgUbJdBkF8XK2IaKSndgfUl-sAoPj-8TkY1Zd2xUGkaso2NR8mXsYjzKpi_582TGLrWbkyxLWX9KOR2yI9NAl91lqXVpyLzsttNvs3Ym1WwXBt2rp_a1VV6xYKHnO7kVB46D0ldOkqCHnuslaEsNInSgg1KZLJujG3isA0WMpWjZsUCNGmLhaWAk0NuD1TRL1T4wyUPJbS71GRA0RYIaCNMWT1wvVgEGWIOzxZxHb4WSRmQiEJtHxkIRWSgqLVSDKk3i15vl_NXgaGGmqNxss4gwTZNrrBIc_N3rENbo20Wd4hGs5tO5OtZYIhcnZhF9AiknxL4
link.rule.ids 315,786,790,802,27955,27956,55107
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NU9swEN3h41A4tFDaIZRSHbgVB38klnWE0EzaJikdwgw3j7WSKUOwmcQ5tL--u7JDGeiBm2dkjTVaSfvWu-8J4BApSI5RZZ4JmZLDWgAqSGKPkL7OMEQOWbjaYhwPLjvfrrpXK3D0wIWx1rriM9vmR5fLNyUu-FfZsUxiFXaTVVgnP-_Lmq31jwXpR43mJBe0y2RJkfHV8aT3YzTiOi7ZDqmpw2yUR27I3avy7DB2Hqb_BkbLsdWFJbftRaXb-OeJbONLB78FrxuoKU7qtbENK7Z4C5uPBAh34OfF7ztdTkV_6nQarsUZRaPszcTJ9Lqc3VS_7ubilBydEWUhzmec1WFLCoK6YlwW3qmj84rh2XlP9Epj5-_gsv9l0ht4zSULHkZxUHmZDAI0sQ3yHCOMwihH3xCMoFAHjXV5toAaVEahImZGd_1MI-GGTEcEjTRG72GtKAu7C8KoxChfGToFZEfnSFCYN3keRpmVKLEFn5dznt7XWhqpi0F8lToLpWyhtLFQC3Z4Eh_ebOavBftLM6XNdpunjGo6itCK3Pt_r0_wajAZDdPh1_H3D7DB36mrFvdhrZot7EdCFpU-cAvqL7PSyBI
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=Symbol+Flipping+Decoding+Algorithms+Based+on+Prediction+for+Non-Binary+LDPC+Codes&rft.jtitle=IEEE+transactions+on+communications&rft.au=Shuai+Wang&rft.au=Qin+Huang&rft.au=Zulin+Wang&rft.date=2017-05-01&rft.pub=IEEE&rft.issn=0090-6778&rft.eissn=1558-0857&rft.volume=65&rft.issue=5&rft.spage=1913&rft.epage=1924&rft_id=info:doi/10.1109%2FTCOMM.2017.2677438&rft.externalDocID=7869258
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