• Title/Summary/Keyword: 터보부호

Search Result 232, Processing Time 0.024 seconds

Protection Algorithm for Error Prone Bit Positions of Turbo Codes (터보 부호의 오류 취약 비트 보완 알고리듬)

  • Wangrok Oh;Kyungwhoon Cheun;Kim, Jinwoo;Kyeongcheol Yang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.775-780
    • /
    • 2004
  • In this paper, we propose a simple protection scheme for error prone bit positions of turbo codes using the error detection capability of the CRC, which is almost always employed in practical systems. The proposed scheme based on bit flipping with CRC offers flexibility on selecting the level of protection. Also, not having send additional parity bits or discarding useful bit positions, it offers the best error performance for a given level of protection.

Performance Analysis of Turbo Product Code Using Parallel Structure (병렬 구조를 이용한 Turbo Product Code 성능 분석)

  • 이태길;정지원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2C
    • /
    • pp.181-186
    • /
    • 2004
  • Recently, there has been intensive focus on Turbo Product Codes(TPCs) which have low decoding complexity and achieve near-optimum performances at high code-rate. This paper present a parallel algorithm of turbo product codes enable simultaneous decoding of row and column. The row and column decoders operate in parallel and update each other after row and column has been decoded. simulation results show that the performance of proposed parallel turbo code is almost the same as that conventional scheme for several turbo product codes.

Adaptive Trellis-Coded 8PSK Using Symbol Transformation (심볼 변환을 이용한 적응형 8PSK 트렐리스 부호화 방식)

  • 정지원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.4C
    • /
    • pp.448-453
    • /
    • 2004
  • Conventional pragmatic TCMs need sector phase quantizer to apply Viterbi decoder which uses 3-bit soft decision. A symbol transformation applied to the incoming I-channel and Q-channel symbols allows to use Viterbi decoder without sector phase quantizer. We analyzed structure and performance of proposed decoder, and applied it to the turbo decoder. We know that the performance of proposed decoder is better than that of conventional decoder by 1 [㏈]because of increasing of Euclidean distance.

H-ARQ Scheme Using Turbo Code in CDMA/TDD Systems (CDMA/TDD 시스템에서 터보 부호를 사용한 H-ARQ 기법 연구)

  • Cho, S.C.;Cho, D.S.;Lee, Y.R.;Jeong, I.C.;Uh, Y.;Kwon, D.S.
    • Electronics and Telecommunications Trends
    • /
    • v.16 no.6 s.72
    • /
    • pp.9-18
    • /
    • 2001
  • IMT-2000에서 제공하고자 하는 인터넷 서비스나 멀티미디어 서비스를 위하여 고속 패킷 전송이 이루어 져야 한다. 이러한 고속 패킷 서비스의 경우 불연속적인 데이터의 전송 및 비대칭적 데이터 트래픽의 특성으로 인하여 최근 CDMA/TDD 시스템에 대한 연구가 관심의 초점이 되고 있다. 따라서 본 고에서는 TDD 방식을 사용한 시스템의 특성을 고려하여, 전송 프레임의 구성 방식, 오류 발생 프레임의 재전송 방식, 채널 부호화 방식 등에 대하여 고찰하도록 한다.

Design of the layered coding with rate compatible block turbo codes (블록 터보 부호를 이용한 계층적 부호화 방식 설계)

  • Oh, Ji-Won;Hwang, Ki-Seon;Lee, Jing;Kim, Soo-Young
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.87-88
    • /
    • 2007
  • In this paper, we propose a design of the layered coding with block turbo codes. The proposed scheme can be used efficiently for multimedia broadcasting and multicasting services by adaptive selection of a modulation and coding scheme at a receiver. This paper demonstrates various design examples of the layered coding using rate compatible block turbo codes.

  • PDF

