Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2002.9A.3.295

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

Kong, Hyung-Yun (Dept. of Electronics, University of Ulsan)
Choi, Ji-Woong (Dept. of Electronics, Graduate School of Ulsan University)
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.
Keywords
3-Dimension algorithm; minimum distance; s-random Interleaver;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Bernard Sklar, 'DIGITAL COMMUNICATIONS,'Second Ed. Prentice Hall, pp.461-477, 2001
2 John G. Proakis, 'DIGITAL COMMUNICATIONS,' Third Ed. McGraw-Hill, 1995
3 Mustafa Eroz, A. Roger Hammons Jr., 'On The Design of Prunable Interleavers for Turbo Codes,' Vehicular Technology Conference, IEEE 49th, Vol.12, pp.1669-1673, 1999   DOI
4 Charles C. Wangs, 'On the Performance of Turbo codes,' Military Communications Conference, 1998. MILCOM 98, Vol.3, pp.987-992, 1998
5 Johan Hokfelt, Ove Edfors and Torleiv Maseng, 'Interleaver design for turbo codes based on the performance of iterative decoding,' ICC'99, IEEE International Conference on Communications, Vol.1, pp.93-97, 1999   DOI
6 공형윤, 이창희, '새로운 블록 인터리버를 이용한 터보코드의 성능 분석,' 2000년도 한국통신학회 하계종합학술대회, pp.645-648, 2000