• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1218-1226
• /
• 1999

In decoding the turbo codes, the sliding window BCJR algorthm, derived from the BCJR algorithm, permits a continuous decoding of the coded sequence without requiring trellis fermination of the constituent codes and uses reduced memory span. However, the number of computation required is greater than that of BCJR algorithm and no study on the effect of the window length has been reported. In this paper, we propose an eddicient sliding window type scheme which maintains the advantages of the conventional sliding window algorithm, reduces its computational burdens, and improves is BER performance. A guideline is first presented to determine the proper window length and then a computationally efficient sliding window BCJR algorithm is obtained by allowing the window to be forwarded in multi-step. Simulation results show that the proposed scheme outperforms the conventional sliding window BCJR algorithm with reduced complexity. It gains 0.1dB SNR improvements over the conventional method for the constraint length 3 and BER $10^{-4}$

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.10
• /
• pp.67-74
• /
• 2007

Turbo code, a kind of channel coding technique, has ben used in the field of digital mobile communication system if the number of iterations is increased in the several channel environments, my further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. In this paper, it proposes an efficient stopping rules for the iteration process in turbo decoding. By using absolute mean values for the LLR difference values between the first and second decoder in the present decoding process, the proposed algorithm can largely reduce the average number of iterations without BER performance degradation in all SNR regions. As a result of simulation, the average number of iterations of proposed algorithm is reduced by about $18.25%{\sim}20.58%$ compared to SDR algerian in the lower SNR region, and is reduced by about $22.96%{\sim}28.74%$ compared to method using variance values of extrinsic information in the upper SNR region.

• 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%.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.597-600
• /
• 2000

Turbo Code는 반복 복호알고리듬을 사용함으로써 백색 가우시안 잡음(AWGN)채널 환경에서 Shannon의 한계에 가까운 성능을 보이는 오류정정 방식으로 제안되었다. 그러나 Turbo code는 반복복호로 인해 매복호시마다 큰 인터리버와 복호기를 거쳐야 하기 때문에 수신과정에서 커다란 지연을 요구하게 된다. 따라서 차세대 무선 멀티미디어 통신에서 실시간으로 음성서비스나 화상서비스를 제공하는데 어려움이 많다. 본 논문에서는 기존의 터보 복호기를 변형하여 매 복호시 각각의 복호기에서 출력시퀀스를 발생시킴으로서 반복 복호 횟수를 줄이는 방법을 제안하였다. 이렇게 함으로서 기존의 Turbo code가 갖는 성능은 크게 변화시키지 않으면서 각각의 정보프레임을 가변적으로 복호함으로서 반복복호로 인한 시간 지연을 줄일수 있었다.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.396-397
• /
• 2008

OFDM 송수신 시스템에서 채널성능을 개선하기 위해 CDD(Cyclic Delay Diversity) 기술을 적용하면, Frequency Interlea ving의 영향으로 인해 burst error가 randomize되어, convolutional code/Viterbi decoding FEC의 BER 성능개선 효과를 배가 할 수 있다. 그러나 차세대 통신시스템에 적극 활용되는 Turbo FEC는 자체 interleaving 구조를 가지고 있으므로, CDD기술과의 결합으로 인한 영향을 증명하기 위하여, 본 논문에서는 Turbo FEE를 사용하는 OFDM CDD시스템을 MATLAB을 이용한 computer simulation을 통해서 BER 성능을 비교분석 하였다.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.10
• /
• pp.158-163
• /
• 2006

In this paper, we considered the received signal of the wideband CDMA systems using turbo code in the multipath channel environments, and analyze the performance of the system. This study is to analyze the performance for the variable system bandwidth according to the number of branches of rake receiver by passing the received signal through a rake receiver with a turbo code in Rayleigh fading channel environments. For the design of receiver in wideband CDMA systems, we presented the efficient parameters for the number of iterative decoding and the number of branches of rake receiver.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1316-1319
• /
• 2002

In this paper, an online SNR estimator is derived for turbo coded multicode DS/SS systems in Nakagami fading channels. The multicode DS/SS approach is one of promising solutions to obtain higher-rate data transmission in DS/SS technologies. Turbo coding has paid much attention because of the significant improvements on error rate performances in various communication systems including multicode DS/SS systems. However, in the turbo decoding, channel state information, especially signal-to-noise ratio (SNR) at the correlator outputs, is desired in order to obtain such improvements. We evaluate the accuracy of the derived SNR estimation. It is shown that the bit error rate performance using our SNR estimation is close to the performance with perfect knowledge of channel state information.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.205-208
• /
• 2001

According to the IMT-2000 specification of 3GPP(3rd Generation Partnership Project) and 3GPP2, Turbo codes is selected as a FEC(forward error correction) code for even higher reliable data communication. In 3GPP complied IMT-2000 system, channel coding under consideration is the selective use of convolutional coding and Turbo codes of 1/3 code rate with 4 constraint length. Suggesting a new path metric normalization method, we achieved a low complexity and high performance SOVA decoder for Turbo Codes, Further more, we analyze the decoding performance with respect to update depth and find out the optimal value of it by using computer simulation. Based on the simulation result, we designed a SOVA decoder using VHDL and implemented it into the Altera EPF10K100GC503FPGA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.841-847
• /
• 2009

In this paper we propose a high-performance Hybrid ARQ scheme employing Chase combining based on LDPC (Low-Density Parity-Check) codes. The proposed scheme uses symbol mapping diversity and turbo demodulation to improve decoding performance. We analyze the performance of the proposed scheme by EXIT (EXtrinsic Information Transfer) chart and compare its performance with several symbol mappings.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.765-768
• /
• 2001

본 논문에서는 터보 TCM(Turbo Trellis Coded Modulation)에서 복호기 입력 전에 수신데이터를 이용하여 SNR을 추정하고, SNR에 따라 요구하는 성능을 만족하는 반복 복호수를 적응적으로 복호기 앞단에서 미리 설정하는 반복복호 제어기법을 제안한다. 성능분석결과 최대 반복 복호를 수행했을 때와 비교하여 성능 감소 없이 평균 반복 복호수를 줄일 수 있었다. 따라서 제안구조는 터보 TCM의 복호화 과정에서 문제점 중 하나인 복호 계산량과 지연을 성능 저하 없이 효율적으로 감소시킬 수 있다.