On Combining Chase‐2 and Sum‐Product Algorithms for LDPC Codes

This letter investigates the combination of the Chase‐2 and sum‐product (SP) algorithms for low‐density parity‐check (LDPC) codes. A simple modification of the tanh rule for check node update is given, which incorporates test error patterns (TEPs) used in the Chase algorithm into SP decoding of LDPC...

Full description

Saved in:
Bibliographic Details
Published inETRI journal Vol. 34; no. 4; pp. 629 - 632
Main Authors Tong, Sheng, Zheng, Huijuan
Format Journal Article
LanguageEnglish
Published 한국전자통신연구원 01.08.2012
Subjects
Chase algorithm
LDPC codes
sum‐product (SP) algorithm
전자/정보통신공학
Online AccessGet full text
ISSN1225-6463
2233-7326
DOI10.4218/etrij.12.0211.0510

Cover

Abstract This letter investigates the combination of the Chase‐2 and sum‐product (SP) algorithms for low‐density parity‐check (LDPC) codes. A simple modification of the tanh rule for check node update is given, which incorporates test error patterns (TEPs) used in the Chase algorithm into SP decoding of LDPC codes. Moreover, a simple yet effective approach is proposed to construct TEPs for dealing with decoding failures with low‐weight syndromes. Simulation results show that the proposed algorithm is effective in improving both the waterfall and error floor performance of LDPC codes.
AbstractList This letter investigates the combination of the Chase‐2 and sum‐product (SP) algorithms for low‐density parity‐check (LDPC) codes. A simple modification of the tanh rule for check node update is given, which incorporates test error patterns (TEPs) used in the Chase algorithm into SP decoding of LDPC codes. Moreover, a simple yet effective approach is proposed to construct TEPs for dealing with decoding failures with low‐weight syndromes. Simulation results show that the proposed algorithm is effective in improving both the waterfall and error floor performance of LDPC codes.
This letter investigates the combination of the Chase-2 and sum-product (SP) algorithms for low-density parity-check (LDPC) codes. A simple modification of the tanh rule for check node update is given, which incorporates test error patterns (TEPs) used in the Chase algorithm into SP decoding of LDPC codes. Moreover, a simple yet effective approach is proposed to construct TEPs for dealing with decoding failures with low-weight syndromes. Simulation results show that the proposed algorithm is effective in improving both the waterfall and error floor performance of LDPC codes. KCI Citation Count: 3
Author Zheng, Huijuan
Tong, Sheng
Author_xml – sequence: 1
  givenname: Sheng
  surname: Tong
  fullname: Tong, Sheng
– sequence: 2
  givenname: Huijuan
  surname: Zheng
  fullname: Zheng, Huijuan
BackLink https://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART001684183$$DAccess content in National Research Foundation of Korea (NRF)
BookMark eNqNkE1OwzAQRi1UJNrCBVhlySbBHidpvCyhQKVKrUpZW67ttG6TGNmpUHccgTNyEtKfFQvEaj5pvjcjvR7q1LbWCN0SHMVAsnvdOLOJCEQYCIlwQvAF6gJQGg4opB3UJQBJmMYpvUI97zcYA46TrIsepnWQ22ppalOvgnwtvP7-_IJA1Cp43VVtnjmrdrIJhuXKOtOsKx8U1gWTx1nekkr7a3RZiNLrm_Pso7en0SJ_CSfT53E-nISSAmOhVEtKZIx1zECIQsl0oFIW04ylQGW7gSRmlIkkGSRMCaJZRoUqaJtZhlVM--judLd2Bd9Kw60wx7myfOv4cL4Yc0ZamLXV7FSVznrvdMGlaURjbN04YUpOMD9o40dtnAA_aOMHbS0Kv9B3Zyrh9n9D538fptT7fxB8tJgDToHRH6OHhSg
CitedBy_id crossref_primary_10_4218_etrij_15_0113_1265
crossref_primary_10_1002_dac_4765
crossref_primary_10_1049_cmu2_12318
Cites_doi 10.1109/TIT.1972.1054746
10.1109/18.910572
10.1109/18.485714
ContentType Journal Article
Copyright 2012 ETRI
Copyright_xml – notice: 2012 ETRI
DBID AAYXX
CITATION
ACYCR
DOI 10.4218/etrij.12.0211.0510
DatabaseName CrossRef
Korean Citation Index
DatabaseTitle CrossRef
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2233-7326
EndPage 632
ExternalDocumentID oai_kci_go_kr_ARTI_917599
10_4218_etrij_12_0211_0510
ETR20629
Genre letter
GrantInformation_xml – fundername: NSFC
  funderid: 61001130; 60972046; 61101148
– fundername: 973 Program
  funderid: 2012CB316100; 2010CB328300
– fundername: Fundamental Research Funds for the Central Universities
  funderid: K50510010026; K50510010006
