• Title/Summary/Keyword: turbo decoder

Search Result 153, Processing Time 0.027 seconds

Propose and Performance Analysis of Turbo Coded New T-DMB System (터보부호화된 새로운 T-DMB 시스템 제안 및 성능 분석)

  • Kim, Hanjong
    • Journal of Digital Convergence
    • /
    • v.12 no.3
    • /
    • pp.269-275
    • /
    • 2014
  • The DAB system was designed to provide CD quality audio and data services for fixed, portable and mobile applications with the required BER below $10^{-4}$. However for the T-DMB system with the video service of MPEG-4 stream, BER should go down $10^{-8}$ by adding FEC blocks which consist of the Reed-Solomon (RS) encoder/decoder and convolutional interleaver/deinterleaver. In this paper we propose two types of turbo coded T-DMB system without altering the puncturing procedure and puncturing vectors defined in the standard T-DMB system for compatibility. One(Type 1) can replace the existing RS code, convolutional interleaver and RCPC code by a turbo code and the other one (Type 2) can substitute the existing RCPC code by a turbo code. Simulation results show that two new turbo coded systems are able to yield considerable performance gain after just 2 iterations. Type 2 system is better than type 1 but the amount of performance improvement is small.

Design of a Low Power Turbo Decoder by Reducing Decoding Iterations (반복 복호수 감소에 의한 저전력 터보 복호기의 설계)

  • Back, Seo-Young;Kim, Sik;Back, Seo-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1C
    • /
    • pp.1-8
    • /
    • 2004
  • This paper proposes a novel algorithm for a low power turbo decoder based on reduction of number of decoding iterations, targeting power-critical mobile communication devices. Previous researches that attempt to reduce number of decoding iterations, such as CRC-aided and LLR methods, either show degraded BER performance in return for reduced complexity or require additional hardware resources for controlling the number of iterations to meet BER performance, respectively. The proposed algorithm can reduce power consumption without degrading the BER performance, and it is achieved with minimal hardware overhead. The proposed algorithm achieves this by comparing consecutive hard decision results using a simple buffer and counter. Simulation results show that the number of decoding iterations can be reduced to about 60% without degrading the BER performance in the proposed decoder, and power consumption can be saved in proportion to the number of decoding iterations.

Design of Viterbi Decoder for IMT-2000 (IMT-2000용 비터비 복호기의 효율적인 설계)

  • 정인택;송상섭
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.1
    • /
    • pp.67-72
    • /
    • 2001
  • Convolutional code and turbo code are used in the forward and backward link of IMT-2000. In this research, we will be in consideration of Viterbi algorithm In this paper, we design Viterbi decoder with 3-bits soft decision and SMT for the convolutional code in the forward link and backward link of IMT-2000 system. The major parameters of 3-bits Viterbi decoder is determined by simulation to have identical performance with the 4-bit soft decision Viterbi decoder.

  • PDF

Performance of Noise-Predictive Turbo Equalization for PMR Channel (수직자기기록 채널에서 잡음 예측 터보 등화기의 성능)

  • Kim, Jin-Young;Lee, Jae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.10C
    • /
    • pp.758-763
    • /
    • 2008
  • We introduce a noise-predictive turbo equalization using noise filter in perpendicular magnetic recording(PMR) channel. The noise filter mitigates the colored noise in high-density PMR channel. In this paper, the channel detectors used are SOVA (Soft Output Viterbi Algorithm) and BCJR algorithm which proposed by Bahl et al., and the outer decoder used is LDPC (Low Density Parity Check) code that is implemented by sum-product algorithm. Two kinds of LDPC codes are experimented. One is the 0.5Kbyte (4336,4096) LDPC code with the code rate of 0.94, and the other is 1Kbyte (8432,8192) LDPC code with the code rate of 0.97.

Independent Turbo Coding and Common Interleaving Method among Transmitter Branches Achieving Peak Throughput of 1 Gbps in OFCDM MIMO Multiplexing

  • Kawamoto, Junichiro;Asai, Takahiro;Higuchi, Kenichi;Sawahashi, Mamoru
    • ETRI Journal
    • /
    • v.26 no.5
    • /
    • pp.375-383
    • /
    • 2004
  • This paper proposes a common interleaving method associated with independent channel-encoding among transmitter antenna branches in orthogonal frequency and code division multiplexing based on multiple-input multiple-output (MIMO) multiplexing to achieve an extremely high throughput such as 1 Gbps using a 100 MHz bandwidth. This paper also investigates the average packet error rate performance as a function of the average received signal energy per bit-to-background noise power spectrum density ratio $(E_b/N_0)$. We found that the loss in the required average received $E_b/N_0$ of the proposed method is only within approximately 0.3 dB in up to a 12-path Rayleigh fading channel, using 16QAM and Turbo coding with a coding rate of 5/6. We also clarify that even for a large fading correlation among antenna branches, 1 Gbps is still possible by increasing the transmission power. Therefore, the proposed method reduces the processing rate to 1/4 in the turbo decoder with only a slight loss in the required average received $E_b/N_0$.

  • PDF

