• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.2
• /
• pp.25-30
• /
• 1985

This paper proposes an algorithm to simplify Boolean functions into near minimal sum-of-products for Programmable Logic Arrays. In contrast to the conventional procedures, where the execution time depends on the number of variables, the execution time by this procedure depends on the degree of consensus of base minterms. Thus as the number of variables is increased, the difference of CPU time becomes larger using this new Procedure than using other procedures and consequently the executable range of input function increasing. The algorithm has been implemented on CYEER 170-740 and it's results were compared with those using Arvalo's algorithm.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.2
• /
• pp.63-75
• /
• 1993

As the CMOS technology becomes the most dominant circuit realization method, the cost problem for the test which includes both the transistor-level FET stuck-on and stuck-off faults and the gatelevel stuck-at faults becomes more and more serious. In accordance, this paper proposes a test set and its generation algorithm, which handles both the transistor-level faults and the gate-level faults, thus can unify the test steps during the IC design and fabrication procedure. This algorithm uses only the logic equation of the given logic function as the input resource without referring the transistor of gate circuit. Also, the resultant test set from this algorithm can improve in both the complexity of the generation algorithm and the time to apply the test as well as unify the test steps in comparing the existing methods.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.4
• /
• pp.433-441
• /
• 1992

This paper describes an algorithm that can efficiently analyze the ECG signal using frame knowledge representation technique. Input to the analysis process is a set of significant points which have been extracted from an original sampled signal(lead II) by the syntactic peak recognition algorithm. The hierarchical property of ECG signal is represented by hierarchical AND/OR graph. The semantic information and constraints of the ECG signal are desctibed by frame. As the control mechanism for labeling points, the search mechanism with the mixed paradigms of data-driven and model driven hypothesis formation, scoring function, hypothesis modification network and instance inheritance are used. We used the CSE database in order to evaluate the performance of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.10
• /
• pp.36-42
• /
• 1997

In the whole world, the research about the VLSI implementation of motion estimation algorithm is progressed to actively full (brute force) search algorithm research with the development of systolic array possible to parallel and pipeline processing. But, because of processing time's limit in a field to handle a huge data quantily such as a high definition television, many problems are happened to full search algorithm. In the paper, as a fast processing to using parallel scheme for the serial input image data, motion estimator of systolic array structure verifying that processing time is improved in contrast to the conventional full search algorithm.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.2
• /
• pp.125-134
• /
• 1994

This paper proposes a new top-down technology mapping algorithm for minimizing the chip area and the path delay time of lookup table-based field programmable gate array(FPGA). First, we present the decomposition and factoring algorithm using common subexpre ssion which minimizes the number of basic logic blocks and levels instead of the number of literals. Secondly, we propose a cube packing algorithm considering the decomposition of gates which exceed m-input lookup table. Previous approaches perform the cube packing and the gate decomposition independently, and it causes to increase the number of basic logic blocks. Lastly, the efficiency.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.5
• /
• pp.31-36
• /
• 1983

The indirect M.R.A.C. method using the W.L.S. algorithm is applied to the speed control of a D.C. motor on the assumption that the motor is the 1-st order, completely controllable and observable, non-minimum phase plant. By the help of M6809 microprocessor system the experiments are performed with respect to the sinusoidal and square reference input. The results show that the speed of a D.C. motor is well controlled by the indirect M.R.A.C. method using W.L.S, algorithm, and that the W.L.S. algorithm is quite suitable to the time-varying plant.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.234-243
• /
• 2017

With the development of smartphone technologies enable photoplethysmogram (PPG) acquisition by camera and heart rate (HR) measurement. This papers presents improved algorithm to extract HR from PPG signal recorded by smartphone camera and to develop real-time PPG signal processing Android application. 400 video samples recorded by Samsung smartphone camera are imported as input data for further processing and evaluating algorithm on MATLAB. An optimized algorithm is developed and tested on Android platform with different kind of Samsung smartphones. To assess algorithm's performance, medical device Beurer BC08 is used as reference. According to related works, accuracy parameters includes 90% number of samples that has relative errors less than 5%, Person correlation (r) more than 0.9, and standard estimated error (SEE) less than 5 beats-per-minutes (bpm).

• Journal of the military operations research society of Korea
• /
• v.22 no.2
• /
• pp.153-165
• /
• 1996

This paper presents an order releasing algorithm for an AMS. Order release policy determine order releasing time to shop floor so as to improve order management and shop performance. The proposed order releasing algorithm can cope with the dynamic environment of orders(e.g. change or cancel of order) flexibly and fastly, by processing individual order and exchanging the information(e.g. compeletion time or lateness of order, etc) with customer. And the objective of the order releasing algorithm is the observance of the due-date, therefore, it can provide customer with a reliability of order. Computer simulation is used to obtain the makespan of order which is the input data of the order releasing algorithm. The eight candidate part dispatching rules are simulated to selected an effective part dispatching rule for the computer simulation. By using the best effective part dispatching rule, the computer simulation is conducted to determine order releasing time.

• Journal of Information Technology Applications and Management
• /
• v.9 no.1
• /
• pp.27-44
• /
• 2002

Performance evaluations of database algorithms are usually conducted on a set of queries for a given test database. For more detailed evaluation results, it is often necessary to use different query workloads several times. Each query workload should reflect the querying patterns of the application domain in real world, which are non-uniform in the usage frequencies of attributes in queries of the workload for a given database. It is not trivial to generate many different query workloads manually, while considering non-uniform distributions of attributes'usage frequencies. In this paper we propose a technique to generate non-uniform distributions, which will help construct query workloads more efficiently. The proposed algorithm generates a query-attribute usage distribution based on given constraints on usage frequencies of attributes and qreries. The algorithm first allocates as many attributes to queries as Possible. Then it corrects the distribution by considering attributes and queries which are not within the given frequency constraints. We have implemented and tested the performance of the proposed algorithm, and found that the algorithm works well for various input constraints. The result of this work could be extended to help automatically generate SQL queries for various database performance benchmarking.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2382-2384
• /
• 2002

The accuracy in maneuvering target tracking using multiple models is caused by the suitability of each target motion model to be used. The interacting multiple model (IMM) algorithm and the adaptive IMM (AIMM) algorithm require the predefined sub-models and the predetermined acceleration intervals, respectively, in consideration of the properties of maneuvers in order to construct multiple models. In this paper, to solve these problems intelligently, a genetic algorithm (GA) based-IMM method using fuzzy logic is proposed. In the proposed method, the acceleration input is regarded as an additive noise and a sub-model is represented as a set of fuzzy rules to model the time-varying variances of the process noises of a new piecewise constant white acceleration model. The proposed method is compared with the AIMM algorithm in simulations.