Performance Analysis of Turbo - Code with Random ( and s - random ) Interleaver based on 3 - Dimension Algorithm


The KIPS Transactions:PartA, Vol. 9, No. 3, pp. 295-300, Sep. 2002
10.3745/KIPSTA.2002.9.3.295,   PDF Download:

Abstract

In this paper, we apply the 3-dimension algorithm to the random interleaver and s-random interleaver and analyze the performance of the turbo code system with random interleaver (or s-random interleaver). In general, the performance of interleaver is determined by minimum distance between neighbor data, thus we could improve the performance of interleaver by increasing the distance of the nearest data. The interleaver using 3-dimension algorithm has longer minimum distance and average distance compared to existing random-interleaver (s-random interleaver) because the output data is generated randomly from 3-dimension storage. To verify and compare the performance of our proposed system, the computer simulations have been performed in turbo code system under gaussian noise environment.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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. Y. Kong and J. W. Choi, "Performance Analysis of Turbo - Code with Random ( and s - random ) Interleaver based on 3 - Dimension Algorithm," The KIPS Transactions:PartA, vol. 9, no. 3, pp. 295-300, 2002. DOI: 10.3745/KIPSTA.2002.9.3.295.

[ACM Style]
Hyung Yun Kong and Ji Woong Choi. 2002. Performance Analysis of Turbo - Code with Random ( and s - random ) Interleaver based on 3 - Dimension Algorithm. The KIPS Transactions:PartA, 9, 3, (2002), 295-300. DOI: 10.3745/KIPSTA.2002.9.3.295.