An Image Transmission with Interleaved Puncturing Serially Concatenated Convolutional Codes for Wireless Communication (무선 채널 환경에서 IP-SCCC에 의한 정지 영상의 전송)

  • 이연문;조경식;정차근
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.321-324
    • /
    • 2000
  • 채널만을 고려한 부호화 방법보다 소스의 특성을 이용해 채널 부호화를 수행하는 것이 더 효율적이라는 사실은 일반적으로 잘 알려져 있다. 따라서 소스의 특성을 이용한 채널 부호화 방법은 중요한 연구과제이며 이에 대한 많은 연구가 진행되었다. 이러한 연구 결과로써 IP-SCCC(Interleaved puncturing serially concatenated convolutional codes)는 터보코드와 마찬가지로 반복복호가 가능하고 가변 부호율의 채널부호화를 수행할 수 있는 특징을 갖는다. 본 논문에서는 영상에 대한 웨이블렛 변환의 다른 스케일간의 자기 유사성을 이용한 SPIHT(set partitioning in hierarchical tree) 알고리즘으로 부호화된 정지영상에 대해 IP-SCCC를 사용한 UEP(unequal error protection) 채널부호화 방법을 제시한다. 또한 레일리 페이딩과 부가 백색 가우시안 잡음이 동시에 존재하는 채널을 모델링해서 실험을 수행하고 제안 방법의 성능을 검증한다.

  • PDF

A Design of Parallel Turbo Decoder based on Double Flow Method Using Even-Odd Cross Mapping (짝·홀 교차 사상을 이용한 Double Flow 기법 기반 병렬 터보 복호기 설계)

  • Jwa, Yu-Cheol;Rim, Chong-Suck
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.7
    • /
    • pp.36-46
    • /
    • 2017
  • The turbo code, an error correction code, needs a long decoding time since the same decoding process must be repeated several times in order to obtain a good BER performance. Thus, parallel processing may be used to reduce the decoding time, in which case there may be a memory contention that requires additional buffers. The QPP interleaving has been proposed to avoid such case, but there is still a possibility of memory contention when a decoder is constructed using the so-called double flow technique. In this paper, we propose an even-odd cross mapping technique to avoid memory conflicts even in decoding using the double-flow technique. This method uses the address generation characteristic of the QPP interleaving and can be used to implement the interleaving circuit between the decoding blocks and the LLR memory blocks. When the decoder implemented by applying the double flow and the proposed methods is compared with the decoder by the conventional MDF techniques, the decoding time is reduced by up to 32% with the total area increase by 8%.

A Soft Demapping Method for 64-APSK in the DVB-S3 System (DVB-S3 시스템의 64-APSK 방식에 대한 연판정 비트 검출 기법)

  • Li, Guowen;Zhang, Meixiang;Kim, Sooyoung
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.2
    • /
    • pp.23-27
    • /
    • 2014
  • In this paper, we propose a soft demapping method for 64-ary APSK in the DVB-S3 system. The proposed method in this paper uses the hard decision threshold (HDT) line for each constituent bit in a symbol, and calculates the soft bit information with the distance between the HDT line and the detected symbol. If the HDT lines are defined in a simple manner, the complexity to estimate soft information can be largely reduced compared with the maximum likelihood detection (MLD) which has an exponential complexity. By considering this, we first derive HDT lines for each constituent bit for a 64-APSK symbol, and propose a method to calculate soft bit information. We simulate the BER performance of the proposed scheme by using a turbo codes which requires soft-input-soft-output information, and compare it that of the MLD. The result show that the proposed scheme produces approximating performance to MLD with largely reduced complexity.

The Phase Estimation Algorithm of Arrival Time Difference in MIMO Underwater Sensor Communication (MIMO 수중 통신에서 도착시간 차이에 따른 보상 알고리즘)

  • Baek, Chang-uk;Jung, Ji-won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.7
    • /
    • pp.1531-1538
    • /
    • 2015
  • In this paper, we proposed receiver structure based on an iterative turbo equalization to cope with phase difference between two sensors in MIMO underwater communication channel. In a space-time coded system, it is often assumed that there are no phase errors among the multiple transmitter and receiver chains. In this paper, we have studied the effect of the phase errors between different transmit sensors and different propagation paths in the environment of MIMO underwater communication system, and have shown through BER performance by computer simulations that the bit-error-rate performance can be severely degraded. A decision-directed estimation and compensation algorithm has been proposed to minimize their effects on the system performance. In this paper, we investigate the phase differences and their effects on multiple-input and multiple-output systems, and propose a compensation algorithm for underwater channel model to minimize their effects.

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.