The Performance Estiamtion of Turbo Internal Interleaver Using Weight Distribution of Codewords (부호어의 무게 분포를 통한 터보 인터리버의 성능 분석)

  • 고태환;김주민;정덕진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3A
    • /
    • pp.173-179
    • /
    • 2002
  • In this paper, we suggest more precise performance analysis method of turbo interleavers based on two criteria; performance bounds like Union Bound and weight frequency of codewords. In order to present our new method, we employ block pseudo random, and so-called prime interleavers in compliance of 3GPP standard, respectively, We also applied this method to S-random interleavers that have different window size, S. 3GPP complied turbo encoder, decoder, and AWGN channel are implemented by using MATLAB for our performance analysis. According to our analysis, both criteria should be taken into account coincidently to predict the performance of newly designed interleavers.

Subsidiary Maximum Likelihood Iterative Decoding Based on Extrinsic Information

  • Yang, Fengfan;Le-Ngoc, Tho
    • Journal of Communications and Networks
    • /
    • v.9 no.1
    • /
    • pp.1-10
    • /
    • 2007
  • This paper proposes a multimodal generalized Gaussian distribution (MGGD) to effectively model the varying statistical properties of the extrinsic information. A subsidiary maximum likelihood decoding (MLD) algorithm is subsequently developed to dynamically select the most suitable MGGD parameters to be used in the component maximum a posteriori (MAP) decoders at each decoding iteration to derive the more reliable metrics performance enhancement. Simulation results show that, for a wide range of block lengths, the proposed approach can enhance the overall turbo decoding performance for both parallel and serially concatenated codes in additive white Gaussian noise (AWGN), Rician, and Rayleigh fading channels.

Simple Stopping Criterion Algorithm using Variance Values of Noise in Turbo Code (터보부호에서 잡음 분산값을 사용한 간단한 반복중단 알고리즘)

  • Jeong Dae-Ho;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.103-110
    • /
    • 2006
  • Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations Is increases in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of noise derived from mean values of LLR in turbo decoder, the proposed algorithm can largely reduce the computation and average number of iterations without BER performance degradation. As a result of simulations, the computation of the proposed algorithm is reduced by about $66{\sim}80%$ compared to conventional algorithm. The average number of iterations is reduced by about $13.99%{\sim}15.74%$ compared to CE algorithm and about $17.88%{\sim}18.59%$ compared to SCR algorithm.

A Study of FTN Method for Increasing Throughput based on DVB-S2 System (DVB-S2 기반의 전송량 증가를 위한 FTN 기법 연구)

  • Kim, Tae-hun;Kwon, Hae-chan;Jung, Ji-won;Choi, Myung Su;Park, Hee Man;Lee, Sung Ro
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.409-411
    • /
    • 2013
  • In this paper, we used FTN(Faster than Nyquist) method that is transmission method faster than Nyquist theory. FTN signaling introduces intersymbol interference(ISI), but increases the bit rate while preserving the signaling bandwidth. Therefore, we need compensating ISI caused by FTN. In this paper, we propose decoding method for FTN signal that using BCJR Equalizer and Turbo Equalization. first ISI of inputted signal is restored by BCJR Equalizer, and then restored signal inputted in LDPC decoder, and repeat the process using the Turbo Equalization improves performance. finally, we shows performance comparison according to reduce percentage of FTN signal.

  • PDF

The Design of High-Speed Turbo MAP Decoder using the Radix-4 method (Radix-4 방식의 고속 터보 MAP 복호기 설계)

  • 김상훈;정지원;고성찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.6B
    • /
    • pp.856-866
    • /
    • 2001
  • 본 논문에서는 radix-4 방식을 이용한 고속 터보 MAP 복호 알고리즘을 제안하고 이를 설계하기 위해 VHDL 모델링 하였다. VHDL 시뮬레이션을 하기 위해 radix-4 방식의 터보 MAP 복호기의 구조를 설계하였으며, 복호속도 효율성을 분석하기 위해 기존의 Radix-2 방식의 복호기도 VHDL 시뮬레이션 하였다. 구현 결과, 약 2.4배의 복호속도 향상을 알 수 있었다.

  • PDF