CA2116209A1 - Flexible data size fast fourier transform process for sparse frequency sinusoidal and harmonic signal analysis - Google Patents

Flexible data size fast fourier transform process for sparse frequency sinusoidal and harmonic signal analysis

Info

Publication number
CA2116209A1
CA2116209A1 CA002116209A CA2116209A CA2116209A1 CA 2116209 A1 CA2116209 A1 CA 2116209A1 CA 002116209 A CA002116209 A CA 002116209A CA 2116209 A CA2116209 A CA 2116209A CA 2116209 A1 CA2116209 A1 CA 2116209A1
Authority
CA
Canada
Prior art keywords
fft
radix
data size
windows
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
CA002116209A
Other languages
French (fr)
Inventor
Ian Dean-Ping Lu
Philip Lee
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CA002116209A priority Critical patent/CA2116209A1/en
Publication of CA2116209A1 publication Critical patent/CA2116209A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/14Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141Discrete Fourier transforms

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • Discrete Mathematics (AREA)
  • Algebra (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Complex Calculations (AREA)

Abstract

Conventional digital measurement instruments and software use radix-2 fast Fourier transform (FFT) to analyze steady state sinusoidal and harmonic signals. Steady state sinusoidal and harmonic signals occurs commonly in rotating machine vibration, mechanical and electrical modal oscillation, and electric power system. Analogue anti-aliasing filters and digital time domain windows, such as Hanning and Gaussian windows, are applied to the signal to reduce the error resulted from the radix-2 FFT. The use of these windows can be eliminated if the data size contains exact number of integral multiples of the sinusoidal and harmonic signals. Radix-2 FFT forces the user to limit data size (number of data points) to power of 2 (for example ...., 256, 512, 1024, 2048, ...). It is impossible to match a limited number of data sizes to the aforementioned signals with readily available data-sampling rates (such as 1000, 2000, 5000, 10000, ... samples per second). The following disclosure describe that through multiple application of flexible data size mixed radix FFT
can eliminate the use of the windows and produce more accurate results.

Description

~162~9 DIS C L O S U R E

This invention relates to a specially tle~igned computer software procedure to obtain maxil~lulll possible data accuracy for steady state sinusoidal and h~rmonic signals through the technique of flexible data size fast Fourier transform (FFT).

Steady state ~iml~oicl~l and harmonic signals occurs commonly in rotating m~chine vibration, me~h~ni~l and electric~l modal oscill~tinn, and electric power system harmonics and resonances.
All of these signals are periodic signals. If the digital data set of these signals colltains exactly integral number of periods of the signals to be tr~ rn~ " led by the ~ 1 to frequency domain, the resulting frequency component of the periodic signal is exact. This special condition of "integral periods" is almost never achieved through norm~lly available products. Because their data sizes are fixed to 256 points, 512 points, 1024 points, ... etc. and their time sampling rates are also fixed to 1000, 2000, 5000, 10000, .... points per second. It is not likely that the limited number of combination of the fixed data size and sampling rate can produce the desired integral periods. Time tl-)m~in windows, such as H~nning and G~ls~i~n windows, were introduced to reduce the ~parellt magnitude error resulted from the condition of "fractional periods" in the data set. But the a~ale phase error remains lln(h~nged by the windows.

One method to elimin~te the apparent error and the use of the windows is to provided con~illuously "adjustable s~mrling rate" such as 999, 1000, 1001, 1002,....s~mrl~s per second to cause the fixed number of data points to contain "integral periods". The cost of added hardware and the unusual s~mrling rates have deterred any wide use to this method.

This invention resolves the requirement of "integral periods" by adjusting or selecting the number of data points to get integral multiples of periods. The sampling rates are m~int~ined at normal increments. The norm~l method of radix-2 FFT is replaced by the mixed radix FFT. The following block diagram is the flow chart for the FLEXIBLE DATA SIZE FAST FOURIER
TRANSFORM PROCESS for SPARSE FREQUENCY SINUSOIDAL and HARMONIC SIGNAL
ANALYSIS.

The procedures of applying the FLEXIBLE DATA SIZE FAST FOURIER TRANSFORM
PROCESS for SPARSE FREQUENCY SINUSOIDAL and HARMONIC SIGNAL ANALYSIS
is also outlined in the block diagram below.

~LI~XIBLI~ DATASIZE E/AST l~OURIBR TR~NSEIORM PROOESS for SPA~S13 ~REQIJE~NCY SINllSOIDAL and HARMONIC SIGNAL ANALYSIS

21162~9 BLOCK DIAGRAM and ~;LOW CHART of the FIEXIBLE DATA SIZE FA~T FOURIER TRANSFORM PROCESS
for SPARSE FREQUENCY SINUSOIDAL and HARMONIC SIGNAL ANALYSIS.

FREQUENCY DIGITAL DIGITAL
SINUSOIDAL DIGITIZER DATA COMPUTER
or HARMONIC SAMPLING SAMPLING ~ SIMULATION
SIGNAL INTERVAL--dt INTERVAL=dt PROGRAM
FROM PHYSICAL
SYSTEM

SELECT
DATA SIZE, N
N
4\1 5 \/
CALCULATE TOTAL
FFT DATA TIME
Nxdt 6~I
DISPLAY
MAGNITUDE Nxdt SPECTRUM

7 ~ 8 ~ V
r T~ TrT~
~ b'TMn ln ~, FREQUENCY f 1 = T .. , l~
FOR THE EXACT f f T n x T ~ N x dt FFT
¦, n FIND NI
WHERE NI~N

NI=( I NI

FIND NID
DISPLAY OR MIXED RADIX WHERE NID=NI~5 RESULTS c FFT ~ &NID=Radix 1 x ..... RadixI

EXIT

PL13XIBL13 DATA SIZE~ IIAST ~OUR113R TRANSI~ORM PROOESS ~or SPARS13 ~REOUE~NCY SINUSOIDAL and HARMONIC SIGNAL ANALYSIS

21~6209 The functions for each of the blocks are described as follows.

Block Number Description This is a collve~-Lion~l analogue to digital converter. It has fixed sampling rates, ie 1,000 samples per second, 2000 s~mples per second, ...., 50,000 samples per second, .. "dt" is the time between sample and is the sampling period. A large number of digitally sampled data is stored here.
2 The digital data output from digital computer ~im~ ti~n programs are stored in the data storage device.
3 This is the first selection of the data size "N". "N" is an integer and usually a single radix based number such as 1024 for radix-2 or 1000 for radix-10.
4 Simple radix fast Fourier transform (~ l ), for e~r~mple radix-2 for 1024 data points programs or radix-10 for 1000 data point data. It will perform the FF~
within a relatively short time.

S Calculate the total data time (N x dt) for the "N" number of data points.

6 Display the m~gnit-1-ie spectrum of the FFT result. Screen cursers and programmed intli~ting devices on screen are used to assist the function of block number 7.

7 Through manually controlled curser movement on screen or programmed selection routine, select the desired frequency "f" for the exact FFT
calculation in block number 12.

8 Calculate the period "T" of the selected frequency.

9 Find the largest possible integer multiple "n" of period "T" such that nxT s Nxdt Calculate the number of data points "NI" that will COll~ill the integral number of periods. NI = (n x T) / dt DA~ASlZI~ FASr ~OURII~R TRANS~ORM PROCESS for SPARSE ~REOIJ~NCY SINUSOIDAL an~ HARI~50NIC SIGNAL ANALYSIS

2116~0g ,~ck Number Description 11 Search for an integer "NID" within the range of NI + 5, such that "NID"
can be factored in to practical and workable radices for the mixed radix FFT
in the next block.

NID = NI + S = Radixl x Radix2 x Radix3 x .... x RadixI
Where Radixl, Radix2, Radix3, ..., RadixI are positive integers.

12 Perform mixed radix FFT on the NID number of data points with the radix sequence given in block number 11.

13 Display or print out the mixed radix FFT results.

Exit, or return to block number 7 to select a di~erellt frequency, or return to block number 3 to select a new data size.

This invention is most effectively applied to sparse frequency sinusoidal and hslrmnnic signals. A modern desk-top digital computer can be programmed to execute the process. It is distinguished from the other inventions in the following manner:

1. The use of time flnm~in windows, such as the E~nnin~ and the G~ n windows, on the data is elimin~terl 2. The ma2~ullu~l possible frequency accuracy can be achieved with e~i~ting data set.

3. The maxilllum possible magnitude and phase accuracy can be achieved with e~ tin~ data set.

4. The use of signal input analogue anti-z~ ing filter can be elimin~te~l or relaxed. Because the high frequency harmonics do not fold-back onto the same frequency line at the low frequency end.

XIBLE DATASIZE FAST ~OURIER TRANSFORM PROCESS Eor SPARSE FREOllENCY SINUSOIDAL and HARMONIC SIGNAL ANALYSIS

-

Claims

The embodiments of the invention in which an exclusive property or privilege is claimed are as follows:
1. A process to calculate accurately the magnitude and phase of sparse frequency sinusoidal or harmonic signals, which comprises varying the size of the data set to contain an integral number of signal periods, selecting the radices for the mixed radix fast Fourier transform calculation to closely match the size of the data set, and resolving its Fourier transform through mixed radix fast Fourier transform.
CA002116209A 1994-02-22 1994-02-22 Flexible data size fast fourier transform process for sparse frequency sinusoidal and harmonic signal analysis Abandoned CA2116209A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CA002116209A CA2116209A1 (en) 1994-02-22 1994-02-22 Flexible data size fast fourier transform process for sparse frequency sinusoidal and harmonic signal analysis

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CA002116209A CA2116209A1 (en) 1994-02-22 1994-02-22 Flexible data size fast fourier transform process for sparse frequency sinusoidal and harmonic signal analysis

Publications (1)

Publication Number Publication Date
CA2116209A1 true CA2116209A1 (en) 1995-08-23

Family

ID=4152951

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002116209A Abandoned CA2116209A1 (en) 1994-02-22 1994-02-22 Flexible data size fast fourier transform process for sparse frequency sinusoidal and harmonic signal analysis

Country Status (1)

Country Link
CA (1) CA2116209A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1575232A1 (en) * 2004-03-10 2005-09-14 Matsushita Electric Industrial Co., Ltd. Fast Fourier Transformation (FFT) with adaption of the sampling rate in Digital Radio Mondiale (DRM) receivers
CN103793545A (en) * 2012-10-30 2014-05-14 波音公司 Electrical power system stability optimization system
CN109388061A (en) * 2017-08-11 2019-02-26 中国科学院计算技术研究所 A kind of sparse Fourier transform method and system of adaptive tuning

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1575232A1 (en) * 2004-03-10 2005-09-14 Matsushita Electric Industrial Co., Ltd. Fast Fourier Transformation (FFT) with adaption of the sampling rate in Digital Radio Mondiale (DRM) receivers
WO2005088923A1 (en) * 2004-03-10 2005-09-22 Matsushita Electric Industrial Co. Ltd. Fast fourier transformation (fft) with adaption of the sampling rate in digital radio mondiale (drm) receivers
CN103793545A (en) * 2012-10-30 2014-05-14 波音公司 Electrical power system stability optimization system
CN103793545B (en) * 2012-10-30 2018-04-27 波音公司 Stability of power system optimization system
CN109388061A (en) * 2017-08-11 2019-02-26 中国科学院计算技术研究所 A kind of sparse Fourier transform method and system of adaptive tuning
CN109388061B (en) * 2017-08-11 2020-07-10 中国科学院计算技术研究所 Self-adaptive-optimization sparse Fourier transform method and system

Similar Documents

Publication Publication Date Title
Pham et al. Wavelet-transform-based algorithm for harmonic analysis of power system waveforms
Grandke Interpolation algorithms for discrete Fourier transforms of weighted signals
US5867416A (en) Efficient frequency domain analysis of large nonlinear analog circuits using compressed matrix storage
US4301404A (en) Methods and apparatus for analyzing periodic waveforms
US6046595A (en) Group delay estimate system using least square fit to phase response ramp
US6208946B1 (en) High speed fourier transform apparatus
US5121065A (en) Mixed domain mixed ratio frequency response sampling
US4983906A (en) Frequency estimation system
WO2004080055A2 (en) Method and apparatus for the recovery of signals acquired by an interleaved system of digitizers with mismatching frequency response characteristics
Smith et al. Decomposition of multicomponent exponential decays by spectral analytic techniques
Sedláček et al. Interpolations in frequency and time domains used in FFT spectrum analysis
Jenq High-precision sinusoidal frequency estimator based on weighted least square method
Siemens et al. A nonrecursive equation for the Fourier transform of a Walsh function
CA2116209A1 (en) Flexible data size fast fourier transform process for sparse frequency sinusoidal and harmonic signal analysis
Waldmeyer Fast Fourier transform for step-like functions: The synthesis of three apparently different methods
EP0391524B1 (en) Phase accumulation dual tone multiple frequency generator
Stoynov Rotating Fourier transform—new mathematical basis for non-stationary impedance analysis
US5001660A (en) Waveform generation method using stored complex data
CN1023156C (en) Fast signal spectrum analytical method
Awad et al. More on jitter effects on sinewave measurements
EP0192981A1 (en) Circuit for measuring characteristics of a device under test
Dai et al. Quasi-synchronous sampling algorithm and its applications I. Principle and measurement of'average'values of periodic signal
US6295547B1 (en) Fourier transform apparatus
Paulter A causal regularizing deconvolution filter for optimal waveform reconstruction
Clements Digital signal acquisition and representation

Legal Events

Date Code Title Description
EEER Examination request
FZDE Discontinued