• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.3
• /
• pp.446-452
• /
• 2008

To design a spiral inductor a genetic algorithm is applied with fast computing technique. For the inductance extraction of the given geometry the fast multipole method is used, also the distributed computing technique using 10 personal computers is introduced for the massive computation of the genetic algorithm. A few important design parameters are used as genes for the optimization in the genetic algorithm. The target function is chosen as mean square error of the inductance at several sampling frequency points. A large-scaled inductor is fabricated and compared with the simulated data.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1097-1100
• /
• 1999

Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

• Journal of IKEEE
• /
• v.17 no.2
• /
• pp.202-207
• /
• 2013

This paper implemented the conventional FAST and BRIEF algorithm as hardware on Zynq-7000 SoC Platform. Previous feature-based hardware accelerator is mostly implemented using the SIFT or SURF algorithm, but it requires excessive internal memory and hardware cost. The proposed FAST & BRIEF accelerator reduces approximately 57% of internal memory usage and 70% of hardware cost compared to the conventional SIFT or SURF accelerator, and it processes 0.17 pixel per Clock.

• Journal of Power System Engineering
• /
• v.6 no.3
• /
• pp.64-70
• /
• 2002

A fast decoupled algorithm for time domain simulation of power electronics circuits is presented. The circuits can be arbitrarily configured and can incorporate feedback amplifier circuits. This simulation algorithm is performed for the input series output parallel connected 2 switch forward converter. Steady state and large signal transient responses due to a step load change are simulated. The simulation results are verified through experiments.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• pp.737-740
• /
• 2008

Block-matching motion estimation plays an important role in video coding. In this paper, we propose an Efficient Search Algorithm for Fast Motion Estimation. The proposed algorithm detects motion variation for reducing computational complexity before determining motion vector. Experimental results show that the proposed algorithm has good performance than conventional algorithms through quantitative evaluation.

• Speech Sciences
• /
• v.11 no.2
• /
• pp.211-216
• /
• 2004

In this paper, we present a fast encoding algorithm for vector quantization with an approximate Euclidean distance calculation. An approximation is performed by converting floating point to the near integer. An inequality between the approximate Euclidean distance and the nearest distance is developed to avoid unnecessary distance calculations. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as conventional full search algorithm.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1991.06a
• /
• pp.38-41
• /
• 1991

RLS algorithms are required for applications to adaptive line enhancers, adaptive equalizers for voiceband telephone and HF modems, and wide-badn digital spectrum mobile raio in which their convergence time and tracking speed are significant. The fast QR RLS algorithm satisfies above the requirements. Its computational complexity is linearly proportional to the tap number of a filter, N and its performance remains numerically stable. From the result of simumulation, the fast QR RLS algorithm represented Cioffi is better than gradient based algorithm in its initial performance when being applied to an adaptive line enhancer for cancelling noise.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.4
• /
• pp.403-408
• /
• 2014

In this paper, we consider the encoding scheme of low density codes. In particular, we propose the fast encoding algorithm of the low density codes using circulant permutation matrices, The fast encoding algorithm is similar to the fast Hadamard transform, and the results show that the proposed scheme is a simple and fast encoding algorithm of the low density codes.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.685-692
• /
• 2012

B frame bi-directional predictions and the DIRECT mode coding of the H.264 video compression standard necessitate a complex mode decision process, resulting in a long computation time. To make H.264 feasible, this paper proposes an image backtrack-based fast (IBFD) algorithm and evaluates the performances of two promising fast algorithms (i.e., AFDM and IBFD). Evaluation results show that an image backtrack-based fast (IBFD) algorithm can determine DIRECT mode macroblocks with 13% higher accuracy, as compared with the AFDM. Furthermore, IBFD is shown to reduce the motion estimation time of B frames by up to 23% with a negligible quality degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6B
• /
• pp.450-455
• /
• 2008

We analyze the tag identification procedure of conventional EPC Class 1 RFID system and propose the fast anti-collision algorithm for the performance improvement of the system. In the proposed algorithm, the reader uses information of tag collisions and reduces unnecessary procedures of the conventional algorithm. We evaluate the performance of the proposed anti-collision algorithm and the conventional algorithm using mathematical analysis and simulation. According to the results, the fast anti-collision algorithm shows greatly better performance than conventional algorithm.