Academic Journals Database
Disseminating quality controlled scientific knowledge

Optimized Min-Sum Decoding Algorithm for Low Density Parity Check Codes

Author(s): Mohammad Rakibul Islam | Dewan Siam Shafiullah | Muhammad Mostafa Amir Faisal | Imran Rahman

Journal: International Journal of Advanced Computer Sciences and Applications
ISSN 2156-5570

Volume: 2;
Issue: 12;
Start page: 168;
Date: 2011;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: LDPC codes | Min-sum algorithm | Normalized min-sum algorithm | Optimization factor.

Low Density Parity Check (LDPC) code approaches Shannon–limit performance for binary field and long code lengths. However, performance of binary LDPC code is degraded when the code word length is small. An optimized min-sum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other decoding methods, an optimization factor has been introduced in both check node and bit node of the Min-sum algorithm. The optimization factor is obtained before decoding program, and the same factor is multiplied twice in one cycle. So the increased complexity is fairly low. Simulation results show that the proposed Optimized Min-Sum decoding algorithm performs very close to the Sum-Product decoding while preserving the main features of the Min-Sum decoding, that is low complexity and independence with respect to noise variance estimation errors.
Why do you need a reservation system?      Save time & money - Smart Internet Solutions