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

It is well known that Parallel Concatenated Convolutional Codes(turbo codes) has a good performance for long block sizes. This thesis has analyzed the performance of turbo code which is based on voice or control frames with short frame sizes in the future mobile communication system. Also, at the similar decoding complexity, the performance of turbo code and convolutional codes in the speech/control frames, and the applicability of this system are considered. As a result, turbo code in short frame sizes present the performance of a BER of $10^{-3}$ or more over 3 iterations in the future mobile communication system. However, at a BER of $10^{-3}$ , if the same complexity is considered, the performance of rate 1/2 turbo code with K = 5 is better than that of convolutional code with K = 9 at low $E_b/N_0$, and the performance of turbo code with K = 3 is superior to that of convolutional code with K = 7. Rate 1/3 turbo code with K = 3 and 5 have similar to performance of rate 1/2 turbo code.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.409-409
• /
• 2004

• Information and Communications Magazine
• /
• v.18 no.6
• /
• pp.119-125
• /
• 2001

1990년 초반부터 송신 다이버시티에 대한 연구가 있어 왔다. 1990년 후반부터는 송수신 다이버시티에 대한 실용적인 결과가 부호 이론과 접목이 되면서 나오기 시작한다. 그 중에서 매우 유용한 결과인 Space-Time 부호에 대하여 다룬다. 본 논문에서는 직교 Space-Time block code. Layered Space-Time processing, 그리고 Space-Time trellis Coding의 세 가지로 분류하여 내용을 정리한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1323-1326
• /
• 2014

In this letter, we compare the performance of two concatenated coding structures in slow FH/SS systems for multimedia/multicast transmission on shipboard. Two outer code symbols are transmitted during a hop. The first structure consists of one inner codeword per one outer code symbol, while the second structure consists of one inner codeword per two outer code symbols. We analyze the overall block error probability in asymptotic region and show that the performance of the second scheme is superior to the first one.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.55-67
• /
• 2008

This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure, we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicate. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in Knoop's algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.27-35
• /
• 2001

This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure, we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicated. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in knoop’s algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.

• Nuclear Engineering and Technology
• /
• v.45 no.4
• /
• pp.439-458
• /
• 2013

REX-10 is a fully-passive small modular reactor in which the coolant flow is driven by natural circulation, the RCS is pressurized by a steam-gas pressurizer, and the decay heat is removed by the PRHRS. To confirm design decisions and analyze the transient responses of an integral PWR such as REX-10, a thermal-hydraulic system code named TAPINS (Thermal-hydraulic Analysis Program for INtegral reactor System) is developed in this study. Based on a one-dimensional four-equation drift-flux model, TAPINS incorporates mathematical models for the core, the helical-coil steam generator, and the steam-gas pressurizer. The system of difference equations derived from the semi-implicit finite-difference scheme is numerically solved by the Newton Block Gauss Seidel (NBGS) method. TAPINS is characterized by applicability to transients with non-equilibrium effects, better prediction of the transient behavior of a pressurizer containing non-condensable gas, and code assessment by using the experimental data from the autonomous integral effect tests in the RTF (REX-10 Test Facility). Details on the hydrodynamic models as well as a part of validation results that reveal the features of TAPINS are presented in this paper.

• Journal of IKEEE
• /
• v.26 no.3
• /
• pp.506-509
• /
• 2022

In a secret sharing scheme, secret information must be distributed and stored to users, and confidentiality must be able to be reconstructed only from an authorized subset of users. To do this, secret information among different code words must not be subordinate to each other. The minimal code is a kind of linear block code to distribute these secret information not mutually dependent. In this paper, we present a novel extension technique for minimal codes. The product of an arbitrary vector and a minimal code produces a new minimal code with an extended length and Hamming weight. Accordingly, it is possible to provide minimal codes with parameters not known in the literature.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1068-1074
• /
• 2011

In this paper, the proposed scheme is STBC(space-time block codes) system combined with convolution code which is the most popular channel coding to ensure the reliability of data transmission for a high data rate wireless communication. The STBC is one of MIMO(multi-input multi-output) techniques. In addition, this scheme uses a modified viterbi algorithm in order to get a high system gain when data is transmitted. Because we combine STBC and convolution code, the proposed scheme has a little high quantity of computation but it can get a maximal diversity gain of STBC and a high coding gain of convolution code at the same time. Unlike existing viterbi docoding algorithm using Hamming distance in order to calculate branch matrix, the modified viterbi algorithm uses Euclidean distance value between received symbol and reference symbol. Simulation results show that the modified viterbi algorithm improved gain 7.5 dB on STBC 2Tx-2Rx at $BER=10^{-2}$. Therefore the proposed scheme using STBC combined with convolution code can improve the transmission reliability and transmission efficiency.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.