• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.1-11
• /
• 2006

In this paper, we propose a new register file architecture called the Register File Extension for Multi-words or Long-word Operation (RFEMLO) to accelerate both symmetric and asymmetric cryptographic algorithms. Based on the idea that most of cryptographic algorithms heavily use multi-words or long-word operations, RFEMLO allows multiple contiguous registers to be specified as a single operand. Thus, a single instruction can specify a SIMD-style multi-word operation or a long-word operation. RFEMLO can be applied to general purpose processors by adding instruction set for multi-words or long-word operands and functional units for additional instruction set. To evaluate the performance of RFEMLO, we use Simplescalar/ARM 3.0 (with gcc 2.95.2) and run detailed simulations on various symmetric and asymmetric cryptographic algorithms. By applying RFEMLO, we could get maximum 62% and 70% reductions in the total instruction count of symmetric and asymmetric cryptographic algorithms respectively. Also, performance results show that a speedup of 1.4 to 2.6 can be obtained in symmetric cryptographic algorithms and a speedup of 2.5 to 3.3 can be obtained for asymmetric cryptographic algorithms when we apply RFEMLO to a processor with an in-order pipeline. We also found that RFEMLO can effectively improve the performance of these cryptographic algorithms with much less cost compared to issue-width increase available in Superscalar implementations. Moreover, the RFEMLO can also be applied to Superscalar processor, leading to additional 83% and 138% performance gain in symmetric and asymmetric cryptographic algorithms.

• The KIPS Transactions:PartB
• /
• v.14B no.3 s.113
• /
• pp.171-182
• /
• 2007

We propose a simple method for tracking a nonparameterized subject contour in a single video stream with a moving camera and changing background. Then we present a method to eliminate the tracked contour object by replacing with the background scene we get from other frame. First we track the object using LOD (Level-of-Detail) canny edge maps, then we generate background of each image frame and replace the tracked object in a scene by a background image from other frame that is not occluded by the tracked object. Our tracking method is based on level-of-detail (LOD) modified Canny edge maps and graph-based routing operations on the LOD maps. We get more edge pixels along LOD hierarchy. Our accurate tracking is based on reducing effects from irrelevant edges by selecting the stronger edge pixels, thereby relying on the current frame edge pixel as much as possible. The first frame background scene is determined by camera motion, camera movement between two image frames, and other background scenes are computed from the previous background scenes. The computed background scenes are used to eliminate the tracked object from the scene. In order to remove the tracked object, we generate approximated background for the first frame. Background images for subsequent frames are based on the first frame background or previous frame images. This approach is based on computing camera motion. Our experimental results show that our method works nice for moderate camera movement with small object shape changes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.32-37
• /
• 2008

Satellite communication systems including the DVB-S2 (Digital Video Broadcasting - Satellite Version 2) system require operations under low signal-to-noise ratio (SNR) and large frequency offset values, and the initial frame synchronization process necessitates a robust correlation method. While a variety of conventional correlation structures exist for the initial synchronization, each method has different characteristics and performance in different channel environments. In this paper, we propose new correlation methods which exhibit enhanced performance in low SNR and large frequency offsets, and analyze their performance. The proposed methods use the magnitude sum and vector sum of extended differential correlation values, to maximize the correlation between the received signal and the synchronization sequence by using the spanned differential correlation result. The magnitude sum correlation method has better performance compared to conventional methods including the approximated ML (Maximum likelihood) method for SNR values below 4 dB with or without frequency offsets. The vector sum correlation method has improved performance over the magnitude sum method for channels with relatively small frequency offsets.

• Journal of IKEEE
• /
• v.21 no.4
• /
• pp.388-396
• /
• 2017

Since there are many variables such as various poses, illuminations and occlusions in a face detection problem, a high performance detection system is required. Although CNN is excellent in image classification, CNN operatioin requires high-performance hardware resources. But low cost low power environments are essential for small and mobile systems. So in this paper, the CPU-FPGA integrated system is designed based on 3-stage cascade CNN architecture using small size FPGA. Adaptive Region of Interest (ROI) is applied to reduce the number of CNN operations using face information of the previous frame. We use a Field Programmable Gate Array(FPGA) to accelerate the CNN computations. The accelerator reads multiple featuremap at once on the FPGA and performs a Multiply-Accumulate (MAC) operation in parallel for convolution operation. The system is implemented on Altera Cyclone V FPGA in which ARM Cortex A-9 and on-chip SRAM are embedded. The system runs at 30FPS with HD resolution input images. The CPU-FPGA integrated system showed 8.5 times of the power efficiency compared to systems using CPU only.

• Journal of Navigation and Port Research
• /
• v.31 no.10
• /
• pp.807-812
• /
• 2007

