Search NASA⌕ Search

SEARCH · Search NASA

Results for “Fast Fourier transform”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

Feasibility study, software design, layout and simulation of a two-dimensional fast Fourier transform machine for use in optical array interferometry

The NASA-Cornell Univ.-Worcester Polytechnic Institute Fast Fourier Transform (FFT) chip based on the architecture of the systolic FFT computation as presented by Boriakoff is implemented into an operating device design. The kernel of the system, a systolic inner product floating point processor, was designed to be assembled into a systolic network that would take incoming data streams in pipeline fashion and provide an FFT output at the same rate, word by word. It was thoroughly simulated for proper operation, and it has passed a comprehensive set of tests showing no operational errors. The black box specifications of the chip, which conform to the initial requirements of the design as specified by NASA, are given. The five subcells are described and their high level function description, logic diagrams, and simulation results are presented. Some modification of the Read Only Memory (ROM) design were made, since some errors were found in it. Because a four stage pipeline structure was used, simulating such a structure is more difficult than an ordinary structure. Simulation methods are discussed. Chip signal protocols and chip pinout are explained.

Boriakoff, Valentin↗

A general purpose subroutine for fast fourier transform on a distributed memory parallel machine

One issue which is central in developing a general purpose Fast Fourier Transform (FFT) subroutine on a distributed memory parallel machine is the data distribution. It is possible that different users would like to use the FFT routine with different data distributions. Thus, there is a need to design FFT schemes on distributed memory parallel machines which can support a variety of data distributions. An FFT implementation on a distributed memory parallel machine which works for a number of data distributions commonly encountered in scientific applications is presented. The problem of rearranging the data after computing the FFT is also addressed. The performance of the implementation on a distributed memory parallel machine Intel iPSC/860 is evaluated.

Dubey, A.↗

Feasibility study, software design, layout and simulation of a two-dimensional Fast Fourier Transform machine for use in optical array interferometry

The goal of this project was the feasibility study of a particular architecture of a digital signal processing machine operating in real time which could do in a pipeline fashion the computation of the fast Fourier transform (FFT) of a time-domain sampled complex digital data stream. The particular architecture makes use of simple identical processors (called inner product processors) in a linear organization called a systolic array. Through computer simulation the new architecture to compute the FFT with systolic arrays was proved to be viable, and computed the FFT correctly and with the predicted particulars of operation. Integrated circuits to compute the operations expected of the vital node of the systolic architecture were proven feasible, and even with a 2 micron VLSI technology can execute the required operations in the required time. Actual construction of the integrated circuits was successful in one variant (fixed point) and unsuccessful in the other (floating point).

Boriakoff, Valentin↗

Fast Fourier transform analysis of rotor-bearing systems

Nonlinear transient analysis of rotor-bearing systems is becoming increasingly important in the analysis of modern-day rotating machinery to model such phenomena as oil film whirl. This paper develops an analysis technique incorporating modal analysis and fast Fourier transform techniques to analyze rotors with residual shaft bow and realistic nonlinear bearings. The technique is demonstrated on single-mass and three-mass rotor examples. Comparisons of the theoretical results with experimental data give excellent agreement.

Choy, K. C.↗

Fast Fourier transformation results from gamma-ray burst profiles

Several gamma-ray bursts in the BATSE data have sufficiently long durations and complex temporal structures with pulses that appear to be spaced quasi-periodically. In order to test and quantify these periods we have applied fast Fourier transformations (FFT) to all these events. We have also performed cross spectral analyses of the FFT of the two extreme (high-low) energy bands in each case to determine the lead/lag of the pulses in different energies.

Kouveliotou, Chryssa↗

Application of fast Fourier transforms to the direct solution of a class of two-dimensional separable elliptic equations on the sphere

An efficient, direct, second-order solver for the discrete solution of a class of two-dimensional separable elliptic equations on the sphere (which generally arise in implicit and semi-implicit atmospheric models) is presented. The method involves a Fourier transformation in longitude and a direct solution of the resulting coupled second-order finite-difference equations in latitude. The solver is made efficient by vectorizing over longitudinal wave-number and by using a vectorized fast Fourier transform routine. It is evaluated using a prescribed solution method and compared with a multigrid solver and the standard direct solver from FISHPAK.

Moorthi, Shrinivas↗

Transient excitation and data processing techniques employing the fast fourier transform for aeroelastic testing

