• Journal of the Institute of Electronics Engineers of Korea SD
• /
• 제44권5호
• /
• pp.58-65
• /
• 2007

As multimedia portable devices become popular, the amount of computation for processing data including video compression has significantly increased. Various researches for low power consumption of the mobile devices and real time processing have been reported. Motion Estimation is responsible for 67% of H.264 encoder complexity. In this research, a new circuit is designed for motion estimation. The new circuit uses motion prediction based on approximate SAD, Alternative Row Scan (ARS), DAU, and FDVS algorithms. Our new method can reduce the amount of computation by 75% when compared to multi-frame motion estimation suggested in JM8.2. Furthermore, optimal number and size of reference frame blocks are determined to reduce computation without affecting the PSNR. The proposed Motion Estimation method has been verified by using the hardware and software Co-Simulation with iPROVE. It can process 30 CIF frames/sec at 50MHz.

• The KIPS Transactions:PartD
• /
• 제13D권2호
• /
• pp.175-182
• /
• 2006

Radars are used to detect the motion of the low flying enemy planes in the military. Radar-detected raw data are first processed and then inserted into the ground tactical C4I system. Next, these data we analyzed and broadcasted to the Shooter system in real time. But the accuracy of information and time spent on the displaying and graphical computation are dependent on the operator's capability. In this paper, we propose the Flying Object Tracking Management System that allows the displaying of the objects' trails in real time by using data received from the radars. We apply the coordinate system translation algorithm, existing communication protocol improvements with communication equipment, and signal and information computation process. Especially, radar signal duplication computation and synchronization algorithm is developed to display the objects' coordinates and thus we can improve the Tactical Air control system's reliability, efficiency, and easy-of-usage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제33권6C호
• /
• pp.487-497
• /
• 2008

This paper proposes a new adaptive QRD-M algorithm for MIMO systems. The proposed scheme controls the number of survivor paths,0 based on the channel condition at each layer. The original QRD-M algorithm used fixed M at each layer and it needs large M to achieve near-MLD (maximum-likelihood detection) performance. However, using the large M increases the computation complexity. In this paper, we further effectively control M by employing the channel indicator which includes not only the channel gain, but also instantaneous noise information without necessity of SNR measurement. We found that the ratio of the minimum path metric to the second minimum is good reliability indicator for the channel condition. By adaptively changing M based on this ratio, the proposed scheme effectively achieves near MLD performance and computation complexity of the proposed scheme is significantly smaller than the conventional QRD-M algorithms.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• 제21권2호
• /
• pp.64-70
• /
• 2007

A voltage drop in the electrical circuit must be unavoidable. The voltage drop in the electrical circuit means a loss of heat. The heat lost would change the characteristics of the insulator and thus, the insulating performance would be towered resulting in electric leakage, electric shock, power failure, fire and other accidents. Hence, an optimized design against the voltage drop in the electrical circuit must be an important factor determining safety and economy of electrical facilities. This study analyzed the effects of voltage drop on the electrical circuit for such low-voltage electrical facilities requiring the public safety foremost and subject to multi-distributed random loads as street lamps, buildings and subway stations, and thereupon, developed an optimized voltage drop computation program to enhance safety and economy of those electrical facilities.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제13권5호
• /
• pp.3-15
• /
• 2003

The secure group communication enables the members, which belong to the same group, to communicate each other in a secure and secret manner. To do so, it is the most important that a group key is securely distributed among them and also group membership is efficiently managed. In detail, the generation, the distribution and the refreshment of a group key would be highly regarded in terms of low communication and computation complexity. In this paper, we show you a new protocol to generate a group key which will be safely shared within a group, utilizing the 2-party Diffie-Hellman key exchange protocol and the complete binary tree. Our protocol has less complexity of computation per group member by substituting many parts of exponentiation computations for multiplications. Consequently, each group member needs constant computations of exponentiation and multiplication regardless of the group size in the protocol and then it has less complexity of the computation than that of any other protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제26권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.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 한국조명전기설비학회 2009년도 추계학술대회 논문집
• /
• pp.163-167
• /
• 2009

