• ETRI Journal
• /
• v.36 no.1
• /
• pp.175-178
• /
• 2014

We introduce the Energy-Based Blind Separating (EBS) algorithm for extremely fast separation of mixed speech signals without loss of quality, which is performed in two stages: iterative-form separation and closed-form separation. This algorithm significantly improves the separation speed simply due to incorporating only some specific frequency bins into computations. Simulation results show that, on average, the proposed algorithm is 43 times faster than the independent component analysis (ICA) for speech signals, while preserving the separation quality. Also, it outperforms the fast independent component analysis (FastICA), the joint approximate diagonalization of eigenmatrices (JADE), and the second-order blind identification (SOBI) algorithm in terms of separation quality.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.6
• /
• pp.742-749
• /
• 2011

Power transmission lines are one of the most important components of electric power system. Failures in the operation of power transmission lines can result in serious power system problems. Hence, fault diagnosis (transient or permanent) in power transmission lines is very important to ensure the reliable operation of the power system. A hidden Markov model (HMM), a powerful pattern recognizer, classifies events in a probabilistic manner based on fault signal waveform and characteristics. This paper presents application of HMM to classify faults in overhead power transmission lines. The algorithm uses voltage samples of one-fourth cycle from the inception of the fault. The simulation performed in EMTPWorks and MATLAB environments validates the fast response of the classifier, which provides fast and accurate protection scheme for power transmission lines.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.2
• /
• pp.67-75
• /
• 2001

This paper presents a fast and effective methodology for service restoration in large-scale distribution systems. The service restoration problem is formulated as a constrained optimization problem and requires the fast computation time and superior solution because the more unfaulted out-of-service area should be restored as soon as possible. The proposed methodology is designed to consider the fast computation time and priority service restoration by dijkstra algorithm and fuzzy theory in large-scale distribution systems. Simulation results demonstrate the validity and effectiveness of the proposed on a 26-bus and 140-bus system.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.8
• /
• pp.21-25
• /
• 2009

Magnetic fluxes for maximum efficiency are calculated at five operating points as speed and torque are varied. The surface of magnetic flux for maximum efficiency is calculated by using the five points, Then, maximum efficiency control is fulfilled with the magnetic flux calculated from the surface of magnetic flux at a given speed and torque. Simulation results verify the effectiveness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.325-333
• /
• 1997

In fractral decoding procedure, the reconstructed image is obtained by iteratively applying the contractive transform to an arbitrary initial image. But this method is not suitable for the fast decoding because convergence speed depends on the selection of initial image. Therefore, the initial image to achieve fast decoding should be selected. In this paper, we propose an initial image estimation that can be applied to various decoding methods. The initial image similar to the original image is estimated by using only the compressed data so that the proposed method does not affect the compression ratio. From the simulation, the PSNR of the proposed initial image is 6dB higher han that of ones iterated output image of conventional decoding with Babaraimage. Computations in addition and multiplication are reduced about 96%. On the other hands, if we apply the proposed initial image to other decoding algorithms, the faster convergence speed is expected.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.482-485
• /
• 1996

We design a homing guidance law based on the proportional navigation for the fast-rolling, single-axis control missiles and analyse the misdistance of the designed guidance system. The guidance law includes a compensation scheme which compensates for the phase-shift between the commanded and achieved acceleration which is peculiar to the fast rolling airframe with single-axis control. In the error analysis of the guidance system, we calculate the misdistance with respect to the target maneuver on the 3-dimensional space via direct simulations. Also, we conduct adjoint simulation on the 2-dimensional plane in case that phase-shift is perfectly compensated. Finally we approximate the linear time-varying dynamics of the missile with autopilot to a linear time-invarient system, and as a result we can find the misdistance as a closed-form.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.794-798
• /
• 2010

This paper presents a new obstacle-avoidance method for mobile robots. This approach, called the FEB (Fast Elastic Band) method, has been developed and successfully tested on the experimental mobile robot PHOPE-1S. The FEB method eliminates the shortcomings of the elastic band method previously introduced, yet retains all the advantages of its predecessor. The FEB algorithm is computationally efficient, and it allows continuous and fast motion of the mobile robot without stopping for obstacles. The FEB-controlled mobile robot traverses very densely cluttered obstacle courses and is able to pass through narrow openings or narrow corridors without oscillations. The results of the simulation and experiment have verified the validity of the proposed method.

• Electronics and Telecommunications Trends
• /
• v.13 no.3 s.51
• /
• pp.61-70
• /
• 1998

The obvious way to make a computer system more powerful is to make the processor as fast as possible. Furthermore, adopting a large number of such fast processors would be the next step. This multiprocessor system could be useful only if it distributes workload uniformly and if its processors are fully utilized. To achieve a higher processor utilization, memory access latency must be reduced as much as possible and even more the remaining latency must be hidden. The actual latency can be reduced by using fast logic and the effective latency can be reduced by using cache. This article discusses what the memory latency problem is, how serious it is by presenting analytical and simulation results, and existing techniques for coping with it; such as write-buffer, relaxed consistency model, multi-threading, data locality optimization, data forwarding, and data prefetching.

• Proceedings of the KSME Conference
• /
• 2002.08a
• /
• pp.47-50
• /
• 2002

The numerical simulation of a 271-rod fuel assembly of nuclear Liquid-Metal Fast Reactor (LMFR) with an infernal blockage has been carried out. Internal blockage within a subassembly is addressed in the safety assessment because it potentially has very serious consequences for the reactor as a whole. Three dimensional calculations were performed using the SABRE4 computer code for the range of blockage positions and sizes to investigate the seriousness and detectability of the internal blockage. The magnitude and location of the peak temperatures together with the temperature distribution at the subassembly exit were calculated in order to look at the potential for damage within the subassembly, and the possibility of blockage detection. The analysis result shows that the 6-subchannel blockage causes large temperature rise within a assembly with practically no change in mixed mean temperature at the assembly exit.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.77-83
• /
• 1997

We present a fast adaptive block matching algorithm using variable search area and subsampling to estimate motion vector more exactly. In the presented method, the block is classified into one of three motion categories: zero motion vector block, medium-motion bolck or high-motion block according to mean absolute difference of the block. By the simulation, the computation amount of the presented methoe comparable to three step search algorithm and new three step search algorithm. In the fast image sequence, the PSNR of our algorithm increased more than TSS and NTSS, because our algorithm estimated motion vector more accurately.