IMPROVING BER PERFORMANCE OF LDPC CODES BASED ON INTERMEDIATE DECODING RESULTS

(2007) IMPROVING BER PERFORMANCE OF LDPC CODES BASED ON INTERMEDIATE DECODING RESULTS. IEEE International Conference on Signal Processing and Communications. pp. 1547-1550.

[img]
Preview
PDF
IMPROVING_BER_PERFORMANCE_OF_LDPC_CODES_ICSPC07.pdf

Download (86kB) | Preview

Abstract

The paper presents a novel approach to reduce the bit error rate (BER) in iterative belief propagation (BP) decoding of low density parity check (LDPC) codes. The behavior of the BP algorithm is first investigated as a function of number of decoder iterations, and it is shown that typical uncorrected error patterns can be classified into 3 categories: oscillating, nearly-constant, or random-like, with a predominance of oscillating patterns at high Signal-to-Noise (SNR) values. A proposed decoder modification is then introduced based on tracking the number of failed parity check equations in the intermediate decoding iterations, rather than relying on the final decoder output (after reaching the maximum number of iterations). Simulation results with a rate ½ (1024,512) progressive edge-growth (PEG) LDPC code show that the proposed modification can decrease the BER by as much as 10-to-40%, particularly for high SNR values.

Item Type: Article
Subjects: Computer
Electrical
Divisions: College Of Computer Sciences and Engineering > Computer Engineering Dept
Depositing User: AIMAN HELMI EL-MALEH
Date Deposited: 29 Feb 2008 23:21
Last Modified: 01 Nov 2019 16:22
URI: http://eprints.kfupm.edu.sa/id/eprint/161