• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1815-1821
• /
• 2015

Rapid increase in population growth has made the mankind to delve in appropriate identification of individuals through biometrics. Foot Print Recognition System is a new challenging area involved in the Personal recognition that is easy to capture and distinctive. Foot Print has its own dimensions, different in many ways and can be distinguished from one another. The main objective is to provide a novel efficient automated system Segmentation using Foot Print based on structural relations among the features in order to overcome the existing manual method. This system comprises of various statistical computations of various foot print parameters for identifying the factors like Instep-Foot Index, Ball-Foot Index, Heel- Index, Toe- Index etc. The input is naked footprint and the output result to an efficient segmentation system thereby leading to time complexity.

• The Journal of Korea Robotics Society
• /
• v.4 no.4
• /
• pp.312-319
• /
• 2009

This paper proposes a low-complexity indoor localization method of mobile robot under the dynamic environment by fusing the landmark image information from an ordinary camera and the distance information from sensor nodes in an indoor environment, which is based on sensor network. Basically, the sensor network provides an effective method for the mobile robot to adapt to environmental changes and guides it across a geographical network area. To enhance the performance of localization, we used an ordinary CCD camera and the artificial landmarks, which are devised for self-localization. Experimental results show that the real-time localization of mobile robot can be achieved with robustness and accurateness using the proposed localization method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.262-269
• /
• 2003

Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Management (SCM). One of the key issues in the current SCM research area involved reducing both production and distribution costs. The purpose of this study is to determine the optimum quantity of production and transportation with minimum cost in the supply chain network. We have presented a mathematical model that deals with real world factors and constructs. Considering the complexity of solving such model, we have applied the genetic algorithm approach for solving this model computational experiments using a commercial genetic algorithm based optimizer. The results show that the real size problems we encountered can be solved In reasonable time

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.258-260
• /
• 2007

Nowadays the automotive circuit design becomes more complicated a practical modern car circuit usually contains thousands of wires. So the error connection between connector and pins becomes more difficult to be located. This paper proposes a general way to locate all error wires in an automotive circuit design. Firstly, we give an exact definition of error wire to guide our job. This definition also composes the core part of our algorithm. Then we limit the area of the error wires by several steps. During these steps, we apply breadth-first search method to step over all wires under consideration of reducing time cost. In addition, we apply bidirectional stack technique to organize the data structure for algorithm optimization. This algorithm can get a result with all error wires and doubtful wires in a very efficient way. The analysis of this algorithm shows that the complexity is linear. We also discuss some possible improvement of this algorithm.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.53-61
• /
• 2011

This research presents an adaptive fast motion estimation (ME) computation on the stage of uneven multi-hexagon grid search (UMHGS) algorithm included in an unsymmetrical-cross multi-hexagon-grid search (UMHexagonS) in H.264 standard. The proposed adaptive method is based on statistical analysis and previously obtained motion vectors to reduce the computational complexity of ME. For this purpose, the algorithm is decomposed into three processes: skipping, terminating, and reducing search areas. Skipping and terminating are determined by the statistical analysis of the collected minimum SAD (sum of absolute difference) and the search area is constrained by the slope of previously obtained motion vectors. Simulation results show that 13%-23% of ME time can be reduced compared with UMHexagonS, while still maintaining a reasonable PSNR (peak signal-to-noise ratio) and average bitrates.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.2
• /
• pp.68-73
• /
• 2002

Many paper about the adaptive algorithm based to LS(Least Square) to improve convergence speed are already presented. In this paper, we propose a wavelet based adaptive algorithm which improves the convergence speed and reduces computational complexity, and adapt two kinds of adaptive noise cancelers using the characteristic of speech signal. We compared the performance of the nosed algorithm with time and frequency domain adaptive algorithm using computer simulation of adaptive noise canceler based on synthesis speech. As the result the proposed algorithm is suitable for adaptive signal processing area using speech or acoustic signal.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.1-4
• /
• 2014

Although physical modeling synthesis is becoming more and more efficient in rich and natural high-quality sound synthesis, its high computational complexity limits its use in portable devices. This constraint motivated research of single-instruction multiple-data many-core architectures that support the tremendous amount of computations by exploiting massive parallelism inherent in physical modeling synthesis. Since no general consensus has been reached which grain sizes of many-core processors and memories provide the most efficient operation for sound synthesis, design space exploration is conducted for seven processing element (PE) configurations. To find an optimal PE configuration, each PE configuration is evaluated in terms of execution time, area and energy efficiencies. Experimental results show that all PE configurations are satisfied with the system requirements to be implemented in portable devices.

• Journal of the Korea Society for Simulation
• /
• v.12 no.1
• /
• pp.59-71
• /
• 2003

Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Management (SCM). One of the key issues in the current SCM research area involves reducing both production and distribution costs. The purpose of this study is to determine the optimum quantity of production and transportation with minimum cost in the supply chain network. We have presented a mathematical model that deals with real world factors and constraints. Considering the complexity of solving such model, we have applied the genetic algorithm approach for solving this model using a commercial genetic algorithm based optimizer. The results for computational experiments show that the real size problems we encountered can be solved in reasonable time.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.928-931
• /
• 2003

This paper presents a digit-serial/parallel multiplier for finite fields GF(2m). The hardware requirements of the implemented multiplier are less than those of the existing multiplier of the same class, while processing time and area complexity. The implemented multiplier possesses the features of regularity and modularity. Thus, it is well suited to VLSI implementation. If the implemented digit-serial multiplier chooses the digit size D appropriately, it can meet the throughput requirement of a certain application with minimum hardware. The multipliers and squarers analyzed in this paper can be used efficiently for crypto processor in Elliptic Curve Cryptosystem.

• ETRI Journal
• /
• v.44 no.3
• /
• pp.379-388
• /
• 2022

This study proposes a novel low-complexity algorithm for computing inverse fast Fourier transform (IFFT)/fast Fourier transform (FFT) operations in binary phase shift keying-modulated orthogonal frequency division multiplexing (OFDM) communication systems without requiring any twiddle factor multiplications. The peak-to-average power ratio (PAPR) reduction capacity of an efficient PAPR reduction technique, that is, H-SLM method, is evaluated using the proposed IFFT algorithm without any complex multiplications, and the impact of oversampling factor for the accurate calculation of PAPR is analyzed. The power spectral density of an OFDM signal generated using the proposed multiplierless IFFT algorithm is also examined. Moreover, the bit-error-rate performance of the H-SLM technique with the proposed IFFT/FFT algorithm is compared with the classical methods. Simulation results show that the proposed IFFT/FFT algorithm used in the H-SLM method requires no complex multiplications, thereby minimizing power consumption as well as the area of IFFT/FFT processors used in OFDM communication systems.