• Journal of Convergence Society for SMB
• /
• v.2 no.1
• /
• pp.33-40
• /
• 2012

Recently, embedded environment suffers a huge change, by growth of hardware and turning to be software-controlled. This has improved embedded software complexity. It also brought us the limit of the old development way to resolve the problem. Model-driven development is one solution to solve the limit common software development by previous way, and it became a one uses for embedded environment also. In this paper, we propose model based development approach for embedded software, witch consists of diagram editor and automatic code generator. The diagram editors are implemented by GMF, which include additional functions to solve memory restrictions and concurrent execution problems without OS environment to a automatic code generator. In order to verify the generated code, it will be tested in main control model of UAV by replacing existing module with generated one.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.677-690
• /
• 1995

In this paper, we propose the high efficiency data compression capable of error control using block-sorting, move to front(MTF) and arithmetic code with variable length in to fixed out. First, the substring with is parsed into length N is shifted one by one symbol. The cyclic shifted rows are sorted in lexicographical order. Second, the MTF technique is applied to get the reference of locality in the sorted substring. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one codeword. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation for symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy, compression ratio and coding times.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1462-1470
• /
• 2003

According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2000.04a
• /
• pp.55-62
• /
• 2000

In constructing a synthetic seismogram using ray-tracing method a suite of ray-code is required to obtain a realistic seismogram which is similar to the actual seismogram or earthquake record under consideration. An infinite number of rays exist for any arbitrarily located source and receiver. One select only a finite number of such rays in computing a synthetic seismogram so their selection becomes important to the validity of the seismogram being generated. Missing certain important rays or an inappropriate selection of ray-codes in tracing rays may result in wrong interpretation of the earthquake record or seismogram. Automatic ray-code generation will eliminate such problems. In this study we have developed an efficient algorithm, with which one can generate systemastically all the ray-codes connecting source and receiver arbitrarily located. The result of this work will helpful in analysing multiple reflections in seismic data processing as well as simulating Lg wave and multiply reflected or converted phases in earthquake study.

• International Journal of Contents
• /
• v.9 no.1
• /
• pp.33-37
• /
• 2013

BCH code is one of the most widely used error correcting code for the detection and correction of random errors in the modern digital communication systems. The conventional BCH encoder that is operated in bit-serial manner cannot adequate with the recent high speed appliances. Therefore, parallel encoding algorithms are always a necessity. In this paper, we introduced a new systolic array type BCH parallel encoder. To study the area and speed, several parallel factors of the systolic array encoder is compared. Furthermore, to prove the efficiency of the proposed algorithm using tree-type structure, the throughput and the area overhead was compared with its counterparts also. The proposed BCH encoder has a great flexibility in parallelization and the speed was increased by 40% than the original one. The results were implemented on synthesis and simulation on FPGA using VHDL.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.27-30
• /
• 2004

OFDMA is considered as one of the major candidates for broadband wireless access. The OFDMA signal is usually coherently demodulated, requiring the channel estimation which can be estimated using a known pilot signal. In multi-cell environment, the performance of channel estimation is mainly limited by intercell interference. It is desirable to use a pilot signal that can estimate the channel information robust to the intercell interference in the OFDMA uplink system. In this paper, we consider two types of pilot signal applicable to multi-cell OFDMA uplink systems: One is time-multiplexed pilot signal and the other is code­multiplexed pilot signal. Simulation results show that the code-multiplexed pilot is suitable for low mobility environment and time-multiplexed pilot is suitable for high mobility environment.

• Nuclear Engineering and Technology
• /
• v.55 no.9
• /
• pp.3320-3325
• /
• 2023

The scaled water-cooled Reactor Cavity Cooling System (RCCS) experimental facility reproduces a passive safety feature to be implemented in Generation IV nuclear reactors. It keeps the reactor cavity and other internal structures in operational conditions by removing heat leakage from the reactor pressure vessel. The present work uses Flownex one-dimensional thermal-fluid code to model the facility and predict the experimental thermal-hydraulic behavior. Two representative steady-state cases defined by the bulk volumetric flow rate are simulated (Re = 2,409 and Re = 11,524). Results of the cavity outlet temperature, risers' temperature profile, and volumetric flow split in the cooling panel are also compared with the experimental data and RELAP system code simulations. The comparisons are in reasonable agreement with the previous studies, demonstrating the ability of Flownex to simulate the RCCS behavior. It is found that the low Re case of 2,409, temperature and flow split are evenly distributed across the risers. On the contrary, there's an asymmetry trend in both temperature and flow split distributions for the high Re case of 11,524.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.13-18
• /
• 2015

The mutilevel holographic data storage offers considerable advantage for capacity, since it can store more than one bit per pixel. In this paper, we search the number of codewords for each code depending on three conditions: (1) the number of levels, (2) the number of pixels in a codeword, and (3) the minimum Euclidean distance of a code. Increasing the number of levels per pixel creates more capacity, while causing more errors, by reducing the noise margin. Increasing the number of pixels in a codeword can increase the code rate, which means more capacity, but increases the complexity of the encoder/decoder of the code. Increasing the minimum distance of a code reduces the detection error, while reducing the code rate of the code. In such a fashion, a system design will always have pros and cons, but our task is to find out an effective one under the given conditions for the system requirements. Therefore, the numbers we searched can provide some guidelines for effective code design.

• Journal of Software Assessment and Valuation
• /
• v.16 no.1
• /
• pp.37-44
• /
• 2020

The similarity of the software is extracted by the verification of comparing with the source code. The source code is the intellectual copyright of the developer written in the programming language. And the source code written in text format contains the contents of the developer's expertise and ideas. The verification for judging the illegal use of software copyright is performed by comparing the structure and contents of files with the source code of the original and the illegal copy. However, there is hard to do the one-to-one comparison in practice. Cause the suspected source code do not submitted Intentionally or unconsciously. It is now increasing practically. In this case, the comparative evaluation with execution code should be performed, and indirect methods such as reverse assembling method, reverse engineering technique, and sequence analysis of function execution are applied. In this paper, we analyzed the effectiveness of indirect comparison results by practical evaluation . It also proposes a method to utilize to the system and executable code files as a verification results.

• ETRI Journal
• /
• v.33 no.1
• /
• pp.60-70
• /
• 2011

Software is completely exposed to an attacker after it is distributed because reverse engineering is widely known. To protect software, techniques against reverse engineering are necessary. A code encryption scheme is one of the techniques. A code encryption scheme encrypts the binary executable code. Key management is the most important part of the code encryption scheme. However, previous schemes had problems with key management. In an effort to solve these problems in this paper, we survey the previous code encryption schemes and then propose a new code encryption scheme based on an indexed table. Our scheme provides secure and efficient key management for code encryption.