Kody LDPC - konkurencja dla turbokodów

• Autorzy: Izydorczyk J. , Kucharczyk M. , Rutkowski J.

Warianty tytułu

EN

LDPC Codes - Competition for Turbo-Codes

• Języki publikacji: PL

Abstrakty

PL

Omówiono kody LDPC, które umożliwiają transmisję z prędkością binarną zbliżoną do przepływności kanału. Opisano podstawowe problemy związane z tworzeniem rzadkiej macierzy parzystości kodu, generacją słów kodowych oraz oparty o teorię grafów algorytm sumy iloczynów (SPA). Przedstawiono także praktyczne uwagi dotyczące kodowania i dekodowania z użyciem kodów LDPC oraz liczne odnośniki do literatury.

EN

The article presents LDPC codes, codes that enables transmission near to the Shannon limit. Fundamental problems releted to low-density parity-check matrix creation, coding of LDPC codes, graph theory based Sum-Product Algorithm are described. Practical comments about encoding and decoding by means of LDPC codes and numerous references can be found.

Słowa kluczowe

PL

kody blokowe; kody LDPC; granica Shannona; rzadka macierz parzystości; graf Tannera; algorytm SPA

EN

block kodes; LDPC codes; Sum Product Algorithm; spa

• Wydawca: Wydawnictwo SIGMA-NOT
• Czasopismo: Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne
• Rocznik: 2006
• Tom: nr 2-3
• Strony: 65--72
• Opis fizyczny: rys., Bibliogr. 26 poz.

Twórcy

autor

Izydorczyk J.

autor

Kucharczyk M.

autor

Rutkowski J.

• Zakład Telekomunikacji Politechniki Śląskiej Gliwice,

Bibliografia

• [1] Berrou C., Glavieux A., Thitimajshima P.: Near Shannon Limit Error- -Correcting Coding and Decoding: Turbo-Codes (1), Ecole Nationale Superieure des Telecommunications de Bretagne, IEEE International Conference on Communications, pp. 1064-1090, Geneva, Switzerland, May,1993
• [2] Shannon C. E.: Communication in the Presence of Noise, Proceedings of the l. R. E., Vol. 37, January 1949
• [3] Shannon C. E.: A Mathematical Theory of Communication, Bell Systems Technical Journal, Vol. 27, July, October 1948
• [4] MacKay D. J. C., Neal R. M.: Good Codes Based on Very Sparse Matrices, Cryptography and Coding 5th IMA Conference, Berlin, Germany, 1995
• [5] MacKay D. J. C., Neal R. M.: Near Shannon Limit Performance ofLow Density Parity Check Codes, Electronics Letters, Vol. 32, August 1996
• [6] Gallager R. G.: Low-Density Parity-Check Codes, IRE Transactions on Information Theory, Vol. IT-8, January 1962
• [7] Hahn S., Jarkowski J.: Turbokody - granica marzeń, Przegląd Telekomunikacyjny i Wiadomości Telekomunikacyjne, 4/2000
• [8] Gallager R. G.: Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963
• [9] MacKay D. J. C.: Good Error-Correcting Codes Based on Very Sparse Matrices, IEEE Transactions on Information Theory, Vol. 45, NO. 2, March1999
• [10] David MacKay's Gallager code resources, http://www.inference. phy.cam.ac.uk/mackay/CodesFiles.html
• [11 ] Ardakani M., Esmailian T., Kschischang F. R.: Near-Capacity Coding in Multicarrier Modulation Systems, IEEE Transactions on Communications, Vol. 52, No. 11, November 2004
• [12] Kucharczyk M.: Data Error Correction in Transmission System with OFDM Modulation, Proceedings of IFAC Workshop on Programmable Devices and Systems (PDS 2004), Gliwice, Poland, November 18-19, 2004
• [13] Richardson T. J., Shokrollahi M. A., Urbanke R. L: Design ofCapacity- Approaching liregular Low-Density Parity-Check Codes, IEEE Transactions on Information Theory, Vol. 47, No. 2, February 2001
• [14] Chung S.-Y., Forney G. D., Jr., Richardson T. J., Urbanke R. L: On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit, IEEE Communications Letters, Vol. 5, No. 2, February 2001
• [15] Wiberg N.: Codes and Decoding on General Graphs, PhD thesis, Department of Electrical Engineering, Linkóping University, S-581 83 Linkóping, Sweden, 1996
• [16] Kschischang F. R., Frey B. J., Loeliger H.-A.: Factor Graphs and the Sum-ProductAlgorithm, IEEE Signal Processing Magazine, Vol. 21, No. 1, January 2004
• [17] Forney G. D., Jr.: Codes on Graphs: Normal Rea/izations, IEEE Transactions on Information Theory, Vol. 47, No. 2, February 2001
• [18] Lin S., Costello D. J., Jr.: Error Control Coding: Fundamentals and Applications, Prentice-Hall, Inc., Englewood Cliffs, New Jersey 07632, 1983
• [19] Neal R. M.: Sparse MatrixMethods andProbabilistic Inference Algorithms, Part 1: Faster Encoding for Low-Density Parity-Check Codes Using Sparse Matrix Methods, IMA Summer Program: Codes, Systems and Graphical Models, Week 1: Codes on Graphs and Iterative Decoding, Minneapolis, USA, August 2-13, 1999
• [20] Richardson T. J., Urbanke R. L.: Efficient Encoding of Low-Density Parity-Check Codes, IEEE Transactions on Information Theory, Vol. 47, No. 2, February 2001
• [21] Chen J., Dholakia A., Eleftheriou E., Fossorier M. P. C., Hu X.-Y.: Reduced-Complexity Decoding of LDPC Codes, IEEE Transactions on Communications, Vol. 53, No. 8, August 2005
• [22] Loeliger H. -A.: Ań Introduction to Factor Graphs, IEEE Signal Processing Magazine, Vol. 12, No. 1, January 2004
• [23] Moura J. M. F., Lu J., Zhang H.: Structured Low-Density Parity-Check Codes, IEEE Signal Processing Magazine, Vol. 12, No. 1, January 2004
• [24] Koetter R., Singer A. C., Tuchler M., Turbo Equalization, IEEE Signal Processing Magazine, Vol. 12, No. 1, January 2004
• [25] Song H., Kumar V.: Low-Density Parity-Check Codes for Partial Response Channels, IEEE Signal Processing Magazine, Vol. 21, No. 1, January 2004
• [26] Summers T.: LDPC: Another Key Step Toward Shannon, Comms- Design, http://www.commsdesign.com/showArticle.jhtml7article- 10=49901136