Journals / Fırat Üniversitesi Fen ve Mühendislik Bilimleri Dergisi / 2007 / Cilt: 19 - Sayı: 1

A decoding algorithm for low-density parity-check codes and measuring the performance of the low-density parity-check codes over the additive white Gaussian noise chanell

Düşük yoğunluklu eşlik denetim kodlarına ait kod çözme algoritması ve toplanır beyaz Gauss gürültü kanalındaki kod başarımının bilgisayar benzetimi ile ölçülmesi

Pages
73–78
Publication Date
2022-10-17
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

As a result, it was observed that the code performance significantly increases, as the length of the codewords and the number of iterations increase.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, a decoding algorithm of the low-density parity-check codes that was presented by Gallager is analyzed.
📊
Key Findings & Data:A computer simulation is used to measure the code performance of the low-density parity- check codes with this algorithm over the additive white Gaussian noise channel by using different length codewords.
💡
Conclusion & Impact:As a result, it was observed that the code performance significantly increases, as the length of the codewords and the number of iterations increase.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this study, a decoding algorithm of the low-density parity-check codes that was presented by Gallager is analyzed. A computer simulation is used to measure the code performance of the low-density parity- check codes with this algorithm over the additive white Gaussian noise channel by using different length codewords. As a result, it was observed that the code performance significantly increases, as the length of the codewords and the number of iterations increase.

Özet

Bu çalışmada Gallager tarafından sunulan düşük yoğunluklu eşlik denetim kodlarına ait bir kod çözme algoritması incelenmiştir. Kullanılan algoritma yardımıyla düşük yoğunluklu eşlik denetim kodlarının toplanır beyaz Gauss gürültüsünün etkilediği kanaldaki kod başarımı bilgisayar benzetimi yardımıyla farklı uzunluktaki kod sözcükleri kullanılarak hesaplatılmıştır. Sonuçta, kod sözcüğü uzunluğu ve döngü sayısı arttıkça, kod başarımının önemli ölçüde arttığı görülmüştür.

🔖

Cite This Article

KALAYCIOĞLU, A. (2022). A decoding algorithm for low-density parity-check codes and measuring the performance of the low-density parity-check codes over the additive white Gaussian noise chanell. Fırat Üniversitesi Fen ve Mühendislik Bilimleri Dergisi, Cilt: 19 - Sayı: 1, 73–78. https://ajindex.com/articles/513492

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (5)

  1. Shannon C. E., (1948). A Mathematical Theory of Communication, The Bell System Technical Journal, Vol.11., 379-423
  2. Berrou C., Glavieux A.,Thitimajshima P. (1999). Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes (1), IEEE International Conference on Communications, 1064-1070
  3. Mackay D. J. C, (1999). Good Error Correcting Codes Based on Very Sparse Matrices, IEEE Transactions on Information Theory, Vol.45, 399-431
  4. Gallager R. G., (1962). Low-Density Parity- Check Codes, IRE Transactions on Information Theory, 21-28
  5. Richardson T. J., Urbanke R. L., (2001). The Capacity of Low-Density Parity-Check Codes Under Message Passing Decoding, IEEE Transactions on Information Theory, Vol.47, No:2, 599-618. 6.Richardson T. J., Shokrollahi M. A., Urbanke R. L., (2001). Design of Capacity Approaching Irregular Low-Density Parity-Check Codes, IEEE Transactions on Information Theory, Vol.41, No:2, 619-637. 7.Hagenauer J., Offer E., Papke L., (1996). Iterative Decoding of Binary Block and Convolutional Codes, IEEE Transactions on Information Theory, Vol.42, No:2, 429-445. 8.Kalaycıoğlu, A. (2005). Düşük yoğunluklu eşlik denetim kod başarımının, toplanır beyaz Gauss gürültü kanalında ve simgeler arası karışım içeren sönümlü kanalda, bilgisayar benzetimi ile ölçülmesi. Yüksek Lisans Tezi, Ankara Üniversitesi Fen Bilimleri Enstitüsü, 69s. 9.Dallas Semiconductor, (2000). HFTA-05.0: Statistical Confidence Levels for Estimating BER Probability, Application Note 703, http://pdfserv. maxim-ic. com/en/an/AN703.pdf 1-7.