• Please send your full manuscript to: jocm@vip.163.com

Monte Carlo Simulations of Infinite Shortened Non-Binary LDPC Codes

Panyawat Techo, Virasit Imtawil, and Puripong Suthisopapan
Department of Electrical Engineering, Khon Kaen University, Thailand
Abstract—Shortening is a technique that can be used for constructing rate-compatible low-complexity LDPC codes. However, minimum SNR required to achieve error free decoding in the case of long block length, known as decoding threshold, for shortened LDPC code has not been reported. This motivates us to slightly modify the Monte Carlo simulation originally invented M. Davey to compute decoding threshold of the shortened LDPC codes. From the simulation results, we found that decoding threshold of shortened LDPC codes based on uniform shortening algorithm is identical to conventional LDPC codes designed for specific coding rate. Moreover, the number of iteration used to achieve successful decoding of shortened code and conventional code are slightly different.

Index Term—Monte carlo simulation, uniform shortening algorithm, non-uniform shortening algorithm, decoding threshold

Cite: Panyawat Techo, Virasit Imtawil, and Puripong Suthisopapan, "Monte Carlo Simulations of Infinite Shortened Non-Binary LDPC Codes," Journal of Communications, vol. 14, no. 7, pp. 601-606, 2019. Doi: 10.12720/jcm.14.7.601-606
Copyright © 2013-2019 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com