Optimized Min-Sum decoding algorithm for Low Density PC codes

Low Density Parity Check (LDPC) 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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 14th International Conference on Advanced Communication Technology (ICACT) s. 475 - 480
Hlavní autoři: Shafiullah, D. S., Islam, M. R., Faisal, M. M. A., Rahman, I.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.02.2012
Témata:
Approximation algorithms
Bit error rate
Complexity theory
Decoding
Iterative decoding
LDPC codes
Min-sum algorithm
Normalized min-sum algorithm
Optimization
Optimization factor
ISBN:1467301507, 9781467301503
ISSN:1738-9445
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Low Density Parity Check (LDPC) 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.
ISBN:1467301507
9781467301503
ISSN:1738-9445