Performance Analysis of Turbo Product Code Using Parallel Structure 


Vol. 29,  No. 2, pp. 181-186, Feb.  2004


PDF
  Abstract

Recently, there has been intensive focus on Turbo Product Codes(TPCs) which have low decoding complexity and achieve near-optimum performances at high code-rate. This paper present a parallel algorithm of turbo product codes enable simultaneous decoding of row and column. The row and column decoders operate in parallel and update each other after row and column has been decoded. simulation results show that the performance of proposed parallel turbo code is almost the same as that conventional scheme for several turbo product codes.

  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]

T. Lee and J. Jung, "Performance Analysis of Turbo Product Code Using Parallel Structure," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 2, pp. 181-186, 2004. DOI: .

[ACM Style]

Tae-Gil Lee and Ji-Won Jung. 2004. Performance Analysis of Turbo Product Code Using Parallel Structure. The Journal of Korean Institute of Communications and Information Sciences, 29, 2, (2004), 181-186. DOI: .

[KICS Style]

Tae-Gil Lee and Ji-Won Jung, "Performance Analysis of Turbo Product Code Using Parallel Structure," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 2, pp. 181-186, 2. 2004.