• Title/Summary/Keyword: 반복부호

Search Result 247, Processing Time 0.023 seconds

Serially Concatenated Multilevel Coded Modulation (직렬연접 다중레벨 부호변조)

  • Bae, Sang-Jae;Lee, Sang-Hoon;Joo Eon-Kyeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.11
    • /
    • pp.12-20
    • /
    • 2002
  • Serially concatenated multilevel coded modulation (SCMCM) is proposed in this paper. It is a combined scheme of the outer convolutional code and inner multilevel coded modulation (MCM) which is bandwidth-efficient coded modulation. And the performance of three schemes for decoding of the proposed SCMCM is compared and analyzed. As results of simulations, global iterative decoding with inner and outer code should be performed to improve the error performance as the number of iterations is increased. And the scheme which uses both local iterative multistage decoding in MCM and global iterative decoding with inner and outer code, called Scheme 3 in this paper, shows the best error performance among the three schemes considered in this paper. In addition, performance difference between this scheme and the others is increased as the signal to noise ratio (SNR) is increased. Therefore, Scheme 3 is considered to be the proper decoding scheme of SCMCM.

Analysis of an Optimal Iterative Turbo Equalizer for Underwater Acoustic Communication (수중 음향통신에 적합한 최적의 반복기반 터보 등화기 분석)

  • Park, Tae Doo;Lee, Seong Ro;Kim, Beom Mu;Jung, Ji Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.3
    • /
    • pp.303-310
    • /
    • 2013
  • Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes and LDPC codes are dominant channel coding schemes in recent. This paper concluded that turbo coding scheme is optimal for underwater communications system in aspect to performance, coded word length, and equalizer combining. Also, we confirmed the performance in the environment of oceanic experimentation using turbo equalizer based on distance 5Km, data rate 1Kbps.

LLR Based Generalization of Soft Decision Iterative Decoding Algorithms for Block Turbo Codes (LLR 기반 블록 터보 부호의 연판정 복호 알고리즘 일반화)

  • Im, Hyun-Ho;Kwon, Kyung-Hoon;Heo, Jun
    • Journal of Broadcast Engineering
    • /
    • v.16 no.6
    • /
    • pp.1026-1035
    • /
    • 2011
  • This paper presents generalization and application for the conventional SISO decoding algorithm of Block Turbo Codes. R. M. Pyndiah suggested an iterative SISO decoding algorithm for Product Codes, two-dimensionally combined linear block codes, on AWGN channel. It wascalled Block Turbo Codes. Based on decision of Chase algorithm which is SIHO decoding method, SISO decoder for BTC computes soft decision information and transfers the information to next decoder for iterative decoding. Block Turbo Codes show Shannon limit approaching performance with a little iteration at high code rate on AWGN channel. In this paper we generalize the conventional decoding algorithm of Block Turbo Codes, under BPSK modulation and AWGN channel transmission assumption, to the LLR value based algorithm and suggest an application example such as concatenated structure of LDPC codes and Block Turbo Codes.

The design method for a vector codebook using a variable weight and employing an improved splitting method (개선된 미세분할 방법과 가변적인 가중치를 사용한 벡터 부호책 설계 방법)

  • Cho, Che-Hwang
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.4
    • /
    • pp.462-469
    • /
    • 2002
  • While the conventional K-means algorithms use a fixed weight to design a vector codebook for all learning iterations, the proposed method employs a variable weight for learning iterations. The weight value of two or more beyond a convergent region is applied to obtain new codevectors at the initial learning iteration. The number of learning iteration applying a variable weight must be decreased for higher weight value at the initial learning iteration to design a better codebook. To enhance the splitting method that is used to generate an initial codebook, we propose a new method, which reduces the error between a representative vector and the member of training vectors. The method is that the representative vector with maximum squared error is rejected, but the vector with minimum error is splitting, and then we can obtain the better initial codevectors.

Performance analysis of turbo codes based on underwater experimental data (수중 실험 데이터 기반 터보 부호 성능 분석)

  • Sung, Ha-Hyun;Jung, Ji-Won
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.1
    • /
    • pp.45-49
    • /
    • 2016
  • The performance of underwater acoustic communication systems is sensitive to inter-symbol interference caused by delay spread developed from multipath signal propagation. The multipath nature of underwater channels causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Of the various iterative coding schemes, turbo code and convolutional code based on the BCJR algorithm have recently dominated this application. In this study, the performance of iterative codes based on turbo equalizers with equivalent coding rates and similar code word lengths were analyzed. Underwater acoustic communication system experiments using these two coding techniques were conducted on Kyeong-chun Lake in Munkyeong City. The distance between the transmitter and receiver was 400 m, and the data transfer rate was 1 Kbps. The experimental results revealed that the performance of turbo codes is better for channeling than that of convolutional codes that use a BCJR decoding algorithm.