The development of testing techniques useful in airplane ground resonance testing, wind tunnel aeroelastic model testing, and airplane flight flutter testing is presented. Included is the consideration of impulsive excitation, steady-state sinusoidal excitation, and random and pseudorandom excitation. Reasons for the selection of fast sine sweeps for transient excitation are given. The use of the fast fourier transform dynamic analyzer (HP-5451B) is presented, together with a curve fitting data process in the Laplace domain to experimentally evaluate values of generalized mass, model frequencies, dampings, and mode shapes. The effects of poor signal to noise ratios due to turbulence creating data variance are discussed. Data manipulation techniques used to overcome variance problems are also included. The experience is described that was gained by using these techniques since the early stages of the SST program. Data measured during 747 flight flutter tests, and SST, YC-14, and 727 empennage flutter model tests are included.

Jennings, W. P.↗

Analysis of eccentric annular incompressible seals. I - A new solution using fast Fourier transforms for determining hydrodynamic force

A new analysis procedure is presented which solves for the flow variables of an incompressible-flow annular pressure seal in which the rotor has a large static displacement from the centered position. The analysis begins with a set of governing equations based on a turbulent bulk-flow model and Moody's friction equation. No simplification of these bulk-flow equations is required for the solution procedure. Perturbation of the flow variables yields a set of zeroth and first-order equations. The zeroth-order equations (which model the large static displacement) are integrated by means of an efficient new method which employs fast Fourier transforms. Further integration of the zeroth-order pressures yields the hydrodynamic reactive force. Predictions for the hydrodynamic forces from this analysis procedure are in excellent agreement with available experimental results.

Nelson, C. C.↗

Discrete orthogonal function expansions for non-uniform grids using the fast Fourier transform

A technique for applying discrete Fourier series to infinite domains is presented. The technique uses mappings designed to minimize truncation error and can be applied to solve mixed initial boundary value problems among others. The method is alias-free and yields consistent differentiation and integration operators. The mapping-induced truncation error is explicitly expressible and small in nearly all cases of interest. The method is illustrated for three problems involving convection, diffusion, and vortex interaction.

Cain, A. B.↗

SIR-B ocean-wave enhancement with fast Fourier transform techniques

Shuttle Imaging Radar (SIR-B) imagery is Fourier filtered to remove the estimated system-transfer function, reduce speckle noise, and produce ocean scenes with a gray scale that is proportional to wave height. The SIR-B system response to speckled scenes of uniform surfaces yields an estimate of the stationary wavenumber response of the imaging radar, modeled by the 15 even terms of an eighth-order two-dimensional polynomial. Speckle can also be used to estimate the dynamic wavenumber response of the system due to surface motion during the aperture synthesis period, modeled with a single adaptive parameter describing an exponential correlation along track. A Fourier filter can then be devised to correct for the wavenumber response of the remote sensor and scene correlation, with subsequent subtraction of an estimate of the speckle noise component. A linearized velocity bunching model, combined with a surface tilt and hydrodynamic model, is incorporated in the Fourier filter to derive estimates of wave height from the radar intensities corresponding to individual picture elements.

Tilley, David G.↗

Ordered fast Fourier transforms on a massively parallel hypercube multiprocessor

The present evaluation of alternative, massively parallel hypercube processor-applicable designs for ordered radix-2 decimation-in-frequency FFT algorithms gives attention to the reduction of computation time-dominating communication. A combination of the order and computational phases of the FFT is accordingly employed, in conjunction with sequence-to-processor maps which reduce communication. Two orderings, 'standard' and 'cyclic', in which the order of the transform is the same as that of the input sequence, can be implemented with ease on the Connection Machine (where orderings are determined by geometries and priorities. A parallel method for trigonometric coefficient computation is presented which does not employ trigonometric functions or interprocessor communication.

Tong, Charles↗

Processing techniques for software based SAR processors

Software SAR processing techniques defined to treat Shuttle Imaging Radar-B (SIR-B) data are reviewed. The algorithms are devised for the data processing procedure selection, SAR correlation function implementation, multiple array processors utilization, cornerturning, variable reference length azimuth processing, and range migration handling. The Interim Digital Processor (IDP) originally implemented for handling Seasat SAR data has been adapted for the SIR-B, and offers a resolution of 100 km using a processing procedure based on the Fast Fourier Transformation fast correlation approach. Peculiarities of the Seasat SAR data processing requirements are reviewed, along with modifications introduced for the SIR-B. An Advanced Digital SAR Processor (ADSP) is under development for use with the SIR-B in the 1986 time frame as an upgrade for the IDP, which will be in service in 1984-5.

Leung, K.↗

Implementation of a Message Passing Interface into a Cloud-Resolving Model for Massively Parallel Computing

The capability for massively parallel programming (MPP) using a message passing interface (MPI) has been implemented into a three-dimensional version of the Goddard Cumulus Ensemble (GCE) model. The design for the MPP with MPI uses the concept of maintaining similar code structure between the whole domain as well as the portions after decomposition. Hence the model follows the same integration for single and multiple tasks (CPUs). Also, it provides for minimal changes to the original code, so it is easily modified and/or managed by the model developers and users who have little knowledge of MPP. The entire model domain could be sliced into one- or two-dimensional decomposition with a halo regime, which is overlaid on partial domains. The halo regime requires that no data be fetched across tasks during the computational stage, but it must be updated before the next computational stage through data exchange via MPI. For reproducible purposes, transposing data among tasks is required for spectral transform (Fast Fourier Transform, FFT), which is used in the anelastic version of the model for solving the pressure equation. The performance of the MPI-implemented codes (i.e., the compressible and anelastic versions) was tested on three different computing platforms. The major results are: 1) both versions have speedups of about 99% up to 256 tasks but not for 512 tasks; 2) the anelastic version has better speedup and efficiency because it requires more computations than that of the compressible version; 3) equal or approximately-equal numbers of slices between the x- and y- directions provide the fastest integration due to fewer data exchanges; and 4) one-dimensional slices in the x-direction result in the slowest integration due to the need for more memory relocation for computation.

