Simulation results show that the proposed low complexity approximation doesn't cause BER performance degradation.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:A piece-wise second order approximation to the f (x) = -log [tanh (x/2)] function is proposed to reduce the computational complexity of LDPC decoder's utilizing Log-Likelihood Ratio Belief Propagation (LLR-BP) algorithm based on Gallager's approach.
📊
Key Findings & Data:A piece-wise second order approximation to the f (x) = -log [tanh (x/2)] function is proposed to reduce the computational complexity of LDPC decoder's utilizing Log-Likelihood Ratio Belief Propagation (LLR-BP) algorithm based on Gallager's approach.
💡
Conclusion & Impact:Simulation results show that the proposed low complexity approximation doesn't cause BER performance degradation.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Turk. J. Elec. Eng. & Comp. Sci. · (2010) · 1053-1058. Full text: pdf Other articles published in the same issue: Turk. J. Elec. Eng. & Comp. Sci.
Abstract
A piece-wise second order approximation to the f (x) = -log [tanh (x/2)] function is proposed to reduce the computational complexity of LDPC decoder's utilizing Log-Likelihood Ratio Belief Propagation (LLR-BP) algorithm based on Gallager's approach. Simulation results show that the proposed low complexity approximation doesn't cause BER performance degradation.
Özet
A piece-wise second order approximation to the f (x) = -log [tanh (x/2)] function is proposed to reduce the computational complexity of LDPC decoder's utilizing Log-Likelihood Ratio Belief Propagation (LLR-BP) algorithm based on Gallager's approach. Simulation results show that the proposed low complexity approximation doesn't cause BER performance degradation.
KALAYCIOĞLU, A., ÜRETEN, O., İLK, H. G. (2010). A second order approximation to reduce the complexity of LDPC decoders based on Gallager's approach. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 18 - Sayı: 6, 1053–1058. https://ajindex.com/articles/188807
R. G. Gallager, “Low-Density Parity-Check Codes”, IRE Transactions on Information Theory, vol. 7, pp. 21-28, 1962. D. J. C. MacKay, “Good error correcting codes based on very sparse matrices,” IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 399-431, 1999.
J. Chen, A. Dholakia, E. Eleftheriou, M.P.C. Fossorier, X.Y. Hu, “Reduced-Complexity Decoding of LDPC Codes,” IEEE Transactions on Communications, vol. 53, no. 8 pp. 1288-1299, 2005.
M. P. C. Fossorier, M. Mihaljevic, H. Imai, “Reduced Complexity Iterative Decoding of Low-Density Parity-Check Codes Based on Belief Propagation”, IEEE Transactions on Communications, vol. 47, no. 5, pp. 673-680, 1999.
S. Papaharalabos, P. Sweeney, B.G. Evans, P.T. Mathiopoulos, G. Albertazzi, A. Vanelli-Coralli, G.E. Corazza, “ModiŞed sum-product algorithms for decoding low-density parity-check codes,” IET Communications, vol. 1, no. 3, pp. 294-300, 2007. D.J.C. MacKay, “Online database of low-density parity-check codes,” http://www.inference.phy.cam.ac.uk/mackay/CodesFiles.html. N. Wiberg, “Codes and Decoding on General Graphs”, Ph.D. Dissertation, Link¨oping University, Link¨oping, Sweden, 1996.
J. Fan, Y. Xiao, “A Method of Counting the Number Cycles in LDPC Codes”, The 8thInternational Conference on Signal Processing, vol. 3, pp. 16-20, 2006.