A Codebook Generation Algorithm Using a New Updating Condition (새로운 갱신조건을 적용한 부호책 생성 알고리즘)

  • 김형철;조제황
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.3
    • /
    • pp.205-209
    • /
    • 2004
  • The K-means algorithm is the most widely used method among the codebook generation algorithms in vector quantization. In this paper, we propose a codebook generation algorithm using a new updating condition to enhance the codebook performance. The conventional K-means algorithm uses a fixed weight of the distance for all training iterations, but the proposed method uses different weights according to the updating condition from the new codevectors for training iterations. Then, different weights can be applied to generate codevectors at each iteration according to this condition, and it can have a similar effect to variable weights. Experimental results show that the proposed algorithm has the better codebook performance than that of K-means algorithm.

  • PDF

Collision Performance Improvement in Orthogonal Code Hopping Multiplexing Systems Using Multiple Antennas (다중 안테나를 이용한 직교 부호 도약 다중화 시스템의 성능향상)

  • Jung, Bang-Chul;Lee, Woo-Jae;Park, Yeoun-Sik;Jeon, Seong-Keun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.10
    • /
    • pp.2100-2112
    • /
    • 2011
  • An orthogonal code hopping multiplexing (OCHM) technique has been proposed for accommodating a large number of users with low channel activities than the number of orthogonal codewords through statistical multiplexing in downlink cellular systems. In this paper, a multiple input multiple output (MIMO) antenna based OCHM system is proposed to improve the performance. Each modulated symbol is repeated N times and the N repeated symbols are transmitted simultaneously using N transmit antennas. Through repetitions, the effect of perforations that the OCHM system experiences is decentralized among the repeated symbols and the full perforation probability is significantly reduced. Each receiver detect the transmitted signal using its pre-assigned code hopping pattern. Simulation results show that the proposed scheme saves the required energy for a given frame error rate (FER).

A Study on layered Space Time Trellis codes for MIMO system based on Iterative Decoding Algorithm (MIMO 시스템에서 반복 복호 알고리즘 기반의 계층적 시공간 부호화 방식 연구)

  • Park, Tae-Doo;Jung, Ji-Won
    • Journal of Navigation and Port Research
    • /
    • v.36 no.10
    • /
    • pp.845-849
    • /
    • 2012
  • The next-generation wireless communication requires fast transmission speeds with various services and high reliability. In order to satisfy these needs we study MIMO system used layered space time coded system (LST) combining space time trellis codes (STTC) with turbo codes. In LST, two codes that are inner and outer codes are concatenated in the serial fashion. The inner codes are turbo Pi codes suggested in DVB-RCS NG system, and outer codes are STTC codes proposed by Blum. The interleaver technique is used to efficiently combine two codes. And we proposed and simulated that a full iteration method between turbo decoder and BCJR decoder to improve the performance instead of only processing inner-iteration turbo decoder. The simulation results of proposed effective layered method show improving BER performance about 1.3~1.5dB than conventional one.

Performance and Iteration Number Statistics of Flexible Low Density Parity Check Codes (가변 LDPC 부호의 성능과 반복횟수 통계)

  • Seo, Young-Dong;Kong, Min-Han;Song, Moon-Kyou
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.1
    • /
    • pp.189-195
    • /
    • 2008
  • The OFDMA Physical layer in the WiMAX standard of IEEE 802.16e adopts 114 LDPC codes with various code rates and block sizes as a channel coding scheme to meet varying channel environments and different requirements for transmission performance. In this paper, the performances of the LDPC codes are evaluated according to various code rates and block-lengths throueh simulation studies using min-sum decoding algorithm in AWGN chamois. As the block-length increases and the code rate decreases, the BER performance improves. In the cases with code rates of 2/3 and 3/4, where two different codes ate specified for each code rate, the codes with code rates of 2/3A and 3/4B outperform those of 2/3B and 3/4A, respectively. Through the statistical analyses of the number of decoding iterations the decoding complexity and the word error rates of LDPC codes are estimated. The results can be used to trade-off between the performance and the complexity in designs of LDPC decoders.

An interleaver to reduce the edge-effect in turbo codes with CRC (CRC를 사용한 터보부호에서 edge-effect를 감소시키기 위한 인터리버)

  • Lee, Byeong-Gil;Bae, Sang-Jae;Jeong, Geon-Hyeon;Ju, Eon-Gyeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.4
    • /
    • pp.165-172
    • /
    • 2002
  • In the next generation mobile communications, powerful channel coding is essential in order to obtain high quality multimedia services. Turbo code can achieve good error performance by iterative decoding, but more iterations result in additional computational complexity and delay. Thus, a method to reduce the number of iterations without additional performance degradation is needed. Turbo code with CRC is known to be the most efficient method to reduce the number of iterations. In this scheme, the performance may be degraded by the edge-effect like the conventional turbo code without CRC. In this paper, a method to eliminate the edge-effect is proposed by adopting D-parameter to the conventional s-random interleaver. As results of simulation, the edge-effect of the turbo code with CRC is shown to be successfully eliminated by using the new interleaver designed with D-parameter.