The Presentation of Semi - Random Interleaver Algorithm for Turbo Code


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 2, pp. 536-541, Feb. 2000
10.3745/KIPSTE.2000.7.2.536,   PDF Download:

Abstract

Turbo code has excellent decoding performance but had limitations for real time communications because of the system complexity and time delay in decoding procedure. To overcome this problem, a new SRI(Semi-Random Interleaver) algorithm which realize the reduction of the interleaver size is proposed for reducing the time delay during the decoding prodedure. SRI algorithm compose the interleaver 0.5 size from the input data sequence. In writing the interleaver, data is recorded by row such as block interleaver. But, in reading, data is read by randomly and the text data is located by the just address simultaneously. Therefore, the processing time of with the pre-existing method such as block, helical, random interleaver.


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]
S. W. Hong and J. S. Park, "The Presentation of Semi - Random Interleaver Algorithm for Turbo Code," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 2, pp. 536-541, 2000. DOI: 10.3745/KIPSTE.2000.7.2.536.

[ACM Style]
Sung Won Hong and Jin Soo Park. 2000. The Presentation of Semi - Random Interleaver Algorithm for Turbo Code. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 2, (2000), 536-541. DOI: 10.3745/KIPSTE.2000.7.2.536.