文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 高等教育 > 工学 > A Fast Harmonic Detection Method Based on Recursive DFT
侵权投诉

A Fast Harmonic Detection Method Based on Recursive DFT

A Fast Harmonic Detection Method Based on Recursive DFT

The Eighth International Conference on Electronic Measurement and Instruments ICEMI’2007

A Fast Harmonic Detection Method Based on Recursive DFT

Xin Limin Xu Weisheng Yu Youling

School of Electronics and Information Engineering, Tongji University, Shanghai 201408, China

Abstract: This paper proposed a fast harmonic detection interpolation equation is very difficult to be method based on recursive Discrete Fourier Transform, which solved. Moreover, FFT calculates all the harmonic is suitable for real-time calculation. The main features of the components. These characteristics make FFT too proposed method are that 1) it can be used to detect only time-consuming to be used for on-line purpose. specific harmonic components, 2) the recursive method needs Based on the features of real-time signal process, few calculation, so harmonic detection and compensation can a recursive discrete Fourier transform (RDFT[3]) be implemented on-line, 3) spectrum update is implemented in method, which updates the spectrum coefficients a step larger than one sampling period to avoid over-sampling, according to the new signal sample received is more 4) time-domain windowing has been taken into account to suitable for on-line harmonic detection. The principle reduce spectral leakage caused by asynchronous sampling. of RDFT is first briefly summarized. Improvement of These characteristics make the proposed method especially the classical RDFT to overcome over-sampling and compatible with hybrid active filter, in which structure only spectrum leakage is then proposed. Real-time specific harmonic components concerned are needed to be implementation approach of the method is discussed analyzed and harmonic compensation is implemented almost with calculation complexity analysis. Simulation immediately. result is finally analyzed as conclusion.

Keywords: Recursive DFT; harmonic detection; windowing; real-time calculation; spectrum leakage

2 P-step Windowing RDFT

A. Principle of RDFT

A single DFT output (the kth bin of an N-point

DFT) is defined by:

1 Introduction

The Discrete Fourier Transform (DFT) is one of the basic tools of spectrum analysis. Among the algorithms which enable DFT to be calculated in an effective way suitable for digital signal processing, the

ǐǐ

most popular are the fast Fourier transform (FFT1)) algorithms. FFT updates the signal spectrum every N (N represents the transform length) periods, where N must be a power of two. To compensate for leakage effect and grid effect, an interpolation algorithm based on windowing FFT is presented[2]. However, the interpolation algorithm requires large number of samples (usually 1024 samples or more), and

This research was supported by the National High-Tech Research and Development Program of China (863 Program)Grant No. 2006AA05Z211

1-4244-1135-1/07/$25.00 ©2007 IEEE.

Wej2S/N (1) X0(k) ¦x(n)W nk, =

n 0

Nˉ1

WhereX0(k)represents the kth order harmonic component of the N-point sequence. When the

rectangular window of N-point data moves one step forward, the kth order harmonic component is updated by:

X1(k) ¦x(n 1)W nk (2)

n 0

Nˉ1

From Eq.(1) and Eq.(2), a recursive way of computing DFT is gained as:

3-972

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email