• Transactions of the Korean Society of Mechanical Engineers
• /
• v.13 no.3
• /
• pp.317-322
• /
• 1989

Effective computational strategies have been proposed in the evaluation of stiffness matrices of rigid-plastic finite element method widely used in simulation of metal forming processes. The stiffness matrices are expressed as the sum of stiffness matrices evaluated by reduced integration and Liu's stabilization matrices which control the occurrence os zero-energy mode due to excessive reduced integration. The proposed method has been applied to the solution of fundamental 3-dimensional problems. The results clarified that the deformed mesh configuration was remarkably stabilized and computation speed attained about 3 times as fast as that of conventional 3-dimensional analyses. Furthermore, computation speed increases by a factor 60 when parallel computation is introduced. This speed has a tendency to increase as the total degree of freedom increases. As a result, this rigid-plastic finite element method enables us to analyze real 3-dimensional forming processes with practically acceptable computation time.

• Journal of Information Technology Services
• /
• v.9 no.4
• /
• pp.219-229
• /
• 2010

The Green's equivalence relations have played a fundamental role in the development of semigroup theory. They are concerned with mutual divisibility of various kinds, and all of them reduce to the universal equivalence in a group. Boolean matrices have been successfully used in various areas, and many researches have been performed on them. Studying Green's relations on a monoid of boolean matrices will reveal important characteristics about boolean matrices, which may be useful in diverse applications. Although there are known algorithms that can compute Green relations, most of them are concerned with finding one equivalence class in a specific Green's relation and only a few algorithms have been appeared quite recently to deal with the problem of finding the whole D or J equivalence relations on the monoid of all $n{\times}n$ Boolean matrices. However, their results are far from satisfaction since their computational complexity is exponential-their computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and the size of the monoid of all $n{\times}n$ Boolean matrices grows exponentially as n increases. As an effort to reduce the execution time, this paper shows an isomorphism between the R relation and L relation on the monoid of all $n{\times}n$ Boolean matrices in terms of transposition. introduces theorems based on it discusses an improved algorithm for the J relation computation whose design reflects those theorems and gives its execution results.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.3
• /
• pp.304-309
• /
• 2002

We propose the computation reduction method of real root method that is mainly used in the CELP (Code Excited Linear Prediction) vocoder. The real root method is that if polynomial equations have the real roots, we are able to find those and transform them into LSP. However, this method takes much time to compute, because the root searching is processed sequentially in frequency region. In this paper, to reduce the computation time of real root, we compare the real root method with two methods. In first method, we use the mal scale of searching frequency region that is linear below 1 kHz and logarithmic above. In second method, The searching frequency region and searching interval are ordered by each coefficient's distribution. In order to compare real root method with proposed methods, we measured the following two. First, we compared the position of transformed LSP (Line Spectrum Pairs) parameters in the proposed methods with these of real root method. Second, we measured how long computation time is reduced. The experimental results of both methods that the searching time was reduced by about 47% in average without the change of LSP parameters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.6
• /
• pp.842-849
• /
• 2022

With the development of deep learning technology, there are many cases of using DNNs in embedded systems such as unmanned vehicles, drones, and robotics. Typically, in the case of an autonomous driving system, it is crucial to run several DNNs which have high accuracy results and large computation amount at the same time. However, running multiple DNNs simultaneously in an embedded system with relatively low performance increases the time required for the inference. This phenomenon may cause a problem of performing an abnormal function because the operation according to the inference result is not performed in time. To solve this problem, the solution proposed in this paper first reduces the computation by applying the Tucker decomposition to DNN models with big computation amount, and then, make DNN models run in parallel as much as possible in the unit of hidden layer inside the GPU. The experimental result shows that the DNN inference time decreases by up to 75.6% compared to the case before applying the proposed technique.

• Journal of Power Electronics
• /
• v.11 no.2
• /
• pp.202-210
• /
• 2011

Polymer electrolyte membrane (PEM) fuel cell is one of the popular renewable energy sources and widely used in commercial medium power areas from portable electronic devices to electric vehicles. In addition, the increased integration of the PEM fuel cell with power electronics, dynamic loads, and control systems requires accurate electrical models and simulation methods to emulate their electrical behaviors. Advancement in parallel computation techniques, various real-time simulation tools, and smart power hardware have allowed the prototyping of novel apparatus to be investigated in a virtual system under a wide range of realistic conditions repeatedly, safely, and economically. This paper builds up advancements of optimized model constructions for a fuel cell stack system on a real-time simulator in the view points of improving dynamic model accuracy and boosting computation speed. In addition, several considerations for a power hardware-in-the-loop (PHIL) simulation are provided to electrically emulate the PEM fuel cell stack system with power facilities. The effectiveness of the proposed PHIL simulation method developed on Opal RT's RT-Lab Matlab/Simulink based real-time engineering simulator and a programmable power supply is verified using experimental results of the proposed PHIL simulation system with a Ballard Nexa fuel cell stack.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.11
• /
• pp.2478-2484
• /
• 2010

