• 전기학회논문지
• /
• 제57권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• 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.

• 전기전자학회논문지
• /
• 제17권2호
• /
• pp.202-207
• /
• 2013

본 논문은 기존의 FAST와 BRIEF 알고리즘을 Zynq-7000 Soc Platform에서 하드웨어로 구현했다. 대표적으로 SIFT 나 SURF 알고리즘을 사용하여 특징점 기반 하드웨어 가속기로 구현 하지만, 하드웨어 비용과 내부 메모리가 많이 필요하다. 제안하는 FAST & BRIEF 가속기는 기존의 SIFT 나 SURF 가속기 보다 내부 메모리 사용량을 약 57%, 하드웨어 비용을 약 70% 정도 감소하고, 수행 시간은 Clock 당 0.17 Pixel를 처리한다.

• 동력기계공학회지
• /
• 제6권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년도 International Meeting on Information Display
• /
• 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.

• 음성과학
• /
• 제11권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.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1991년도 학술발표회 논문집
• /
• 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.

• 한국전자통신학회논문지
• /
• 제9권4호
• /
• pp.403-408
• /
• 2014

본 논문에서 우리는 저밀도 부호의 부호화 문제를 고찰한다. 특히 순환 치환 행렬을 이용한 저밀도 부호의 고속 부호화 알고리즘을 제시하였다. 고속 부호화 알고리즘은 고속 Hadamard 변환과 유사하며 결과적으로 제안 기법은 저밀도 부호의 간단하며 고속화된 부호화 알고리즘임을 보여주고 있다.

• Journal of Information Processing Systems
• /
• 제8권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.

• 한국통신학회논문지
• /
• 제33권6B호
• /
• pp.450-455
• /
• 2008

본 논문에서는 기존의 EPC Class 1 RFID 시스템에서의 태그 인식 절차와 태그 충돌 방지 알고리즘을 분석하였으며, 태그 인식 속도를 향상시키기 위한 고속 충돌 방지 알고리즘을 제안한다. 고속 충돌 방지 알고리즘에서는 태그 인식 과정에서 태그의 충돌 정보를 이용하고, 기존의 알고리즘에서 존재하던 불필요한 절차를 생략하였다. 성능 평가를 위하여 기존의 알고리즘과 제안한 알고리즘을 수학적으로 분석하였고, 이를 시뮬레이션으로 검증하였다. 결과에 따르면, 고속 충돌 방지 알고리즘이 기존의 알고리즘에 비해 상당한 성능향상을 보임을 확인할 수 있었다.