• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.4
• /
• pp.207-215
• /
• 2009

In recent digital communication systems, the performance of Turbo Code used as the error correction coding method depends on the interleaver size influencing the free distance determination and iterative decoding algorithms of the turbo decoder. However, some iterations are needed to get a better performance, but these processes require large time delay. Recently, methods of reducing the number of iteration have been studied without degrading original performance. In this paper, the new method combining ME (Mean Estimate) stopping criterion with SDR (sign difference ratio) stopping criterion of previous stopping criteria is proposed, and the fact of compensating each method's missed detection is verified Faster decoding realizes that reducing the number of iterative decoding about 1~2 times by adopting our proposed method into serially concatenation of both decoder. System Environments were assumed DS-CDMA forward link system with intense MAI (multiple access interference).

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.248-253
• /
• 2000

This paper presents parametric study of long-rod penetration. Influences of yield stress of penetrator and target material on the penetration results such as crater size and penetrator residual length are contemplated. Numerical experiments are carried out with varying the value of static yield stress of materials. Lagrangian explicit code NET2D was used to perform parametric study. Element eroding algorithm was used to properly simulate long-rod penetration. Analytic and empirical model of long-rod penetration and Taylor test are used to explain the relationships of parameter and simulation results.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.57-63
• /
• 2007

The security of data in network is provided by encryption. Selective encryption is a recent approach to reduce the computational cost and complexity for large file size data such as image and video. This paper describes techniques to encrypt Huffman code and discusses the performance of proposed scheme. We propose a simple encryption technique applicable to the Huffman code and study effectiveness of encryption against insecure channel. Our scheme combine encryption process and compression process, and it can reduce processing time for encryption and compression by combining two processes.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2011.04a
• /
• pp.544-551
• /
• 2011

As the cargo tank size and configuration of Liquefied Natural Gas carriers(LNGC) grows in response to the global increase in demands for LNG and the necessities of its economical transportation, impact loading from sloshing may become one of the most important factors in the structural safety of LNG Cargo Containment Systems(CCS). The objective of this study is to demonstrate the procedure of the structural safety assessment of MARK III membrane type CCS under sloshing impact loading using local zooming analysis technique of LS-DYNA code.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.93-101
• /
• 2010

A true random number generator (TRNG) is widely used to generate secure random numbers for encryption, digital signatures, authentication, and so on in crypto-systems. Since TRNG is vulnerable to environmental changes, a deterministic function is normally used to reduce bias and improve the statistical properties of the TRNG output. In this paper, we propose a linear corrector for secure TRNG. The performance of a linear corrector is bounded by the minimum distance of the corresponding linear error correcting code. However, we show that it is possible to construct a linear corrector overcoming the minimum distance limitation. The proposed linear corrector shows better performance in terms of removing bias in that it can enlarge the acceptable bias range of the raw TRNG output. Moreover, it is possible to efficiently implement this linear corrector using only XOR gates, which must have a suitable hardware size for embedded security systems.

• Journal of ILASS-Korea
• /
• v.3 no.4
• /
• pp.25-34
• /
• 1998

Hygroscopic aerosols can rapidly grow in size by steam condensation even under subsaturated steam conditions. Much efforts have been made to handle this process, but there have been computational difficulties in handling the condensational growth of hygroscopic aerosols by contentional methods. A recently released computer code, CONTAIN 2.0, employs a new technique called Moving Sectional Method(MSM) to handle the growth of hygroscopic aerosols. As a part of the model verification efforts, we have used the code to simulate the VANAM M3U hygroscopic aerosol experiment. We assess the accuracies of the new MSM and the conventional Fixed Sectional Method(ESM) based on the simulation results. Also presented are discussions about the robustness of the MSM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1062-1067
• /
• 2008

ABBA codes, a class of quasi-orthognal space-time block codes (QoSTBC) proposed by Tirkkonen and others, allow full rate and a fast maximum likelihood (ML) decoding, but do not have full diversity. In this paper, a linear complex precoder is proposed for ABBA codes to achieve full rate and full diversity. Moreover, the same diversity produce as that of orthogonal space-time block code with linear complex precoder (OSTBC-LCP) is achieved. Meanwhile, the size of the linear complex precoder can be reduced by half without affecting performance, which means the same complexity of decoding as that of the conventional ABBA code is guaranteed.

• Journal of Information Technology Services
• /
• v.11 no.4
• /
• pp.263-275
• /
• 2012

It is becoming hard to maintain web applications because of high complexity and duplication of web pages. However, most of research about code clone is focusing on code hunks, and their target is limited to a specific language. Thus, we propose GSIM, a language-independent statistical approach to detect similar pages based on scarcity and frequency of customized tokens. The tokens, which can be obtained from pages splitted by a set of given separators, are defined as atomic elements for calculating similarity between two pages. In this paper, the domain definition for web applications and algorithms for collecting tokens, making matrics, calculating similarity are given. We also conducted experiments on open source codes for evaluation, with our GSIM tool. The results show the applicability of the proposed method and the effects of parameters such as threshold, toughness, length of tokens, on their quality and performance.

• Journal of Mechanical Science and Technology
• /
• v.18 no.7
• /
• pp.1177-1186
• /
• 2004

In this paper, the spray atomization characteristics of a gasoline direct-injection injector were investigated experimentally and numerically. To visualize the developing spray process, a laser sheet method with a Nd :YAG laser was utilized. The microscopic atomization characteristics such as the droplet size and velocity distribution were also obtained by using a phase Doppler particle analyzer system at the 5 ㎫ of injection pressure. With the experiments, the calculations of spray atomization were conducted by using the KIVA code with the LISA-DDB breakup model. Based on the agreement with the experimental results, the prediction accuracy of LISA-DDB breakup model was investigated in terms of the spray shapes, spray tip penetration, SMD distribution, and axial mean velocity. The results of this study provides the macroscopic and microscopic characteristics of the spray atomization, and prediction accuracy of the LISA-DDB model.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.1163-1167
• /
• 2018

The selective encryption scheme for canonical Huffman codes using the inversion of bit values is proposed. The symbols are divided into blocks of a certain size, and each symbol in the block is compressed by canonical Huffman coding. Blocks are determined to be sent in the original code or encrypted form. The encryption block inverts the values of the whole bits, and bits of block that do not encrypt are not inverted. Those compressed data are transmitted with the encryption information. It is possible to decrypt the compressed data on the receiving side using the encryption information and compressed data.