• 제목/요약/키워드: Fast Fourier Transform Algorithm

검색결과 235건 처리시간 0.028초

단상/삼상 계통 전력 품질 평가를 위한 고조파 분석 알고리즘 개발 (The Algorithm Development on Harmonic Analysis for Estimating the Quality of 1-Phase/3-Phase Power System)

  • 임종수;이택기
    • 전력전자학회논문지
    • /
    • 제28권1호
    • /
    • pp.15-21
    • /
    • 2023
  • With the development of technology, a new class of smaller and more sensitive electrical systems have emerged, requiring higher quality power system. Improving the quality of the power system requires removing harmonics as much as possible to ensure better efficiency. We should first collect information on what harmonic frequencies are included in the current power system to remove the harmonics. In this paper, a new frequency analysis algorithm is introduced for a three-phase and a 1-phase power system. MTE PRS 600.3 is used to generate any harmonics to ensure that the algorithm performs well. Typing any harmonics on the Windows GUI program shows the analyzed result from the board developed for the algorithm.

블럭 FFT를 이용한 실시간 지문 인식 알고리즘 (Automatic Real-time Identification of Fingerprint Images Using Block-FFT)

  • 안도성;김학일
    • 전자공학회논문지B
    • /
    • 제32B권6호
    • /
    • pp.909-921
    • /
    • 1995
  • The objective of this paper is to develop an algorithm for a real-time automatic fingerprint recognition system. The algorithm employs the Fast Fourier Transform (FFT) in determining the directions of ridges in fingerprint images, and utilizes statistical information in recognizing the fingerprints. The information used in fingerprint recognition is based on the dircetions along ridge curves and characteristic points such as core points and delta points. In order to find ridge directions, the algorithm applies the FFT to a small block of the size 8x8 pixels, and decides the directions by interpreting the resulted Fourier spectrum. By using the FFT, the algorithm does not require conventional preprocessing procedures such as smoothing, binarization, thinning, and restorationl. Finally, in matching two fingerprint images, the algorithm searches and compares two kinds of feature blocks, one as the blocks where the dircetions cannot be defined from the Fourier spectrum, and the other as the blocks where the changes of directions become abrupt. The proposed algorithm has been implemented on a SunSparc-2 workstation under the Open Window environment. In the experiment, the proposed algorithm has been applied to a set of fingerprint images obtained by a prism system. The result has shown that while the rate of Type II error - Incorrect recognition of two different fingerprints as the identical fingerprints - is held at 0.0%, the rate of Type I error - Incorrect recognition of two identical fingerprints as the different ones - is 2.2%.

  • PDF

광역계통의 실시간해석을 위한 고속 저주파수 파라미터 추정 (Fast Estimation of Low Frequency Parameter for Real-Time Analysis in Wide Area Systems)

  • 김은주;심관식;김용구;김의선;남해곤;임영철
    • 전기학회논문지
    • /
    • 제58권6호
    • /
    • pp.1078-1086
    • /
    • 2009
  • This paper presents a Fourier based algorithm for estimating the parameters of the low frequency oscillating modes. The proposed methods estimates various parameters(frequency, damping factor, mode magnitude, phase) by fitting Fourier spectrum and phase with a damped exponential cosine function. Dominant frequency is selected by taking frequency corresponding to the peak spectrum, and damping factor is estimated using the left/right spectra of Fourier spectrum. In addition, mode magnitude is calculated by the normalized peak spectrum, and phase is estimated from spectrum phase. Also, we introduce an accuracy index in order to determine the accuracy of the estimated parameters, and the index is calculated using the deviations of the peak spectrum and the left/right spectra. The parameter estimation methods proposed in this paper include very simple arithmetical processes, so the algorithms are simple and the calculation speed is very fast. The proposed methods are applied to test functions with two dominant modes. The results show that the proposed methods are highly applicable to low frequency parameter estimation.

THD의 복소 성분을 이용한 고조파 왜곡 환경에서의 전력 계산 (Computation of Distortion Power Using Complex THD)

  • 최종욱;장길수
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제53권7호
    • /
    • pp.389-396
    • /
    • 2004
  • This paper introduces a new algorithm to calculate distortion power using complex THD(Total Harmonic Distortion) index. The proposed algorithm involves FFT(Fast Fourier Transform) to compute real and imaginary THDs of voltage and current. Case studies are presented to show the availability of the proposed method.

디지털 펄스압축기의 연산 양 비교 (Comparison of Computation Complexity for Digital Pulse Compressor)

  • 신현익;김상규;조태훈;김환우
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.2196-2199
    • /
    • 2003
  • With the development of digital signal processor(DSP), digital pulse compressor (DPC) is commonly used in radar systems. A DPC is implemented by using finite impulse response(FIR) filter algorithm in time domain or fast Fourier transform(FFT) algorithm in frequency domain. This paper compares the computation complexity tot these two methods and calculates boundary Fm filter taps that determine which of the two methods is better based on computation amount. Also, it shows that the boundary FIR filter taps for DSP, ADSP21060, and those for computation complexity have similar characteristic.

  • PDF

