• Title/Summary/Keyword: turbo decoder

Search Result 153, Processing Time 0.026 seconds

Efficient Partial Parallel Encoders for IRA Codes in DVB-S2 (DVB-S2 IRA Code를 위한 최적 부호화 방법)

  • Hwang, Sung-Oh;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11C
    • /
    • pp.901-906
    • /
    • 2010
  • Low density parity check (LDPC) code, first introduced by Gallager and re-discovered by MacKay et al, has attracted researcher's interest mainly due to their performance and low decoding complexity. It was remarkable that the performance is very close to Shannon capacity limit under the assumption of having long codeword length and iterative decoder. However, comparing to turbo codes widely used in the current mobile communication, the encoding complexity of LDPC codes has been regarded as the drawback. This paper proposes a solution for DVB-S2 LDPC encoder to reduce the encoder latency. We use the fast IRA encoder that use the transformation of the parity check matrix into block-wise form and the partial parallel process to reduce the number of system clocks for the IRA code encoding. We compare the proposed encoder with the current DVB-S2 encoder to show that the performance of proposal is better than that of the current DVB-S2 encoder.

Design of an Area-Efficient Architecture for Block-wise MAP Turbo Decoder (면적 효율적인 구조의 블록 MAP 터보 복호기 설계)

  • Kang, Moon-Jun;Kim, Sik;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8A
    • /
    • pp.725-732
    • /
    • 2002
  • Block-wise MAP (Maximum A posteriori) decoding algorithm for turbo-codes requires less memory than Log-MAP decoding algorithm. The ER (Bit Error Rate) performance of previous block-wise MAP decoding algorithm depend on the block length and training length. To maximize hardware utilization and perform successive decoding, the block length is set to be equal to the training length in previous MAP decoding algorithms. Simulation result on the BER performance shows that the EBR performance can be maintained with shorter blocks when training length is sufficient. This paper proposes an architecture for area efficient block-wise MAP decoder. The proposed architecture employs the decoding schema for reducing memory by using the training length, which in N times larger than block length. To efficiently handle the proposed schema, a pipelined architecture is proposed. Simulation results show that memory usage can be reduced by 30%~45% in the proposed architecture without degrading the BER performance.

Implementation of LTE Transport Channel on Multicore DSP Software Defined Radio Platform (멀티코어 DSP 기반 소프트웨어 정의 라디오 플랫폼을 활용한 LTE 전송 채널의 구현)

  • Lee, Jin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.4
    • /
    • pp.508-514
    • /
    • 2020
  • To implement the continuously evolving mobile communication standards such as Long Term Evolution (LTE) and 5G, the Software Defined Radio (SDR) concept provides great flexibility and efficiency. For many years, a high-end Digital Signal Processor (DSP) System on Chip (SoC) has been developed to support multicore and various hardware coprocessors. This paper introduces the implementation of the SDR platform hardware using TI's TCI663x chip. Using the platform, LTE transport channel is implemented by interworking multicore DSP with Bit rate Coprocessor (BCP) and Turbo Decoder Coprocessor (TCP) and the performance is evaluated according to various implementation options. In order to evaluate the performance of the implemented LTE transport channel, LTE base station system was constructed by combining FPGA main board for physical channels, SDR platform board, and RF & Antenna board.

Phase Offset Estimation Based on Turbo Decoding in Digital Broadcasting System (차세대 고속무선 DTV를 위한 터보복호기반의 위상 옵셋 추정 기법)

  • Park, Jae-Sung;Cha, Jae-Sang;Lee, Chong-Hoon;Kim, Heung-Mook;Choi, Sung-Woong;Cho, Ju-Phill;Park, Yong-Woon;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.111-116
    • /
    • 2009
  • In this paper, we propose a phase offset estimation algorithm which is based on turbo coded digital broadcasting system. The phase estimator is an estimator outside turbo code decoder using LMS (Least Mean Square) algorithm to estimate the phase of next state. While the conventional LMS algorithm with a fixed step size is easy implemented, it has weak points that are difficult the channel estimation and tracking in the multipath environment. To resolve this problem, we propose new phase offset estimation method with a variable step size LMS (VS-LMS). Additionally, we propose a scheme which consists of a conventional LMS. The performance is verified by computer simulation according to a fixed phase offset and a increased phase offset, the proposed algorithm improve the bit error rate performance than the conventional algorithm.

  • PDF

A New Semi-Random Imterleaver Algorithm for the Noise Removal in Image Communication (영상통신에서 잡음 제거를 위한 새로운 세미 랜덤 인터리버 알고리즘)

  • Hong, Sung-Won;Park, Jin-Soo
    • 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.

  • PDF