With the advent of Electronic Chart Display and Information Systems(ECDIS) and Automatic Identification Systems (AIS) as the principal navigation equipment of E-navigation strategy, mariners will begin to practice "e-navigation" and increasingly rely upon these systems to navigate safely and efficiently. However, these electronic systems require "e-inputs" in order to function. At present, the choices for e-input are limited, and they are installation dependent. This means that the mariner must be suitably equipped in order to use an alternative e-input. If the primary e-input is lost, and the vessel is not equipped to make use of suitable alternative e-inputs, then continued operations will have to be done the "old fashioned way" using conventional navigation The final objective is a recommendation of dual harbor positioning system on the most appropriate mix of positioning systems to satisfy the marine needs for radionavigation, positioning services.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.451-463
• /
• 2003

Recently, there have been various research efforts to develop strategies for accelerating OLAP operations on huge amounts of spatio-temporal data. Most of the work is based on multi-tree structures which consist of a single R-tree variant for spatial dimension and numerous B-trees for temporal dimension. The multi~tree based frameworks, however, are hardly applicable to spatio-temporal OLAP in practice, due mainly to high management cost and low query efficiency. To overcome the limitations of such multi-tree based frameworks, we propose a new approach called Hilbert Cube(H-Cube), which employs fractals in order to impose a total-order on cells. In addition, the H-Cube takes advantage of the traditional Prefix-sum approach to improve Query efficiency significantly. The H-Cube partitions an embedding space into a set of cells which are clustered on disk by Hilbert ordering, and then composes a cube by arranging the grid cells in a chronological order. The H-Cube refines cells adaptively to handle regional data skew, which may change its locations over time. The H-Cube is an adaptive, total-ordered and prefix-summed cube for spatio-temporal data warehouses. Our approach focuses on indexing dynamic point objects in static spatial dimensions. Through the extensive performance studies, we observed that The H-Cube consumed at most 20% of the space required by multi-tree based frameworks, and achieved higher query performance compared with multi-tree structures.

• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.191-196
• /
• 2007

In the field of computer graphics, Navier-Stokes equations would be used for realistic simulations of smokes and currents. However, implementations derived from these equations are hard to achieve for real-time simulations, mainly due to its massive and complex calculations. Thus, there have been various attempts to approximate these equations for real-time simulation of smokes and others. When the advection terms of the equations are approximated by the Semi-Lagrange methods, the fluid density can be rapidly reduced and small-scale vorticity phenomena are easy to be missed, mainly due to the numerical losses over time. In this paper, we propose an improved numerical method to approximately calculate the advection terms, and thus eliminate these problems. To calculate the advection terms, our method starts to set critical regions around the target grid points. Then, among the grid points in a specific critical region, we search for a grid point which will be advected to the target grid point, and use the velocity of this grid point as its advection vector. This method would reduce the numerical losses in the calculation of densities and vorticity phenomena, and finally can implement more realistic smoke simulations. We also improve the overall efficiency of vector calculations and related operations through GPU-based implementation techniques, and thus finally achieve the real-time simulation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.67-74
• /
• 2013

Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.587-602
• /
• 2002

Replicated database system was emerged to resolve the problem of reduction of the availability and the reliability due to the communication failures and site errors generated at centralized database system. But if update transactions are many occurred, the update is equally executed for all replicated data. Therefore, there are many problems the same thing a message overhead generated by synchronization and the reduce of concurrency happened because of delaying the transaction. In this paper, I propose a new concurrency control algorithm for enhancing the degree of parallelism of the transaction in fully replicated database designed to improve the availability and the reliability. To improve the system performance in the replicated database should be performed the last operations in the submitted site of transactions and be independently executed update-only transactions composed of write-only transactions in all sites. I propose concurrency control method to maintain the consistency of the replicated database and reflect the result of update-only transactions in all sites. The superiority of the proposed method has been tested from the respondence and withdrawal rate. The results confirm the superiority of the proposed technique over classical correlation based method.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.9
• /
• pp.796-805
• /
• 2016

As a part of the first stage in the helicopter flight simulator development, this study numerically evaluates handling qualities of the dynamics model. The flight dynamics model was generated using public information for AS365 N2, the target aircraft of the simulator. The flight simulator is under development as a pilot training and research tool for firefighting missions. The assessment of the model intends to validate general characteristics and suitability before the model is enhanced with flight test data. The evaluation is based on the ADS-33E-PRF(Aeroautical Design Standard Performance Specification Handling Qualities Requirement) criteria, with consideration of category of the aircraft, missions, and environment. The numerical operations follow required or recommended procedures of flight test for compliance demonstration. Evaluation results are evaluated according to the rating specified in maneuverability ADS-33E-PRF. Results have identified to provide a satisfactory platform for flight dynamic model in the general helicopter simulator generated based on the RotorLibFDM, and can be used as a base for basic training and research.