• Title/Summary/Keyword: Turbo decoding

Search Result 217, Processing Time 0.023 seconds

The Optimal Turbo Coded V-BLAST Technique in the Adaptive Modulation System corresponding to each MIMO Scheme (적응 변조 시스템에서 각 MIMO 기법에 따른 최적의 터보 부호화된 V-BLAST 기법)

  • Lee, Kyung-Hwan;Ryoo, Sang-Jin;Choi, Kwang-Wook;You, Cheol-Woo;Hong, Dae-Ki;Kim, Dae-Jin;Hwang, In-Tae;Kim, Cheol-Sung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.6 s.360
    • /
    • pp.40-47
    • /
    • 2007
  • In this paper, we propose and analyze the Adaptive Modulation System with optimal Turbo Coded V-BLAST(Vertical-Bell-lab Layered Space-Time) technique that adopts the extrinsic information from MAP (Maximum A Posteriori) Decoder with Iterative Decoding as a priori probability in two decoding procedures of V-BLAST; the ordering and the slicing. Also, we consider and compare the Adaptive Modulation System using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme and the Adaptive Modulation System using conventional Turbo Coded V-BLAST technique that is decoded by the ML (Maximum Likelihood) decoding algorithm. We observe a throughput performance and a complexity. As a result of a performance comparison of each system, it has been proved that the complexity of the proposed decoding algorithm is lower than that of the ML decoding algorithm but is higher than that of the conventional V-BLAST decoding algorithm. however, we can see that the proposed system achieves a better throughput performance than the conventional system in the whole SNR (Signal to Noise Ratio) range. And the result shows that the proposed system achieves a throughput performance close to the ML decoded system. Specifically, a simulation shows that the maximum throughput improvement in each MIMO scheme is respectively about 350 kbps, 460 kbps, and 740 kbps compared to the conventional system. It is suggested that the effect of the proposed decoding algorithm accordingly gets higher as the number of system antenna increases.

The performance estimation of Channel coding schemes in Wideband Code Division Multiple Access System with fading channel (페이딩 환경의 W-CDMA에서 채널부호화 방식의 성능평가)

  • 이종목;심용걸
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.165-168
    • /
    • 2000
  • The bit error rate(BER)of the data passed through Wideband-Code Division Multiple Access (W-CDMA) system with turbo-codes structure is presented. The performance of turbo-codes under W-CDMA system is estimated for various users and iteration numbers of decoding. The channel model is Additive White Gaussian Noise(AWGN) and Rayleigh fading channel. When iteration number increases, bit error probability of turbo-codes decreases. and when the number of users increase, bit error probability of turbo-codes increases.

  • PDF

Low Latency Algorithms for Iterative Codes

  • Choi, Seok-Soon;Jung, Ji-Won;Bae, Jong-Tae;Kim, Min-Hyuk;Choi, Eun-A
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3C
    • /
    • pp.205-215
    • /
    • 2007
  • This paper presents low latency and/or computation algorithms of iterative codes of turbo codes, turbo product codes and low density parity check codes for use in wireless broadband communication systems. Due to high coding complexity of iterative codes, this paper focus on lower complexity and/or latency algorithms that are easily implementable in hardware and further accelerate the decoding speed.

Piecewise Phase Recovery Algorithm Using Block Turbo Codes for Next Generation Mobile Communications

  • Ryoo, Sun-Heui;Kim, Soo-Young;Ahn, Do-Seob
    • ETRI Journal
    • /
    • v.28 no.4
    • /
    • pp.435-443
    • /
    • 2006
  • This paper presents an efficient carrier recovery algorithm combined with a turbo-coding technique in a mobile communication system. By using a block turbo code made up of independently decodable block codes, we can efficiently recover the fast time-varying carrier phase as well as correct channel errors. Our simulation results reveal that the proposed scheme can accommodate mobiles with high speed, and at the same time can reduce the number of iterations to lock the phase.

  • PDF

Experiment performance analysis of turbo code based turbo equalizer (터보 부호 기반의 터보 등화기 실험 성능 분석)

  • Park, Gun-woong;Jung, Ji-won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.7
    • /
    • pp.1525-1530
    • /
    • 2015
  • In this paper, We analyzed the performance of turbo equalizer using turbo codes thorough the under water experiment. To compensate the distorted signal induced by multipath effect, we apply the iterative turbo codes that iteratively exchange probabilistic information between LMS-DFE and turbo decoder, thereby reducing the error rates significantly. We showed the successful of turbo decoding of iterative turbo equalizer is 93%.