Efficient Detection Scheme for Turbo Coded QO-STBC Schemes (터보 부호와 결합된 준직교 시공간 블록 부호의 효율적인 검출 기법)

  • Park, Un-Hee;Oh, Dae-Sub;Kim, Young-Min;Kim, Soo-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.423-430
    • /
    • 2010
  • The performances of turbo-coded space-time block coding (STBC) schemes are subject to how soft decision detection (SDD) information are generated from the STBC decoder. For this reason, we have to pay particular attention to estimation of SDD. In this paper, we evaluate the performance of a turbo coded STBC scheme depending on the accuracy of the SDD. Recently, a new quasi orthogonal STBC (QO-STBC) scheme using a noise whitened filter was proposed in order to reduce noise enhancing effect of zero forcing detection process. This QO-STBC scheme was proven to be efficient in computational complexity compared to the other conventional QO-STBC schemes. In this paper, we first present detailed mathematical analysis on the noise whitened QO-STBC scheme, and by using the result we propose the optimum SDD method.

Effective Decoding Algorithm of Three dimensional Product Code Decoding Scheme with Single Parity Check Code (Single Parity Check 부호를 적용한 3차원 Turbo Product 부호의 효율적인 복호 알고리즘)

  • Ha, Sang-chul;Ahn, Byung-kyu;Oh, Ji-myung;Kim, Do-kyoung;Heo, Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.9
    • /
    • pp.1095-1102
    • /
    • 2016
  • In this paper, we propose a decoding scheme that can apply to a three dimensional turbo product code(TPC) with a single parity check code(SPC). In general, SPC is used an axis with shortest code length in order to maximize a code rate of the TPC. However, SPC does not have any error correcting capability, therefore, the error correcting capability of the three-dimensional TPC results in little improvement in comparison with the two-dimensional TPC. We propose two schemes to improve performance of three dimensional TPC decoder. One is $min^*$-sum algorithm that has advantages for low complexity implementation compared to Chase-Pyndiah algorithm. The other is a modified serial iterative decoding scheme for high performance. In addition, the simulation results for the proposed scheme are shown and compared with the conventional scheme. Finally, we introduce some practical considerations for hardware implementation.

Performance Analysis of Spread Spectrum Underwater Communication Method Based on Multiband (다중 밴드 기반 대역 확산 수중통신 기법 성능분석)

  • Shin, Ji-Eun;Jeong, Hyun-Woo;Jung, Ji-Won
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.5
    • /
    • pp.344-352
    • /
    • 2020
  • Covertness and performance are very important design goals in the underwater communications. To satisfy both of them, we proposed efficient underwater communication model which combined multiband and direct sequence spread spectrum method in order to improve performance and covertness simultaneously. Turbo coding method with 1/3 coding rates is used for channel coding algorithm, and turbo equalization method which iterately exchange probabilistic information between equalizer and decoder is used for receiver side. After optimal threshold value was set in Rake processing, this paper analyzed the performance by varying the number of chips were 8, 16, 32 and the number of bands were from 1 to 4. Through the simulation results, we confirmed that the performance improvement was obtained by increasing the number of bands and chips. 2~3 dB of performance gain was obtained when the number of chips were increased in same number of bands.

A study on channel reliability estimation of turbo decoder for underwater acoustic channel (수중 음향 채널에서 터보 복호기의 채널 신뢰도 추정에 관한 연구)

  • Jeong, Hyun-Woo;Jung, Ji-Won;Kim, In-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.41 no.4
    • /
    • pp.410-418
    • /
    • 2022
  • Channel reliability estimation for iterative codes such as turbo codes is very important factor in time varying underwater acoustic channel, an incorrect estimation of channel reliability induced performance degradation. Therefore, this paper presents an optimal channel reliability estimation method for turbo coded FSK signal with rate of 1/3. The estimated BER algorithm is a method that can estimate the reliability of received data by comparing received data and decoded data, and we determine optimal channel reliability by using the method. In order to analyze the performance, the experiment was conducted on a lake in Munkyeong city by moving in the range of 300 m to 500 m. At the result of applying presented method to failed decoding packets, we confirm all packets are decoded successfully.

A study on threshold detection algorithm for adaptive transmission in underwater acoustic communication (수중 음향 통신에서 적응형 전송을 위한 임계값 검출 알고리즘)

  • Jung, Ji-Won;Kim, In-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.6
    • /
    • pp.585-591
    • /
    • 2020
  • The adaptive transmission techniques are efficient method for underwater acoustic communication to improve the system efficiency by varying transmission parameters according to channel conditions. In this paper, we construct four transmission modes with different data rates using the convolutional codes, which is freely set to size of information bits. On the receiver side, one critical component of adaptive system is to find which mode has best performance. In this paper, we proposed threshold detection algorithm to decide appropriate mode and applied turbo equalization method based on BCJR decoder in order to improve performance. We analyzed the performance of four modes based on threshold detection algorithm through the lake experiment.