Performance of Serial Concatenated Convolutional Codes according to the Concatenation Methods of Component Codes 


Vol. 27,  No. 1, pp. 18-25, Jan.  2002


PDF
  Abstract

In this paper, the performance of three types of serial concatenated convolutional codes (SCCC) in AWGN (additive white Gaussian noise) channel is compared and analyzed. As results of simulations, it can be observed that Type I shows the best error performance at lower signal-to-noise ratio (SNR) region. However, TypeⅢ shows the best error performance at higher SNR region. It can be also observed the error floor that the performance cannot be improved even though increasing of the number of iterations and SNR at Type I. However, the performance of Type Ⅱ and Type Ⅲ are still improved over the five iterations at higher SNR without error floor. And BER performance of three types can be closed to upper bound of three types with increase of SNR. It can be also observed that the upper bound of Type Ⅲ shows the best performance among the three types due to the greatest free distance.

  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]

S. J. Bae, S. H. Lee, E. K. Joo, "Performance of Serial Concatenated Convolutional Codes according to the Concatenation Methods of Component Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 1, pp. 18-25, 2002. DOI: .

[ACM Style]

Sang Jae Bae, Sang Hoon Lee, and Eon Kyeong Joo. 2002. Performance of Serial Concatenated Convolutional Codes according to the Concatenation Methods of Component Codes. The Journal of Korean Institute of Communications and Information Sciences, 27, 1, (2002), 18-25. DOI: .

[KICS Style]

Sang Jae Bae, Sang Hoon Lee, Eon Kyeong Joo, "Performance of Serial Concatenated Convolutional Codes according to the Concatenation Methods of Component Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 1, pp. 18-25, 1. 2002.