• Proceedings of the KSME Conference
• /
• 2000.04b
• /
• pp.777-782
• /
• 2000

The flow fields in the volute casing of a small-size turbo-compressor at different flowrate (design point ${\pm}20%$) are studied by numerical analysis. The governing equations for three-dimensional steady viscous flow are solved using SIMPLE algorithm with commercial code of STAR-CD. Numerical results show that the three-dimensional flow pattern inside the volute casing of a small-size turbo-compressor is strongly influenced by secondary flows that are typically created by the curvature or the casing passages. The flow pattern in the casing also affects the performance of the turbo-compressor. In order to elucidate the loss mechanism through the volute, we prepared the secondary flow, velocity magnitude, and static pressure distribution at the four cross-sectional planes of the casing.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.3
• /
• pp.544-558
• /
• 2013

This paper proposes a simplified and efficient control scheme for Unified Power Quality Conditioner (UPQC) based on three-level (NPC) inverter capable to mitigate source current harmonics and compensate all voltage disturbances perturbations such us, voltage sags, swells, unbalances and harmonics. The UPQC is designed by the integration of series and shunt active filters (AFs) sharing a common dc bus capacitor. The dc voltage is maintained constant using proportional integral voltage controller. The shunt and series AF are designed using a three-phase three-level (NPC) inverter. The synchronous reference frame (SRF) theory is used to get the reference signals for shunt and the power reactive theory (PQ) for a series APFs. The reference signals for the shunt and series APF are derived from the control algorithm and sensed signals are injected in tow controllers to generate switching signals for series and shunt APFs. The performance of proposed UPQC system is evaluated in terms of power factor correction and mitigation of voltage, current harmonics and all voltage disturbances compensation in three-phase, three-wire power system using MATLAB-Simulink software and SimPowerSystem Toolbox. The simulation results demonstrate that the proposed UPQC system can improve the power quality at the common connection point of the non-linear load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.19-33
• /
• 2008

A method that is adaptively selecting among previous fast motion estimation algorithms and a newly proposed fast motion estimation algorithm(UCDS) is presented in this paper. The algorithm named AUDC and a newly proposed fast motion estimation algorithms are based on the Diamond Search(DS) algorithm and Three Step Search(TSS). Although many previous fast motion estimation algorithms have lots of advantages, those have lots of disadvantages. So we thought better adaptive selection of fast motion estimation algorithms than only using one fast motion estimation algorithm. Therefore, we propose AUDC that is using length of the MV, Search Point, SAD of the neighboring block and adaptively selecting among Cross Three Step Search(CTSS), Diamond Search(DS) and Ungraded Cross Diamond Search(UCDS). Experimental results show that the AUDC is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching at algorithms.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.20 no.1
• /
• pp.1-10
• /
• 2015

This paper proposes a control algorithm for permanent magnet synchronous generators with a back-to-back three-level neutral-point clamped voltage source converter in a medium-voltage off-shore wind power system under unbalanced grid conditions. Specifically, the proposed control algorithm compensates for unbalanced grid voltage at the PCC (Point of Common Coupling) in a collector bus of an off-shore wind power system. This control algorithm has been formulated based on symmetrical components in positive and negative synchronous rotating reference frames under generalized unbalanced operating conditions. Instantaneous active and reactive power is described in terms of symmetrical components of measured grid input voltages and currents. Negative sequential component of AC input current is injected into the PCC in the proposed control strategy. The amplitude of negative sequential component is calculated to minimize the negative sequential component of grid voltage under the limitation of current capability in a voltage source converter. The proposed control algorithm enables the provision of balanced voltage at the PCC resulting in the high quality generated power from off-shore wind power systems under unbalanced network conditions.

• KSCI Review
• /
• v.14 no.1
• /
• pp.265-271
• /
• 2006

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps: preprocessing, classification, and matching, in the classification, we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.343-364
• /
• 2021

In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2610-2630
• /
• 2021

The aim of this paper is to propose the alternative algorithm to finish the process in public key cryptography. In general, the proposed method can be selected to finish both of modular exponentiation and point multiplication. Although this method is not the best method in all cases, it may be the most efficient method when the condition responds well to this approach. Assuming that the binary system of the exponent or the multiplier is considered and it is divided into groups, the binary system is in excellent condition when the number of groups is small. Each group is generated from a number of 0 that is adjacent to each other. The main idea behind the proposed method is to convert the exponent or the multiplier as the subtraction between two integers. For these integers, it is impossible that the bit which is equal to 1 will be assigned in the same position. The experiment is split into two sections. The first section is an experiment to examine the modular exponentiation. The results demonstrate that the cost of completing the modular multiplication is decreased if the number of groups is very small. In tables 7 - 9, four modular multiplications are required when there is one group, although number of bits which are equal to 0 in each table is different. The second component is the experiment to examine the point multiplication process in Elliptic Curves Cryptography. The findings demonstrate that if the number of groups is small, the costs to compute point additions are low. In tables 10 - 12, assigning one group is appeared, number of point addition is one when the multiplier of a point is an even number. However, three-point additions are required when the multiplier is an odd number. As a result, the proposed method is an alternative way that should be used when the number of groups is minimal in order to save the costs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.242-259
• /
• 2015

Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.3
• /
• pp.499-506
• /
• 2013

The accurate estimation of a fault location is desired in distance protection schemes for transmission lines in order to selectively deactivate a faulted line. However, a typical method to estimate a fault location by calculating impedances with voltages and currents at relaying points may have errors due to various factors such as the mutual impedances of lines, fault impedances, or effects of parallel circuits. The proposed algorithm in this paper begins by extracting the fundamental phasor of the positive sequence currents from the three phase currents. The second-order difference of the phasor is then calculated based on the fundamental phasor of positive sequence currents. The traveling times of the waves generated by a fault are derived from the second-order difference of the phasor. Finally, the distance from the relaying point to the fault is estimated using the traveling times. To analyze the performance of the algorithm, a power system with EHV(Extra High Voltage) untransposed double-circuit transmission lines is modeled and simulated under various fault conditions, such as several fault types, fault locations, and fault inception angles. The results of the simulations show that the proposed algorithm has the capability to estimate the fault locations with high speed and accuracy.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.168-178
• /
• 2005

The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.