Performance Analysis on Various Design Issues of Turbo Decoder (다양한 Design Issue에 대한 터보 디코더의 성능분석)

  • Park Taegeun;Kim Kiwhan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1387-1395
    • /
    • 2004
  • Turbo decoder inherently requires large memory and intensive hardware complexity due to iterative decoding, despite of excellent decoding efficiency. To decrease the memory space and reduce hardware complexity, various design issues have to be discussed. In this paper, various design issues on Turbo decoder are investigated and the tradeoffs between the hardware complexity and the performance are analyzed. Through the various simulations on the fixed-length analysis, we decided 5-bits for the received data, 6-bits for a priori information, and 7-bits for the quantization state metric, so the performance gets close to that of infinite precision. The MAX operation which is the main function of Log-MAP decoding algorithm is analyzed and the error correction term for MAX* operation can be efficiently implemented with very small hardware overhead. The size of the sliding window was decided as 32 to reduce the state metric memory space and to achieve an acceptable BER.

Cooperative Diversity Performance Using Duo-Binary Turbo Codes (Duo-Binary 터보 부호를 이용한 협동 다이버시티 성능 분석)

  • Yeo, Sung-Moon;Kim, Soo-Young
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.2
    • /
    • pp.38-45
    • /
    • 2009
  • In this paper, we propose an efficient cooperative diversity technique, which partition the codewords of each mobile and transmit portions of each codeword through independent fading channels using duo-binary turbo codes. A coded diversity technique can achieve high cooperative diversity gain by decoding and transmitting of the re-encoded signal, while this can also cause high performance degradation due to failure of the decoding. In this paper, we introduce various coded diversity technique using duo-binary turbo codes which are defined as channel coding schemes in the IEEE WiMax specification, and also demonstrate performance simulation results with the analysis. We also propose a cooperative diversity technique using rate-compatible duo-binary turbo codes, where user terminals with different parity symbols cooperate each other. Simulation results investigated in this paper reveal that the proposed scheme show high diversity gain at a reasonal SNR range.

A Simple Stopping Criterion for the MIN-SUM Iterative Decoding Algorithm on SCCC and Turbo code (반복 복호의 계산량 감소를 위한 간단한 복호 중단 판정 알고리즘)

  • Heo, Jun;Chung, Kyu-Hyuk
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.4
    • /
    • pp.11-16
    • /
    • 2004
  • A simple stopping criterion for iterative decoding based on min-sum processing is presented. While most stopping criteria suggested in the literature, are based on Cross Entropy (CE) and its simplification, the proposed stopping criterion is to check if a decoded sequence is a valid codeword along the encoder trellis structure. This new stopping criterion requires less computational complexity and saves mem4)ry compared to the conventional stopping rules. The numerical results are presented on the 3GPP turbo code and a Serially Concatenated Convolutional Cods (SCCC).

Throughput Improvement of Adaptive Modulation System with an Efficient Turbo-Coded V-BLAST Technique in each MIMO Channel

  • Ryoo, Sang-Jin;Kim, Seo-Gyun;Na, Cheol-Hun;Hong, Jin-Woo;Hwang, In-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.905-908
    • /
    • 2008
  • In this paper, an Adaptive Modulation (AM) system with an efficient turbo-coded Vertical-Bell-lab Layered Space-Time (V-BLAST) technique is proposed. The proposed decoding algorithm adopts iteratively the extrinsic information from a Maximum a Posteriori (MAP) decoder as a priori probability in the two decoding procedures of the V-BLAST scheme of ordering and slicing. In this analysis, each MIMO channel is assumed to be a part of the system of performance improvement.

  • PDF

On the Performance of Turbo Codes-Based Hybrid ARQ with Segment Selective Repeat in WCDMA

  • Shi Tao;Cao Lei
    • Journal of Communications and Networks
    • /
    • v.8 no.2
    • /
    • pp.212-219
    • /
    • 2006
  • In this paper, a new turbo codes-based hybrid automatic repeat request (TC-HARQ) scheme with segment selective repeat (SSR) is proposed. The main strategy is, upon retransmission, to repeat the data that are most important for the next round of decoding based on the distribution of residual errors after current decoding. The performance in terms of reliability and throughput is analyzed. To adapt to correlated fading channels where an inter-leaver is always employed before transmission, we further modify the SSR strategy so that data having experienced correlated deep fading are selected for retransmission. Finally, this proposed scheme is applied to the wideband code division multiple access (WCDMA) system under frequency selective fading channels. Simulation results demonstrate that in all single and multiple user cases, SSR-based TC-HARQ leads to significant throughput improvement with similar bit error rate (BER) performance as compared to type-I TC-HARQ.