Although the domestic electric power consumption of lighting have shared 20${\sim}$30 % of the national electric power consumption, the spread of lighting control system which can reduce the electric power consumption have been insignificant. The government have set the demonstration project and given the incentive to promote the spread of lighting control system since 2008. The M&V (Measurement and Verification) methodology for lighting control system have not been set yet in our country, but the direct measurement was suggested in US. The direct measurement methodology can increase the accuracy of measurement, but it cost much money to burden a customer. This study have suggested a new M&V methodology which cost low and is simple relatively. I had measured the amount of electric consumption through both the direct measurement and the new M&V program computation, and have analyzed the deviation. The amount of electric consumption measured by the new M&V program computation have agreed with one by the direct measurement within the error range of the instrumentation in case of lab scale test, and the 4${\sim}$8 % deviation have existed in case of field evaluation.

• Journal of the Korean Society of Combustion
• /
• 제3권1호
• /
• pp.21-29
• /
• 1998

Mathematical modeling of combustion characteristics in HVOF thermal spray processes was carried out on the basis of equilibrium chemistry. The main objective of this work was the development of a computation code which allows to determine chemical composition of combustion products, adiabatic flame temperature, thermodynamic and transport properties. The free energy minimization method was employed with the descent Newton-Raphson technique for numerical solution of systems of nonlinear thermochemical equations. Adiabatic flame temperature was calculated by using a Newton#s iterative method incorporating the computation module of chemical composition. The performance of this code was verified by comparing computational results with data obtained by ChemKin code and in the literature. Comparisons between the calculated and measured flame temperatures showed a deviation less than 2%. It was observed that adiabatic flame temperature augments with increase in combustion pressure; the influence was significant in the region of low pressure but becomes weaker and weaker with increase in pressure. Relationships of adiabatic flame temperature, dissociation ratio and combustion pressure were also analyzed.

• Journal of Internet Computing and Services
• /
• 제12권3호
• /
• pp.131-137
• /
• 2011

GPUs were originally designed for graphic processing, and GPGPUs are general-purpose GPUs for numerical computation with high performance and low electric power. In this paper, we implemented the parallel LU factorization program for GPGPUs. In CUDA, which is computational environment for Nvidia GPGPUs, domains are divided into blocks, and multi-threads compute each sub-blocks Simultaneously. In LU factorization program, computation order should be artificially decided due to the data dependence. To resolve the data dependancy, we suggested a parallel LU program for GPGPUs, and also explained parallel reduction algorithm for partial pivoting of LU factorization. We finally present performance analysis to show efficiency of the parallel LU factorization program based on multi-threads on GPGPUs.

• Journal of Information Processing Systems
• /
• 제5권2호
• /
• pp.105-116
• /
• 2009

To solve the general problems surrounding the application of genetic algorithms in stereo matching, two measures are proposed. Firstly, the strategy of simplified population-based incremental learning (PBIL) is adopted to reduce the problems with memory consumption and search inefficiency, and a scheme for controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities. In addition, an alternative version of the proposed algorithm, without the use of a probability vector, is also presented for simpler set-ups. Secondly, programmable graphics-hardware (GPU) consists of multiple multi-processors and has a powerful parallelism which can perform operations in parallel at low cost. Therefore, in order to decrease the running time further, a model of the proposed algorithm, which can be run on programmable graphics-hardware (GPU), is presented for the first time. The algorithms are implemented on the CPU as well as on the GPU and are evaluated by experiments. The experimental results show that the proposed algorithm offers better performance than traditional BMA methods with a deliberate relaxation and its modified version in terms of both running speed and stability. The comparison of computation times for the algorithm both on the GPU and the CPU shows that the former has more speed-up than the latter, the bigger the image size is.