skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Zoom Transform as a preprocessor for PARET. [Performs fast Fourier transform]

Abstract

The PARET algorithm for extracting mode or singularity parameters from a sampled record of transient experimental data has difficulty with data containing modes that are closely spaced in frequency relative to their absolute frequencies. It was felt that preprocessing the data with the so-called Zoom Transform might improve the performance of the PARET algorithm in such cases. This report describes a study carried out to determine the benefits of zooming to mode parameter estimation. The results suggest that zooming can greatly enhance the power of the PARET algorithm for certain types of data and should be implemented as a user option. 7 figures, 4 tables.

Authors:
;
Publication Date:
Research Org.:
California Univ., Livermore (USA). Lawrence Livermore Lab.
OSTI Identifier:
5769960
Report Number(s):
UCID-18272
DOE Contract Number:
W-7405-ENG-48
Resource Type:
Technical Report
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ALGORITHMS; PERFORMANCE TESTING; COMPUTER CODES; P CODES; DATA PROCESSING; FOURIER TRANSFORMATION; ISOLATED VALUES; SAMPLING; SINGULARITY; THEORETICAL DATA; TRANSIENTS; DATA; DATA FORMS; INFORMATION; INTEGRAL TRANSFORMATIONS; MATHEMATICAL LOGIC; NUMERICAL DATA; PROCESSING; TESTING; TRANSFORMATIONS; 990200* - Mathematics & Computers

Citation Formats

Smith, W.D., and Lager, D.L. Zoom Transform as a preprocessor for PARET. [Performs fast Fourier transform]. United States: N. p., 1979. Web.
Smith, W.D., & Lager, D.L. Zoom Transform as a preprocessor for PARET. [Performs fast Fourier transform]. United States.
Smith, W.D., and Lager, D.L. Tue . "Zoom Transform as a preprocessor for PARET. [Performs fast Fourier transform]". United States. doi:.
@article{osti_5769960,
title = {Zoom Transform as a preprocessor for PARET. [Performs fast Fourier transform]},
author = {Smith, W.D. and Lager, D.L.},
abstractNote = {The PARET algorithm for extracting mode or singularity parameters from a sampled record of transient experimental data has difficulty with data containing modes that are closely spaced in frequency relative to their absolute frequencies. It was felt that preprocessing the data with the so-called Zoom Transform might improve the performance of the PARET algorithm in such cases. This report describes a study carried out to determine the benefits of zooming to mode parameter estimation. The results suggest that zooming can greatly enhance the power of the PARET algorithm for certain types of data and should be implemented as a user option. 7 figures, 4 tables.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Sep 18 00:00:00 EDT 1979},
month = {Tue Sep 18 00:00:00 EDT 1979}
}

Technical Report:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that may hold this item. Keep in mind that many technical reports are not cataloged in WorldCat.

Save / Share:
  • This study examines the effects of computer architecture on FFT algorithm performance. The computer architectures evaluated are those of the Cray-1, CDC Cyber 750, IBM 370/155, DEC VAX 11/780, DEC PDP 11/60, DEC PDP 11/50, and Cromemco Z-2D. The algorithms executed are the radix-2, mixed-radix FFT (MFFT), Winograd Fourier Transform Algorithm (WFTA), and prime factor algorithm (PFA). The execution time of each algorithm for different sequence lengths is determined for each computer. Then the number of assembly language instructions executed are determined for the following categories: data transfers, floating point additions and subtractions, floating point multiplications and divisions, and integermore » operations. The correlation coefficients between the number of assembly language instructions in each category and the algorithm execution speeds are determined for each computer. The values of the correlation coefficients are then related to the computer architectures. The computer architectures are then compared against each other to determine what features are desireable in an FFT processor.« less
  • This report describes the algorithm and implementation of an out-of-core Fast Fourier Transform routine for the Thinking Machines Corp. CM-5 parallel computer. The software has the capability of transforming multi-dimensional arrays that are both real and complex.
  • In the analysis of turbulent flow, the evaluation of simulations is difficult because the results are three-dimensional and transient. We have found that analysis of the power spectra from the nodal time histories provides not only insight into the behavior of the flow, but it is a useful tool in determining the solution`s spatial (grid) and temporal (time step) convergence. We have developed a method and computer code for calculating the power spectrum for any set of equal-interval data. The code is called PWRSPEC. This report documents the method used to calculate the power spectrum, provides guidance on how tomore » use the PWRSPEC code, and includes an example problem that was used for code validation.« less