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

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.64-66
• /
• 2012

본 논문에서는 각기 다른 자료를 지닌 두 송신자가 하나의 수신자에게 릴레이를 거쳐 자료를 전송하는 Ynetwork 시스템에서 Polar code 의 구조적인 특징을 이용해 오류율을 줄여 전송할 수 있는 방법을 제안한다. Polar code 는 부호의 길이 N 이 커짐에 따라 임의의 B-DMC(Binary-Discrete Memoryless Channel)에 대해 채널 용량을 달성할 수 있는 부호이며 반복적인 구조로 인해 부호화와 복호화 복잡도가 낮은 장점을 가진 부호이다. 이러한 성질을 이용해 Y-network 시스템의 릴레이에서 간단한 이진 모듈로 덧셈으로 전체 부호의 길이를 늘려 전송효율을 높일 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.1080-1089
• /
• 1999

The union upper bounds to the bit error probability of maximum likelihood(ML) soft-decoding of parallel concatenated convolutional codes(PCCC) and serially concatenated convolutional codes(SCCC) can be evaluated through the weight enumerating function(WEF). This union upper bounds become the lower bounds of the BER achievable when iterative decoding is used. In this paper, to compute the WEF, an efficient error event search algorithm which is a combination of stack algorithm and bidirectional search algorithm is proposed. By computor simulation, it is shown that the union boounds obtained by using the proposed algorithm become the lower bounds to BER of concatenated convolutional codes with iterative decoding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.219-228
• /
• 2010

In this paper, performance of RS (Reed-Solomon), turbo and LDPC (low density parity check) code in the binary symmetric erasure channel is investigated. When the average erasure length is reduced, the frequency of short erasures is increased. The RS code shows serious performance degradation in such an environment since decoding is carried out symbol-by-symbol. As the erasure length is increased, however, the RS code shows much improved en-or performance. On the other hand, the message and corresponding parity symbols of the turbo code can be erased at the same time for the long erasures. Accordingly, iterative decoding of the turbo code can not improve error performance any more for such a long erasure. The LDPC code shows little difference in error performance with respect to the variation of the average erasure length due to the virtual interleaving effect. As a result, the LDPC code has much better erasure decoding performance than the RS and turbo code.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.4
• /
• pp.40-46
• /
• 2006

The performance of iterative multiuser detector and turbo decoder is presented to provide high quality multimedia services in WCDMA (wideband code division multiple access) system in this paper. Especially the relationship between the local iteration of turbo decoder and the global iteration of multiuser detector including the turbo decoder is analyzed. As a result, three local iterations and three global iterations are considered to be sufficient to provide satisfactory error performance with resonable complexity. The interference cancellation capability of global iteration is improved when the number of users is increased.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.2
• /
• pp.10-17
• /
• 1989

The Berlekamp-Massey algorithm, the method of using the Euclid algorithm, and Fourier transforms over a finite field can be used for the decoding of Reed-Solomon codes (called RS codes). RS codes can also be decoded by the algorithm that was developed by Peterson and refined by the Gorenstein and Zierler. However, the decoding of RS codes using the Peterson-Gorenstein-Zieler algorithm offers sometimes computational or implementation advantages. The decoding procedure of the double-error correcting (31,27) Rs code over the symbol field GF ($2^5$) will be analyized in this paper. The complete analysis, gate array design, and implementation for encoder/decoder pair of (31.27)RS code are performed with a strong theoretical justification.

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

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1952-1955
• /
• 2003

최근에 표준화된 H.264 의 인트라 예측은 I-프레임을 압축하는데 사용된다. 최대의 코딩효율을 위해서 부호화기는 모든 인트라 예측 모드를 반복적으로 찾는다. 그러나 이것은 H.264 의 부호화기 복잡도를 매우 크게 하는 단점이 있다. 모든 경우의 모드중에 영상에 따라서는 특히 그 발생 가능성이 높거나 낮은 경우의 모드가 발생한다. 본 논문에서는 에지맵을 이용하여 H.264 의 인트라 예측 모드를 선별적으로 선택하는 방법을 제안한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.10
• /
• pp.5162-5168
• /
• 2013

Hopping sequences of Time Hopped Ultra Wideband Impulse Radio (TH-UWB-IR) system are to mitigate multipath fading and to provide the multiple access chances for multi users. For the reliable communications, the same pulses are repeatedly transmitted for a bit duration based on hopping sequences. The proposed decoding scheme utilizes the intervals of inter-codes in a frame where the short interval between two pulses leads to the large interference by the multipath fading. For a single user case, the proposed method obtains 0.5dB gain over the conventional method at BER=$10^{-3}$. Decoding performance of repeated pulses can be increased using the property of the hopping sequences of multi users.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.21-27
• /
• 2013

In this paper, we propose a low-complexity Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding) system. A Turbo code is a powerful error correcting code with a BER (bit error rate) performance very close to the Shannon limit. In order to increase spectral efficiency of the Turbo code, a coded modulation combining Turbo code with high order modulation is used. The BER performance of Turbo-BICM can be improved by Turbo-BICM-ID using iterative demodulation and decoding algorithm. However, compared with Turbo-BICM, the decoding complexity of Turbo-BICM-ID is increased by exchanging information between decoder and demodulator. To reduce the decoding complexity of Turbo-BICM-ID, we propose a low-complexity Turbo-BICM-ID system. When compared with conventional Turbo-BICM-ID, the proposed scheme not only show similar BER performance but also reduce the decoding complexity.