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

More Information
Summary: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.
Bibliography:G704-001110.2012.34.4.005
ISSN:1225-6463
2233-7326
DOI:10.4218/etrij.12.0211.0510