• Information and Communications Magazine
• /
• v.24 no.4
• /
• pp.83-94
• /
• 2007

터보 부호는 AWGN 환경에서 비교적 간단한 복호 알고리즘을 가지면서 낮은 신호대 잡음비에서 뛰어난 에러 성능을 보이는 채널부호이다. 터보 부호는 기본적으로 길쌈 부호를 병렬 연접하는 방식으로, 두 개 이상의 구성 부호화기에 같은 시퀀스의 서로 다른 배열을 적용하는 것이다. 본 논고에서는 터보 부호화 및 복호화의 기본 원리에 대하여 설명하고, 이를 여러 형태의 무선 채널에 적용하는 기술에 대하여 언급하고자 한다. 그리고 연구 방향에 대하여 간략히 제시하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.426-433
• /
• 2006

In this paper, we propose an incremental redundancy(IR)-hybrid ARQ(HARQ) scheme which uses double binary turbo codes for error correction. We also propose a methodology for basic analysis of the throughput which is a performance index of HARQ. The proposed double binary turbo IR-HARQ scheme provides higher throughput than binary IR-HARQ, which uses binary turbo codes for error correction, at all $E_s/N_0$. An extra coding gain is also attained by using the proposed HARQ scheme over the coding gain achieved by turbo codes only.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10A
• /
• pp.1782-1793
• /
• 2001

터보부호 심벌비트들을 서로 다른 부호율로 반복부호화한 뒤 여러 부채널로 나란히 보내는 터보 부호화 여러반송파 직접수열 부호분할 다중접속 시스템을 제안한다. 레일리 감쇄채널에서 신호대잡음비가 높을 때에는 이 시스템의 성능 한계를 얻었고, 신호대잡음비가 낮아 한계를 적용할 수 없을 때에는 모의실험에서 성능을 살펴보았다. 신호대잡음비가 낮을 때 성능 손실이 조금 있지만 홀짝 검사(parity check) 심벌에 다양성 차수를 크게 주어 오류 마루를 (error floor) 낮출 수 있음을 보였다.

• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1322-1328
• /
• 2001

본 논문에서는 무선 ATM 환경에서 터보코딩을 이용한 UEP(Unequal Error Protection)을 제안한다. 일반적으로 ATM셀의 header 부분은 payload 부분보다 중요시되며 header 부분에 payload 보다 부호율이 낮은 터보코드를 무선 ATM 적용하여 비트오류확률과 셀손실 확률을 구하였다. 무선 ATM 환경에서 터보코드를 사용하고 프레임길이 28바이트의 DLC 셀구조에서 UEP가 가능함을 보였다. 부호율 1/3인 터보 코딩을 이용한 경우 동일한 부호율의 컨벌루션 코드를 이용한 EEP(Equal Error Protection)과 비교하여 비트 오류확률과 셀 손실율에 있어서 최소 1dB와 2dB 신호대잡음비의 개선을 보였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.39-44
• /
• 2009

It is well-known that the performance of turbo codes can be improved by allocating different energies per code symbol. In this paper, based on this observation, we propose a joint encoding and modulation scheme for quadrature amplitude modulated turbo code systems. In the proposed scheme, the amount of energy difference between the turbo coded symbols is optimized by optimizing the constellation of quadrature amplitude modulation (QAM). The proposed scheme offers better coding gain compared to the conventional combination of binary turbo code and QAM at the bit error rate of 10$^{-5}$. Also, the performance of binary turbo codes with the proposed QAM constellation for various code symbol mapping strategies are verified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9C
• /
• pp.537-545
• /
• 2011

This paper analyzed performance of three dimensional turbo code and turbo ${\Phi}$ codes proposed in the next generation DVB-RCS systems. In the view of turbo ${\Phi}$ codes, we proposed the optimal permutation and puncturing patterns for triple binary input data. We also proposed optimal post-encoder types and interleaving algorithm for three dimensional turbo codes. Based on optimal parameters, we simulated both turbo codes, and we confirmed that the performance of turbo ${\Phi}$ codes are better than that of three dimensional turbo codes. However, the complexity of turbo ${\Phi}$ is more complex than that of three dimensional turbo codes by 18%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.219-228
• /
• 2010

In this paper, performance of RS (Reed-Solomon), turbo and LDPC (low density parity check) code in the binary symmetric erasure channel is investigated. When the average erasure length is reduced, the frequency of short erasures is increased. The RS code shows serious performance degradation in such an environment since decoding is carried out symbol-by-symbol. As the erasure length is increased, however, the RS code shows much improved en-or performance. On the other hand, the message and corresponding parity symbols of the turbo code can be erased at the same time for the long erasures. Accordingly, iterative decoding of the turbo code can not improve error performance any more for such a long erasure. The LDPC code shows little difference in error performance with respect to the variation of the average erasure length due to the virtual interleaving effect. As a result, the LDPC code has much better erasure decoding performance than the RS and turbo code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.533-539
• /
• 2002

It is well known the fact that turbo lodes has better performance as the number of iteration and the interleaver size increases in the AWGN channel environment. However, as the number of iteration and the interleaver size are increased, it is required much delay and computation for iterative decoding, and caused the flattening effect phenomenon which is very litter BER performance improvement at the arbitrary SNR. In this paper, We proposed the new asymmetric turbo codes, which consist of parallel concatenated turbo codes that use mixed types of component codes with different not only constraint length but also generate polynomial and analyzed its BER performance for log-MAP decoding algorithm with frame size of 128, 256, 512 and 1024 bits, and coding rate of 1/3. As a results of simulation, proposed asymmetric turbo codes verify that its BER performance is superior to conventional symmetric turbo codes. It can be also observed that the flattening effect phenomenon is very reduced by applying the proposed asymmetric turbo codes. It gains respectively 1.7dB ~2.5dB and 2.0dB~2.5dB SNR improvements in the case of short frame(128, 256) and large frame(512, 1024) size for the BER $10_{-4}$>/TEX> region.

• 한국ITS학회:학술대회논문집
• /
• 2008.11a
• /
• pp.132-136
• /
• 2008