• 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.

• The Magazine of the IEIE
• /
• v.11 no.3
• /
• pp.47-58
• /
• 1984

본지 2, 3월호에서 구술한 블록부호(선형부호 및 순회부호)에 이어 이번 호에서는 대합부호, 즉 길쌈부호(convolutional code)에 대해 기술하고자 한다. 길쌈부호는 그 부호법 중 역차 및 최근부호에 있어 그 구조적 표현이 대수학적(algebraic)이라기 보다는 오히려 위상학적(topological)이라는 점에서 주목할만한 특징을 지니고 있다. 길쌈부호를 응용한 예로는 1977년 NASA에 실시한 Voyager 우주탐사계획을 들 수 있다. 화성(Mars), 목성(Jupiter) 및 토성(Saturn) 등에서 일연의 과학 data 수집을 목적으로 했던 이 계획은 NASA소관 California공대 JPL연구소에서 개발한, 기억소자가 6단인(3, 1) 길쌈부호의 CODEC을 사용하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.4
• /
• pp.379-386
• /
• 2016

Puncturing is the most common way of increasing the rate of convolutional codes. The puncturing process is done to the original code called the mother code by a specific puncturing pattern. In this article, we investigate into the question whether any convolutional code is obtainable by puncturing some (n, 1) mother codes. We present two sufficient conditions for the mother code and the puncturing pattern to satisfy in order that the punctured code is equivalent to the given (N, K) convolutional code.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1184-1189
• /
• 2001

In this paper was analyzed the performance of turbo code using semi-random interleaver which proposed a reference numbers 11. Which was analyzed comparison the performance of between the current mobile communication system had been used the viterbe decoding algorithm of convolutional code and turbo codes when fixed constraint length. The result was defined that the performance of turbo code rose a $E_{b/}$ $N_{o}$=4.7[㏈] than convolutional code, when convolutional code and turbo code was fixed by BER = 10$^{-4}$ and constraint length K 5.5.5.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.2
• /
• pp.207-213
• /
• 2019

In this paper, we evaluate the communication performance of convolutional code with block interleaving in a frequency-selective channel. Block interleaving is a technique for spreading and rearranging digital data streams. A block interleaving technique is applied to improve the performance by dispersing the concentration of burst errors in a frequency-selective channel. As a result of evaluating the performance of the convolutional code with block interleaving in the water tank experiment, There was no difference in the performance of convolutional codes using block interleaving in a frequency-selective channel. However, in the frequency-selective channel, the convolutional code with block interleaving has a gain of 2dB, and it is confirmed that the underwater acoustic communication performance is improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.165-171
• /
• 2014

The rate of the channel code can be controlled by various methods. Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (n,k) convolutional code is obtainable by puncturing some mother codes, and the process of finding the mother code is necessary for designing the optimum channel decoder. In this paper, we proved that any (n,n-1) convolutional code has (2,1) mother codes regardless of the puncturing pattern and showed that they must be equivalent.

• Journal of the Korean Professional Engineers Association
• /
• v.26 no.3
• /
• pp.26-33
• /
• 1993

위성을 이용한 DAMA-SCPC 지구국시스템의 경우 대체적으로 전송경로상에서 발생되는 에러를 제어하는 방법으로 FEC 기법을 채택하고 있다. 본 고에서는 DAMA -SCPC 지구국 시스템의 설계에 적용할 수 있도록 길쌈부호와 Viterbi 복호법, 그리고 (m-1)/m의 부호율을 위한 소기식 길쌈부호에 대해 살펴보고, 상용화 FEC CODEC 제품 중 가격이 비교적 저렴하고 다양한 기능을 제공하는 QUALCOM사의 Q0256 CODEC의 구성 및 제공 기능에 대해 분석한 후, 이 FEC CODEC을 DAMA-SCPC 지구국 시스템의 채널부에 적용시킬 때의 내장 부가 장치와 제공 기능들의 설계 및 이용 방안에 대해 고찰하였다.

• 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.

• Smart Media Journal
• /
• v.2 no.2
• /
• pp.39-43
• /
• 2013

In this paper, we suggest a new technique for WPC parity-check matrix (H-matrix) generation and a corresponding decoding process. The key idea is to construct WPC H-matrix by using a convolutional encoder. It is easy to have many different coderates from a mother code with convolutional codes. However, it is difficult to have many different coderates with LDPC codes. Constructing LDPC Hmatrix based on a convolutional code can easily bring the advantage of convolutional codes to have different coderates. Moreover, both LDPC and convolutional decoding algorithms can be applied altogether in the decoding part. This process prevents the performance degradation of short-length WPC code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.260-268
• /
• 2012

The use of an error-correcting code is essential in communication systems where the channel is noisy. Unless a receiver has accurate channel coding parameters, it becomes difficult to decode the digitized encoding bits correctly. In this paper, we propose two algorithms for reconstructing convolutional codes: one for general convolutional codes and the other for punctured convolutional codes. And we also verify the algorithms by performing intensive computer simulation in additive white gaussian noise (AWGN) channel.