Juang, Hann-Ming Henry↗

Platform for Postprocessing Waveform-Based NDE

Taking advantage of the similarities that exist among all waveform-based non-destructive evaluation (NDE) methods, a common software platform has been developed containing multiple- signal and image-processing techniques for waveforms and images. The NASA NDE Signal and Image Processing software has been developed using the latest versions of LabVIEW, and its associated Advanced Signal Processing and Vision Toolkits. The software is useable on a PC with Windows XP and Windows Vista. The software has been designed with a commercial grade interface in which two main windows, Waveform Window and Image Window, are displayed if the user chooses a waveform file to display. Within these two main windows, most actions are chosen through logically conceived run-time menus. The Waveform Window has plots for both the raw time-domain waves and their frequency- domain transformations (fast Fourier transform and power spectral density). The Image Window shows the C-scan image formed from information of the time-domain waveform (such as peak amplitude) or its frequency-domain transformation at each scan location. The user also has the ability to open an image, or series of images, or a simple set of X-Y paired data set in text format. Each of the Waveform and Image Windows contains menus from which to perform many user actions. An option exists to use raw waves obtained directly from scan, or waves after deconvolution if system wave response is provided. Two types of deconvolution, time-based subtraction or inverse-filter, can be performed to arrive at a deconvolved wave set. Additionally, the menu on the Waveform Window allows preprocessing of waveforms prior to image formation, scaling and display of waveforms, formation of different types of images (including non-standard types such as velocity), gating of portions of waves prior to image formation, and several other miscellaneous and specialized operations. The menu available on the Image Window allows many further image processing and analysis operations, some of which are found in commercially-available image-processing software programs (such as Adobe Photoshop), and some that are not (removing outliers, Bscan information, region-of-interest analysis, line profiles, and precision feature measurements).

Roth, Don↗

Symmetric Phase-Only Filtering in Particle-Image Velocimetry