GroupedDBID -~X
.4S
.DC
.UV
0R~
1OC
29G
2WC
5GY
5VS
9ZL
AAKPC
AAYBS
ACGFS
ACXQS
ACYCR
ADBBV
ADDVE
AENEX
ALMA_UNASSIGNED_HOLDINGS
ARCSS
AVUZU
BCNDV
DU5
E3Z
EBS
EDO
EJD
GROUPED_DOAJ
IPNFZ
ITG
ITH
JDI
KQ8
KVFHK
MK~
ML~
O9-
OK1
P5Y
RIG
RNS
TR2
TUS
WIN
XSB
AAMMB
AAYXX
ADMLS
AEFGJ
AGXDD
AIDQK
AIDYY
CITATION
OVT
ID FETCH-LOGICAL-c3299-cdb31c40e492aafdc67d694389623c1c4254939a55759da1e983adf39da980d43
ISSN 1225-6463
IngestDate Sat Oct 25 08:02:08 EDT 2025
Wed Oct 01 02:46:26 EDT 2025
Thu Apr 24 23:07:51 EDT 2025
Wed Jan 22 16:33:12 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c3299-cdb31c40e492aafdc67d694389623c1c4254939a55759da1e983adf39da980d43
Notes G704-001110.2012.34.4.005
OpenAccessLink https://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART001684183
PageCount 4
ParticipantIDs nrf_kci_oai_kci_go_kr_ARTI_917599
crossref_citationtrail_10_4218_etrij_12_0211_0510
crossref_primary_10_4218_etrij_12_0211_0510
wiley_primary_10_4218_etrij_12_0211_0510_ETR20629
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate August 2012
2012-08-01
2012-08
PublicationDateYYYYMMDD 2012-08-01
PublicationDate_xml – month: 08
  year: 2012
  text: August 2012
PublicationDecade 2010
PublicationTitle ETRI journal
PublicationYear 2012
Publisher 한국전자통신연구원
Publisher_xml – name: 한국전자통신연구원
References 1963
2001; 47
2003; 74
1972; 18
1996; 42
2003
Key-10.4218/etrij.12.0211.0510-1
Key-10.4218/etrij.12.0211.0510-2
Key-10.4218/etrij.12.0211.0510-4
References_xml – volume: 74
  year: 2003
  article-title: Weaknesses of Margulis and Ramanujan‐Margulis Low‐Density Parity‐Check Codes
  publication-title: Electron. Notes Theoretical Computer Sci.
– start-page: 1426
  year: 2003
  end-page: 1435
  article-title: Error Floors of LDPC Codes
– volume: 42
  start-page: 429
  issue: 3
  year: 1996
  end-page: 445
  article-title: Iterative Decoding of Binary Block and Convolutional Codes
  publication-title: IEEE Trans. Inf. Theory
– volume: 18
  start-page: 170
  year: 1972
  end-page: 182
  article-title: Class of Algorithms for Decoding Block Codes with Channel Measurement Information
  publication-title: IEEE Trans. Inf. Theory
– volume: 47
  start-page: 498
  issue: 2
  year: 2001
  end-page: 519
  article-title: Factor Graphs and the Sum‐Product Algorithm
  publication-title: IEEE Trans. Inf. Theory
– year: 1963
– ident: Key-10.4218/etrij.12.0211.0510-1
  doi: 10.1109/TIT.1972.1054746
– ident: Key-10.4218/etrij.12.0211.0510-2
  doi: 10.1109/18.910572
– ident: Key-10.4218/etrij.12.0211.0510-4
  doi: 10.1109/18.485714
SSID ssj0020458
Score 1.9333841
Snippet This letter investigates the combination of the Chase‐2 and sum‐product (SP) algorithms for low‐density parity‐check (LDPC) codes. A simple modification of the...
This letter investigates the combination of the Chase-2 and sum-product (SP) algorithms for low-density parity-check (LDPC) codes. A simple modification of the...
SourceID nrf
crossref
wiley
SourceType Open Website
Enrichment Source
Index Database
Publisher
StartPage 629
SubjectTerms Chase algorithm
LDPC codes
sum‐product (SP) algorithm
전자/정보통신공학
Title On Combining Chase‐2 and Sum‐Product Algorithms for LDPC Codes
URI https://onlinelibrary.wiley.com/doi/abs/10.4218%2Fetrij.12.0211.0510
https://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART001684183
Volume 34
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
ispartofPNX ETRI Journal, 2012, 34(4), , pp.629-632
journalDatabaseRights – providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 2233-7326
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0020458
  issn: 1225-6463
  databaseCode: KQ8
  dateStart: 19930101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVEBS
  databaseName: Inspec with Full Text
  customDbUrl:
  eissn: 2233-7326
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0020458
  issn: 1225-6463
  databaseCode: ADMLS
  dateStart: 20090601
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text
  providerName: EBSCOhost
