• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.861-868
• /
• 2001

In this paper, the performance of Reed Solomon(RS)/convolution리 concatenated codes and turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When turbo code using semi random interleaver and Hsiconvolutional concatenated codes was constant constraint length L=5, BER=10-4 , each value of $E_b/N_o$ was 4.5〔dB〕 and 2.95〔dB〕. Therefore, when the constraint length was constant, we proved that the performance of turbo code is superior to RS/Convolutional concatenated codes about 1.55〔dB〕 in the case of BER=10-4.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1184-1189
• /
• 2001

In this paper was analyzed the performance of turbo code using semi-random interleaver which proposed a reference numbers 11. Which was analyzed comparison the performance of between the current mobile communication system had been used the viterbe decoding algorithm of convolutional code and turbo codes when fixed constraint length. The result was defined that the performance of turbo code rose a $E_{b/}$ $N_{o}$=4.7[㏈] than convolutional code, when convolutional code and turbo code was fixed by BER = 10$^{-4}$ and constraint length K 5.5.5.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.536-541
• /
• 2000

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 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 preexisting method such as block, helical random interleaver.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2473-2483
• /
• 2000

In this paper, The turbo code is used to effectively remove noise which is generated on the image communication channel. Turbo code had excellent decoding performance. However, it had limitations for real time communication because of the system complexity and time delay in decoding procedure. To overcome this problem, this paper proposed a new SRI(Semi Random Interleaved algorithm, which decrease the time delay, when the image data, which reduced the interleaver size of turbo code encoder and decoder, transmitted. The SRI algorithm was composed of 0.5 interleaver size from input frame sequence. When the data inputs in interleaver, the data recorded by row such as block interleaver. But, When the data read in interleaver, the data was read by randomly and the next data located by the just address simultaneously. Therefore, the SRI reduced half-complexity when it was compared with pre-existing method such as block, helical, random interleaver. The image data could be the real time processing when the SRI applied to turbo code.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.1067-1075
• /
• 2000

In this paper, the performance of turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When the constraint length of turbo code using seim random interleaver and convolutional code is constant, and BER $10^{-4}$ each value of $E_b/N_o$ was 6.4(DB) and 1.7(dB). There(ore, when the constraint length was constant, we proved that the performance of turbo code using semi random interleaver is superior to convolutional code about 4.7(dB) in the case of BER=$10^{-4}$.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.857-864
• /
• 2002

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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.3B
• /
• pp.369-374
• /
• 2001

본 논문에서는 터보코드의 설계를 위한 새로운 일터리버 방식(3차원 블록 인터리버)을 소개한다. 3차원 블록 인터리버는 같은 블록크기를 가지는 2차원의 블록 인터리버보다 최소 비트간의 거리를 크게 할 수 있는 방버븡로, 3 차원 인터리빙 알고리즘에 의해 계산된 주소 값을 이용하여 입/출력 데이터의 순서를 조절함으로서 데이터의 비트 거리 특성을 향상시킨 것이다. 터보코드는 데이터 율, 부호기의 구속장의 길이, 복호방식, 순환복호의 횟수 등 여러 가지 요소들에 의해 성능이 좌우되며, 특히 인터리버의 종류 및 크기의 선택에 따라서 성느의 차이를 보인다. 컴퓨터 시뮬레이션을 이용하여 3차원 블록 인터리버의 성능을 분석하였으며, 전송 환경을 가우시안 및 비가우시간 채널로 설정하였다.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.295-300
• /
• 2002

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.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.73-80
• /
• 2003

In this paper, we propose a ETD-turbo code(Enhanced Time Diversity turbo code) which is a novel turbo code configuration to increase the time diversity effect and analyze the performance of ETD-turbo coded MC-CDMA system. The ETD-turbo code, which is added another interleaver to the conventional turbo code structure, is consisted. Time diversity effect of the ETD-turbo code is improved by every parity bits converted into interleaver pattern. In order to the performance of the ETD-turbo code, we conduct a computer simulation about interleaver type. And we make comparison between the performance of ETD-turbo coded MC-CDMA system and the conventional turbo coded MC-CDMA system. By the simulation results, ETD-turbo code has less BER than the conventional turbo code and time delay is decreased by reducing iteration numbers. Therefore, it is defined that the performance of ETD-turbo coded MC-CDMA system is improved than the conventional turbo coded MC-CDMA system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.678-681
• /
• 2004

본 연구에서는 IMT-2000방식 중 WCDMA(Wideband Code Division Multiple Access)방식의 터보코드에 대해 연구하였으며 터보 코드에 사용하는 인터리버 중 신호대 잡음비 성능이 가장 좋은 GF 인터리버와 터보 코드의 단점 중에 하나인 처리하는 동안 걸리는 지연 시간을 보완하기 위하여 핑퐁 램을 사용하였다. 핑퐁 램을 사용함으로써 최초에 소스 데이터 입력 때 만 지연이 생기고 그 이후에는 연속적으로 데이터를 출력 할 수 있는 장점을 얻었다. 그리고 C언어를 이용한 최적화된 시뮬레이션과 터보 코드의 성능평가를 통한 최적화를 실시하였다. 그리고 최적화된 정보를 바탕으로 터보코드를 VHDL언어를 이용하여 설계하고, Xilinx Vertex 1000E(XCV1000E)-PQ240칩을 이용한 테스트 보드에 다운로드 후 PCI인터페이스를 통한 시뮬레이션을 구현하였다.