Symmetrical phase-only filtering (SPOF) can be exploited to obtain substantial improvements in the results of data processing in particle-image velocimetry (PIV). In comparison with traditional PIV data processing, SPOF PIV data processing yields narrower and larger amplitude correlation peaks, thereby providing more-accurate velocity estimates. The higher signal-to-noise ratios associated with the higher amplitude correlation peaks afford greater robustness and reliability of processing. SPOF also affords superior performance in the presence of surface flare light and/or background light. SPOF algorithms can readily be incorporated into pre-existing algorithms used to process digitized image data in PIV, without significantly increasing processing times. A summary of PIV and traditional PIV data processing is prerequisite to a meaningful description of SPOF PIV processing. In PIV, a pulsed laser is used to illuminate a substantially planar region of a flowing fluid in which particles are entrained. An electronic camera records digital images of the particles at two instants of time. The components of velocity of the fluid in the illuminated plane can be obtained by determining the displacements of particles between the two illumination pulses. The objective in PIV data processing is to compute the particle displacements from the digital image data. In traditional PIV data processing, to which the present innovation applies, the two images are divided into a grid of subregions and the displacements determined from cross-correlations between the corresponding sub-regions in the first and second images. The cross-correlation process begins with the calculation of the Fourier transforms (or fast Fourier transforms) of the subregion portions of the images. The Fourier transforms from the corresponding subregions are multiplied, and this product is inverse Fourier transformed, yielding the cross-correlation intensity distribution. The average displacement of the particles across a subregion results in a displacement of the correlation peak from the center of the correlation plane. The velocity is then computed from the displacement of the correlation peak and the time between the recording of the two images. The process as described thus far is performed for all the subregions. The resulting set of velocities in grid cells amounts to a velocity vector map of the flow field recorded on the image plane. In traditional PIV processing, surface flare light and bright background light give rise to a large, broad correlation peak, at the center of the correlation plane, that can overwhelm the true particle- displacement correlation peak. This has made it necessary to resort to tedious image-masking and background-subtraction procedures to recover the relatively small amplitude particle-displacement correlation peak. SPOF is a variant of phase-only filtering (POF), which, in turn, is a variant of matched spatial filtering (MSF). In MSF, one projects a first image (denoted the input image) onto a second image (denoted the filter) as part of a computation to determine how much and what part of the filter is present in the input image. MSF is equivalent to cross-correlation. In POF, the frequency-domain content of the MSF filter is modified to produce a unitamplitude (phase-only) object. POF is implemented by normalizing the Fourier transform of the filter by its magnitude. The advantage of POFs is that they yield correlation peaks that are sharper and have higher signal-to-noise ratios than those obtained through traditional MSF. In the SPOF, these benefits of POF can be extended to PIV data processing. The SPOF yields even better performance than the POF approach, which is uniquely applicable to PIV type image data. In SPOF as now applied to PIV data processing, a subregion of the first image is treated as the input image and the corresponding subregion of the second image is treated as the filter. The Fourier transforms from both the firs and second- image subregions are normalized by the square roots of their respective magnitudes. This scheme yields optimal performance because the amounts of normalization applied to the spatial-frequency contents of the input and filter scenes are just enough to enhance their high-spatial-frequency contents while reducing their spurious low-spatial-frequency content. As a result, in SPOF PIV processing, particle-displacement correlation peaks can readily be detected above spurious background peaks, without need for masking or background subtraction.

Wemet, Mark P.↗

Analysis method for Fourier transform spectroscopy

A fast Fourier transform technique is given for the simulation of those distortion effects in the instrument line shape of the interferometric spectrum that are due to errors in the measured interferogram. The technique is applied to analyses of atmospheric absorption spectra and laboratory spectra. It is shown that the nonlinear least squares method can retrieve the correct information from the distorted spectrum. Analyses of HF absorption spectra obtained in a laboratory and solar CO absorption spectra gathered by a balloon-borne interferometer indicate that the retrieved amount of absorbing gas is less than the correct value in most cases, if the interferogram distortion effects are not included in the analysis.

Park, J. H.↗

Scanning Ultrasonic Spectroscopy System Developed for the Inspection of Composite Flywheels

Composite flywheels are being considered as replacements for chemical batteries aboard the International Space Station. A flywheel stores energy in a spinning mass that can turn a generator to meet power demands. Because of the high rotational speeds of the spinning mass, extensive testing of the flywheel system must be performed prior to flight certification. With this goal in mind, a new scanning system has been developed at the NASA Glenn Research Center for the nondestructive inspection of composite flywheels and flywheel subcomponents. The system uses ultrasonic waves to excite a material and examines the response to detect and locate flaws and material variations. The ultrasonic spectroscopy system uses a transducer to send swept-frequency ultrasonic waves into a test material and then receives the returning signal with a second transducer. The received signal is then analyzed in the frequency domain using a fast Fourier transform. A second fast Fourier transform is performed to examine the spacing of the peaks in the frequency domain. The spacing of the peaks is related to the standing wave resonances that are present in the material because of the constructive and destructive interferences of the waves in the full material thickness as well as in individual layers within the material. Material variations and flaws are then identified by changes in the amplitudes and positions of the peaks in both the frequency and resonance spacing domains. This work, conducted under a grant through the Cleveland State University, extends the capabilities of an existing point-by-point ultrasonic spectroscopy system, thus allowing full-field automated inspection. Results of an ultrasonic spectroscopy scan of a plastic cylinder with intentionally seeded flaws. The result of an ultrasonic spectroscopy scan of a plastic cylinder used as a proof-of-concept specimen is shown. The cylinder contains a number of flat bottomed holes of various sizes and shapes. The scanning system was able to successfully detect all the defects in the material. Ultrasonic spectroscopy results for a second specimen are shown along with a conventional ultrasonic C-scan. The second specimen is a section of a flywheel subcomponent that has a series of drilled holes and notches. This specimen is employed as a defect detection standard to evaluate the various nondestructive evaluation methods under consideration. Scanning results demonstrate the ability of the system to detect flaws on the order of 10 mils in the radial direction and 5 mils in the circumferential direction. Work conducted to date has shown that scanning ultrasonic spectroscopy is a viable tool for the inspection of composite flywheel systems. Ongoing development work is focused on refining the system and scanning parameters for improved resolution and defect detection.

Martin, Richard E.↗