• Title/Summary/Keyword: 직렬연접길쌈부호

Search Result 5, Processing Time 0.019 seconds

Multilevel Coded Modulation with Serial Concatenated Convolutional Code (직렬연접 길쌈부호를 사용한 다중레벨 부호변조방식)

  • 이상훈;여운동;주언경
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.9
    • /
    • pp.366-372
    • /
    • 2003
  • Multilevel coded modulation (MCM) with serial concatenated convolutional code (SCCC) is proposed and the performance is analyzed in this paper. Both high coding gain and bandwidth efficiency can be obtained if SCCC is adopted as a component code at the first level of MCM. Simulation results show that the performance of MCM with Ambroze's SCCC is saturated like that of MCM with PCCC. But MCM with Benedetto's SCCC shows no performance saturation and better performance than MCM with PCCC or Ambroze's SCCC. Thus MCM with Benedetto's SCCC may be a good choice for high quality system with limited bandwidth.

A New Concatenation Scheme of Serial Concatenated Convolutional Codes (직렬연접 길쌈부호의 새로운 연접방법)

  • Bae, Sang-Jae;Ju, Eon-Gyeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.3
    • /
    • pp.125-131
    • /
    • 2002
  • In this paper, a new concatenation scheme of serial concatenated convolutional codes is proposed and the performance analyzed. In the proposed scheme, each of information and parity bits of outer code is entered into inner code through interleaver and deinterleaver. Therefore, the interleaver size is same as the length of input frame. Since the interleaver size of proposed type is reduced to half of the conventional Benedetto type, the interleaver delay time required for iterative decoding is reduced. In addition the multiplexer and demultiplexer are not used in the decoder of the proposed type, the complexity of decoder can be also reduced. As results of simulation, the performance of proposed type shows the better error performance as compared to that of the conventional Benedetto type in case of the same interleaver size. And it can be observed that the difference of BER performance is increased with the increase of Eb/No. In case of the same length of input frame, the proposed type shows almost same performance with Benedetto type despite that the interleaver size is reduced by half.

Performance Of Iterative Decoding Schemes As Various Channel Bit-Densities On The Perpendicular Magnetic Recording Channel (수직자기기록 채널에서 기록 밀도에 따른 반복복호 기법의 성능)

  • Park, Dong-Hyuk;Lee, Jae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7C
    • /
    • pp.611-617
    • /
    • 2010
  • In this paper, we investigate the performances of the serial concatenated convolutional codes (SCCC) and low-density parity-check (LDPC) codes on perpendicular magnetic recording (PMR) channels. We discuss the performance of two systems when user bit-densities are 1.7, 2.0, 2.4 and 2.8, respectively. The SCCC system is less complex than LDPC system. The SCCC system consists of recursive systematic convolutional (RSC) codes encoder/decoder, precoder and random interleaver. The decoding algorithm of the SCCC system is the soft message-passing algorithm and the decoding algorithm of the LDPC system is the log domain sum-product algorithm (SPA). When we apply the iterative decoding between channel detector and the error control codes (ECC) decoder, the SCCC system is compatible with the LDPC system even at the high user bit density.

Performance of Serial Concatenated Convolutional Codes according to the Concatenation Methods of Component Codes (구성부호의 연접방법에 따른 직렬연접 길쌈부호의 성능)

  • Bae, Sang-Jae;Lee, Sang-Hoon;Joo, Eon-Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1A
    • /
    • pp.18-25
    • /
    • 2002
  • In this paper, the performance of three types of serial concatenated convolutional codes (SCCC) in AWGN (additive white Gaussian noise) channel is compared and analyzed. As results of simulations, it can be observed that Type I shows the best error performance at lower signal-to-noise ratio (SNR) region. However, Type III shows the best error performance at higher SNR region. It can be also observed the error floor that the performance cannot be improved even though increasing of the number of iterations and SNR at Type I. However, the performance of Type II and Type III are still improved over the five iterations at higher SNR without error floor. And BER performance of three types can be closed to upper bound of three types with increase of SNR. It can be also observed that the upper bound of Type III shows the best performance among the three types due to the greatest free distance.

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.