PARCOR 분석 방법에 의한 디지털 DTMF 수신기 구현에 관한 연구 (On Implementing the Digital DTMF Receiver Using PARCOR Analysis Method)

  • 하판봉;안수길
    • 대한전자공학회논문지
    • /
    • 제24권2호
    • /
    • pp.196-200
    • /
    • 1987
  • The following methods are proposed for implementing digital dual tone multi-frequency (DTMF) receiver: using infinite impulse response(IIR) digital filters, period-counting algorithm, discrete Fourier transform(DFT), and fast Fourier transform(FFT)[2]. The PARCOR(Partical Correlation) analysis method which has been widly used in the speech signal processing area is applied to the dual tone multi-frequency(DTMF) signal detection. This method is easy to implement digitally and stronger to digit simulation of speech than any other methods proposed up to date. Since sampling rate of 4KHz is used in the DTMF receiver for the detection of input DTMF signal originally sampled at 8KHz, it effects two times higher multiplexing efficiency.

  • PDF

A Searching and Enhancement Alogorithm for Shadow Areas Using Histogram and Correlation in Fourier Domain

  • Lee, Choong-Ho;Lee, Kwang-Jae;Seo, Doo-Chun;Kim, Yong-Seung
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
    • /
    • pp.552-554
    • /
    • 2003
  • Searching and enhancement of shadow area in the satellite imagery is one of growing interest because of new possible needs of application in this field. This paper proposes an algorithm to search and enhance the shadow areas caused by buildings such as apartments which are very common in Korean satellite imagery. The proposed searching algorithm makes use of characteristics of histogram of images in the spatial domain and also uses the fast Fourier transform and correlation in Frequency domain. Further, the enhancement algorithm is only applied to the shadow areas searched and preserves the areas which are naturally dark.

  • PDF

뇌전기파 분석용 FFT 프로세서 설계 (A design of FFT processor for EEG signal analysis)

  • 김은숙;신경욱
    • 한국정보통신학회논문지
    • /
    • 제14권11호
    • /
    • pp.2548-2554
    • /
    • 2010
  • 본 논문에서는 의료 서비스를 위한 뇌전기파(EEG: electroencephalogram) 신호 분석용 FFT(Fast Fourier Transform) 프로세서를 구현하였다. 실시간으로 발생하는 EEG 신호를 블록으로 나누어 short-time FFT 처리하기 위해 Hamming 창 함수를 사용하였으며, 이로 인해 감소되는 양끝의 값은 1/2 오버랩 시켜 보완하였다. 0~100 [Hz] 사이의 주파수 특성을 갖는 뇌전기파의 효율적인 대역 분석을 위해 256-point FFF 프로세서를 radix-4 알고리듬을 적용하여 구현하였으며, 단일 메모리 뱅크 구조를 사용하여 집적도를 높였다. 설계된 FFT 프로세서는 FPGA 구현을 통해 가능을 검증하였으며, 연산오차가 2% 이내로 높은 연산 정밀도를 갖는다.

새로운 DIT Radix-4 FFT 구조 및 구현 (A New DIT Radix-4 FFT Structure and Implementation)

  • 장영범;이상우
    • 한국산학기술학회논문지
    • /
    • 제16권1호
    • /
    • pp.683-690
    • /
    • 2015
  • FFT(Fast Fourier Transform) 알고리즘에는 DIT(Decimation-In-Time)와 DIF(Decimation-In-Frequency)가 있다. DIF 알고리즘은 Radix-2/4/8 등의 다양한 종류와 그 구현 방법이 개발되어 사용되고 잇으나, DIT 알고리즘은 순차적인 출력을 낼 수 있는 장점이 있음에도 불구하고 다양한 알고리즘이 연구되지 못하였다. 이 논문에서는 새로운 DIT Radix-4 FFT의 나비연산기(butterfly) 구조를 제안하고 검증하였다. 제안 구조를 사용하여 64-point FFT 구조를 설계하고 Verilog로 코딩하여 구현함으로써 제안 구조의 효용성을 입증하였다. 48개의 곱셈기를 사용하여 합성하였으며 678만 게이트 수를 나타내었다. 따라서 제안된 DIT Radix-4 FFT 구조는 순차적인 FFT 출력을 필요로 하는 OFDM 통신용 SoC(System on a Chip)에 사용될 수 있을 것이다.

뇌전기파 분석용 FFT 프로세서 설계 (A design of FFT processor for EEG signal analysis)

  • 김은숙;김해주;나영헌;신경욱
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2010년도 추계학술대회
    • /
    • pp.88-91
    • /
    • 2010
  • 본 논문에서는 의료 서비스를 위한 뇌전기파(EEG : electroencephalogram) 신호 분석용 FFT(Fast Fourier Transform) 프로세서를 구현하였다. 실시간으로 발생하는 긴 신호를 short-time FFT 처리하기 위해 Hamming 창 함수를 사용하였으며, 이로 인해 감소되는 양끝의 값은 1/2 오버랩 시켜주어 보완하였다. 0~100[Hz] 사이의 주파수 특성을 가지는 뇌전기파의 효율적인 대역 분석을 위해 256-point FFT 프로세서를 radix-4 알고리듬을 적용하여 구현하였고, 단일 메모리 뱅크 구조를 사용하여 집적도를 높였다. 설계된 FFT 프로세서는 연산오차가 3% 이내로 높은 연산 정밀도를 갖는다.

  • PDF