– providerCode: PRVWIB
  databaseName: KBPluse Wiley Online Library: Open Access
  customDbUrl:
  eissn: 2233-7326
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0020458
  issn: 1225-6463
  databaseCode: AVUZU
  dateStart: 19930401
  isFulltext: true
  titleUrlDefault: https://www.kbplus.ac.uk/kbplus7/publicExport/pkg/559
  providerName: Wiley-Blackwell
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dT9swELdGedke0BibBhuTkfZWZWtix41fkCoYArQNhNoJ7cWK7QTKRzqF8MJfz53tpi37EOwljdLm4vpnn3938d0R8hGTiLFMFBHMBh0BA4cp1WdpZOJcWs5LkVh06H_7LvZH_PA0PZ2Vt3TRJY3-ZO7-GFfyP6jCNcAVo2SfgGwrFC7AOeALR0AYjo_C-Agj9q61q_GAL85voDP8Xszb6-jY53LtDq7OJvW4OfeZF7pfd4934C4b9g5OnfLDk4Pu_DOd4zm4ks-LsLwF7wBus8im3gGv0GC-RoIHJRI0XnAfjufNeae-RPA--JVQeM_jQyXLgRVgdzf1-MK5UhNMg5qG3akLGa0frDTt_j-wPFCKcjJUnCiUoVDGEllOQD_3OmR58GP0c9Qaz_hCF43n6f_xAVAo5fPvLVkgGUtVXS6aHo47DF-SlUD66cAjuEqeFdUr8mIuFeQa2T6qaIslDVhSwJLOYUlnWFLAkiKW1GH5moz2vgx39qNQ2yIyDBhAZKxmseG9gsskz0trRN8KiaXogY8a-AYNdybzFAuo2jwuZMZyWzI4l1nPcvaGdKpJVbwlVDPNpbYJA27Mtcw0FgXIclH2LbDHNFkn8bQzlAmJ37H-yJX6OwzrpNve88unPfnnr7egj9WlGSvMVo6fZxN1WSuwyQ6UBIYqJbTCIfAIcQrGfNKDsbjxpFa8I89nM-A96TT1bbEJjLHRH8JgugdxdmGz
linkProvider Wiley-Blackwell
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NTsMwDI7GdgAOiF_xT5C4oYo1SbPmOMbQgG0g2BDiEjVNC4OtQ2XceQSekSfBbscEQkKIUyO1tionrj87zWdC9pBEjPsycsAbjAMIHFyqwj0ndANlhYgls1jQb7VloytOb7ybAql_noXJ-SEmBTf0jOx7jQ6OBWn0cgFhCWdxlPYesloeQx5ODw9alTyMT0VSql53b7uTzAt3AzHzgsXrSCF5fnoG9Rz81PItQk0lafwdt2aB53iezI0RI63mU7xAClGySGa_8AgukcPzhIJjm6zZA63dQ2R6f31jNEgsvXoZwPgiJ3al1f7dMO2N7gfPFNAqbR5d1EDSRs_LpHtc79Qazrg5ghNyCCFOaA13Q1GOhGJBENtQVqxU2MscAE0IdzDz4yrwsAOnDdxI-TywMYex8stW8BVSTIZJtEqo4UYoYxkHcCWM8g2yyvuBjCsW4IfH1oj7aRAdjpnDsYFFX0MGgUbUmRG1yzQaUaMR18j-ROYp58349eldsLN-DHsa6a7xejfUj6kGUH-iIaP0lIK3yGbhD-p0vXPJypKp9X_I7JDpRqfV1M2T9tkGmQGAxPIf_jZJcZS-RFsAQkZme7zEPgBHJtH8
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5qC6IH8YlvV_AmwWZ3s80eax_Ud1Er4mXJZpNatWmJ9e5P8Df6S5xJalEEEU9ZSHYIMzuZb2az3xCyhyRi3JeRA95gHEDg4FIV7jmhGygrRCyZxYL-2blsdcTxrXdbII3PszA5P8Sk4IaekX2v0cGjoY3RywWEJbTiKO09ZLU8hjycHh60KkFAL4siKVVvOnedSeaFu4GYecHidaSQPD89g3IOfkr5FqGmkjT-jluzwNOcJ3NjxEiruYkXSCFKFsnsFx7BJXJ4kVBwbJM1e6C1e4hM769vjAaJpVcvfRi3c2JXWn3qDtLe6L7_TAGt0tN6uwYzbfS8TDrNxnWt5YybIzghhxDihNZwNxTlSCgWBLENZcVKhb3MAdCEcAczP64CDztw2sCNlM8DG3MYK79sBV8hxWSQRKuEGm6EMpZxAFfCKN8gq7wfyLhiAX54bI24nwrR4Zg5HBtYPGnIIFCJOlOidplGJWpU4hrZn8wZ5rwZvz69C3rWj2FPI901XrsD_ZhqAPVHGjJKTyl4i8wKfxCnG9eXrCyZWv_HnB0y3a439enR-ckGmQF8xPL__TZJcZS-RFuAQUZme7zCPgA55NGL
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=On+Combining+Chase-2+and+Sum-Product+Algorithms+for+LDPC+Codes&rft.jtitle=ETRI+journal&rft.au=Tong%2C+Sheng&rft.date=2012-08-01&rft.issn=1225-6463&rft.volume=34&rft.issue=4&rft.spage=629&rft.epage=632&rft_id=info:doi/10.4218%2Fetrij.12.0211.0510&rft.externalDBID=n%2Fa&rft.externalDocID=10_4218_etrij_12_0211_0510
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1225-6463&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1225-6463&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1225-6463&client=summon