Performance Analysis of Turbo Code with Block Interleaver using Hopping Method


The KIPS Transactions:PartC, Vol. 9, No. 6, pp. 857-864, Dec. 2002
10.3745/KIPSTC.2002.9.6.857,   PDF Download:

Abstract

Channel coding is one of the most important things to improve digital communications. In this paper, we analyze the performance of turbo code with block interleaver using hopping algorithm (i. e., non-linear interleaver) for high speed multi-media service. The input and output of conventional block interleaver is achieved by the order of column and row, but hoping algorithm is achieved by hopping the column and row that increase the minimum distance and average distance between the nearest data dually. To verify and compare the performance of an proposed method the computer simulation have been performed using turbo code in gaussian channel 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, "Performance Analysis of Turbo Code with Block Interleaver using Hopping Method," The KIPS Transactions:PartC, vol. 9, no. 6, pp. 857-864, 2002. DOI: 10.3745/KIPSTC.2002.9.6.857.

[ACM Style]
Hyung Yun Kong. 2002. Performance Analysis of Turbo Code with Block Interleaver using Hopping Method. The KIPS Transactions:PartC, 9, 6, (2002), 857-864. DOI: 10.3745/KIPSTC.2002.9.6.857.