Performance Analysis of RS, Turbo and LDPC Code in the Binary Symmetric Erasure Channel 


Vol. 35,  No. 2, pp. 219-228, Feb.  2010


PDF
  Abstract

In this paper, performance of RS (Reed-Solomon), turbo and LDPC (low density parity check) code in the binary symmetric erasure channel is investigated. When the average erasure length is reduced, the frequency of short erasures is increased. The RS code shows serious performance degradation in such an environment since decoding is carried out symbol-by-symbol. As the erasure length is increased, however, the RS code shows much improved error performance. On the other hand, the message and corresponding parity symbols of the turbo code can be erased at the same time for the long erasures. Accordingly, iterative decoding of the turbo code can not improve error performance any more for such a long erasure. The LDPC code shows little difference in error performance with respect to the variation of the average erasure length due to the virtual interleaving effect. As a result, the LDPC code has much better erasure decoding performance than the RS and turbo code

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. T. Lim, M. J. Park, S. G. Kang, E. K. Joo, "Performance Analysis of RS, Turbo and LDPC Code in the Binary Symmetric Erasure Channel," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 2, pp. 219-228, 2010. DOI: .

[ACM Style]

Hyung Taek Lim, Myung Jong Park, Seog Geun Kang, and Eon Kyeong Joo. 2010. Performance Analysis of RS, Turbo and LDPC Code in the Binary Symmetric Erasure Channel. The Journal of Korean Institute of Communications and Information Sciences, 35, 2, (2010), 219-228. DOI: .

[KICS Style]

Hyung Taek Lim, Myung Jong Park, Seog Geun Kang, Eon Kyeong Joo, "Performance Analysis of RS, Turbo and LDPC Code in the Binary Symmetric Erasure Channel," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 2, pp. 219-228, 2. 2010.