Performance of Non-Binary LDPC Codes for Next Generation Mobile Systems

• Autorzy: Gierszal H. , Hołubowicz W. , Kiedrowski Ł. , Flizikowski A.
• Języki publikacji: EN

Abstrakty

EN

A new family of non-binary LDPC is presented that are based on a finite field GF(64). They may be successfully implemented in single-carrier and OFDM transmission system. Results prove that DAVINCI codes allow for improving the system performance and may be considered to be applied in the future mobile system.

Słowa kluczowe

EN

LDPC; mobile systems; modulation schemes; non-binary

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2010
• Tom: Vol. 56, No. 2
• Strony: 111--116
• Opis fizyczny: Bibliogr. 21 poz., wykr.

Twórcy

autor

Gierszal H.

autor

Hołubowicz W.

autor

Kiedrowski Ł.

autor

Flizikowski A.

• Adam Mickiewicz University, Poznań, Poland

Bibliografia

• [1] L. Barnault and D. Declercq, “Fast decoding algorithm for LDPC over GF(2q),” in Proc. IEEE Information Theory Workshop, Paris, France, 2003.
• [2] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” in Proc. IEEE International Conference on Communications, Geneve, Switzerland, May 1993, pp. 1064–1070.
• [3] G. Caire, G. Taricco, and E. Biglieri, “Bit-interleaved coded modulation”, IEEE Transactions on Information Theory, vol. 44, no. 3, pp. 927–946, May 1998.
• [4] M. C. Davey, “Error-correction using low density parity check codes”, Ph.D. thesis, Cambridge.
• [5] M. Davey and D. MacKay, “Low density parity check codes over GF (q),” in Proc. Information Theory Workshop, Killarney, Ireland, 1998, pp. 70–71.
• [6] D. Declercq and M. Fossorier, “Decoding algorithms for nonbinary LDPC codes over GF(q),” IEEE Transactions on Communications, vol. 55, April 2007, pp. 633–643.
• [7] R. G. Gallager, “Low density parity check codes,” Ph.D. thesis, MIT, Cambridge, Mass., September 1960.
• [8] R. G. Gallager, “Low-Density Parity-Check Codes,” IEEE Transactions on Information Theory, pp. 21–28, Jan. 1962.
• [9] X. Y. Hu and E. Eleftheriou, “Binary representation of cycle Tannergraph GF(2q) codes,” in Proc. IEEE International Conference on Communications, Paris, France, June 2004, pp. 528–532.
• [10] INFSO-ICT-216203 DAVINCI, “D2.2.1 Link Level Evaluation,” November 2008.
• [11] INFSO-ICT-216203 DA VINCI, “D4.1 Benchmark Non Binary LDPC codes: Report and Software (C-ANSI)”, July 2008.
• [12] D. J. C. MacKay and R. M. Neal, “Good codes based on very sparse matrices,” in Lecture otes in Computer Science, Cryptography and Coding, vol. 1025/1995, Berlin/Heidelberg: Springer, 1995, pp. 100-111.
• [13] Madhurima Potluri, “Distributed Source Coding using Non Binary LDPC,” M.Sc. thesis, Visweswaraiach Technological University, India, 2005.
• [14] L. Ping and W. K. Leung, “Decoding low density parity check codes with finite quantization bits,” IEEE Communications Letters, vol. 4, no. 2, Feb. 2000, pp. 62–64.
• [15] M. F. C. Poulliat and D. Declercq, “Design of regular (2,dc)-LDPC codes over GF(q) using their binary images,” IEEE Transactions on Communications, vol. 56, October 2008, pp. 1626–1635.
• [16] R. M. Tanner, “A Recursive Approach to Low Complexity Codes,” IEEE Transactions on Information Theory, vol. 27, 1981, pp. 533–547.
• [17] D. D. A. Venkiah and C. Poulliat, “Design of cages with a randomized progressive edge growth algorithm,” IEEE Communications Letters, vol. 12, April 2008, pp. 301–303.
• [18] A. Voicila, D. Declercq, F. Verdier, M. Fossorier, and P. Urard, “Lowcomplexity decoding algorithm for non-binary LDPC codes in high order fields,” IEEE Transactions on Communications, 2008.
• [19] A. Voicila, D. Declercq, F. Verdier, M. Fossorier, and P. Urard, “Low complexity, low memory EMS algorithm for non-binary LDPC codes,” in Proc. International Conference on Communications, Glasgow, UK, June 2007, pp. 671–676.
• [20] A. Voicila, F. Verdier, D. Declercq, M. Fossorier, and P. Urard, “Architecture of a low-complexity non-binary LDPC decoder for high order fields”, in Proc. 7th International Symposium on Communications and Information Technologies, Sydney, Australia, October 2007.
• [21] H. S. H. Wymeersch and M. Moeneclaey, “Log-domain decoding of LDPC codes over GF(q),” in Proc. IEEE International Conference on Communications, Paris, France, June 2004, pp. 772–776.