In this paper, real-time detection methods for Panorama system Key-Points offers. A recent study in PANORAMA system real-time area navigation or DVR to apply such research has recently been actively. The detection of the Key-Point is the most important elements that make up a Panorama system. Not affected by contrast, scale, Orientation must be detected Key-Point. Existing research methods are difficult to use in real-time Because it takes a lot of computation time. Therefore, this paper propose BLOG(BitRate Laplacian Of Gaussian)method for faster time Key-Point Detecting and Through various experiments to detect the Speed, Computation, detection performance is compared against.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.160-168
• /
• 2011

A Frequency domain beamforming technique is widely used in sonar systems with a large number of beams and sensors. In the battlefield environment requiring real-time signal processing, it is needed to optimize the computational complexity of the spectrum computation to implement an efficient and fast frequency domain beamformer. So, in this paper, we proposed the pruned-GSFFT (pruned generalized sliding fast Fourier transform) as a new spectrum computation method. The proposed method help to reduce the computational complexity of the real-time partial spectrum computation by eliminating the redundancy between consecutive input samples and skipping the regardless frequency bands. Also the characteristics of the proposed pruned-GSFFT method and its computational complexity are compared to those of previous FFT algorithms.

• Journal of Biomedical Engineering Research
• /
• v.41 no.3
• /
• pp.128-137
• /
• 2020

Cardiac electrophysiology studies often use simulation to predict how cardiac will behave under various conditions. To observe the cardiac tissue movement, it needs to use the high--resolution heart mesh with a sophisticated and large number of nodes. The higher resolution mesh is, the more computation time is needed. To improve computation speed and performance, parallel processing using multi-core processes and network computing resources is performed. In this study, we compared the computational speeds of CPU parallelization and GPU parallelization in virtual heart simulation for efficiently calculating a series of ordinary differential equations (ODE) and partial differential equations (PDE) and determined the optimal CPU and GPU parallelization architecture. We used 2D tissue model and 3D ventricular model to compared the computation performance. Then, we measured the time required to the calculation of ODEs and PDEs, respectively. In conclusion, for the most efficient computation, using GPU parallelization rather than CPU parallelization can improve performance by 4.3 times and 2.3 times in calculations of ODEs and PDE, respectively. In CPU parallelization, it is best to use the number of processors just before the communication cost between each processor is incurred.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.6
• /
• pp.625-631
• /
• 2008

Correct evaluation of cut and fill volume of soil is one of the most important factors which controls construction cost in enormous construction sites. To achieve accurate computation of soil volume in construction site precise surveying is required, however most of construction sites adopt existing optical surveying instruments such as Total Station. The problem when using these optical instruments in construction sites is that these instruments take longer time in data acquisition. Due to insufficiency of computation time accurate and precise observation cannot be accomplished with these equipments. As a result roughly calculated earthwork volume may cause arguments between contractors and supervisors in the matter of reduction or increasement of total construction cost. In this study VRS-RTK Surveying is adopted to perform fast and accurate in-situ surveying for rapid computation of soil volume. This VRS-RTK Surveying system is proved to have more accurate three dimensional coordinates with high density and better economical solution with less manpower.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.543-545
• /
• 2017

This paper describes the SAO hardware architecture design for high performance in-loop filters. SAO is an inner module of in-loop filter, which compensates for information loss caused by block-based image compression and quantization. However, HEVC's SAO requires a high computation time because it performs pixel-unit operations. Therefore, the SAO hardware architecture proposed in this paper is based on a $4{\times}4$ block operation and a 2-stage pipeline structure for high-speed operation. The information generation and offset computation structure for SAO computation is designed in a parallel structure to minimize computation time. The proposed hardware architecture was designed with Verilog HDL and synthesized with TSMC chip process 130nm and 65nm cell library. The proposed hardware design achieved a maximum frequency of 476MHz yielding 163k gates and 312.5MHz yielding 193.6k gates on the 130nm and 65nm processes respectively.