Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast Fourier transform (FFT)”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Cloud cover typing from environmental satellite imagery. Discriminating cloud structure with Fast Fourier Transforms (FFT)

The use of two dimensional Fast Fourier Transforms (FFTs) subjected to pattern recognition technology for the identification and classification of low altitude stratus cloud structure from Geostationary Operational Environmental Satellite (GOES) imagery was examined. The development of a scene independent pattern recognition methodology, unconstrained by conventional cloud morphological classifications was emphasized. A technique for extracting cloud shape, direction, and size attributes from GOES visual imagery was developed. These attributes were combined with two statistical attributes (cloud mean brightness, cloud standard deviation), and interrogated using unsupervised clustering amd maximum likelihood classification techniques. Results indicate that: (1) the key cloud discrimination attributes are mean brightness, direction, shape, and minimum size; (2) cloud structure can be differentiated at given pixel scales; (3) cloud type may be identifiable at coarser scales; (4) there are positive indications of scene independence which would permit development of a cloud signature bank; (5) edge enhancement of GOES imagery does not appreciably improve cloud classification over the use of raw data; and (6) the GOES imagery must be apodized before generation of FFTs.

Logan, T. L.↗
NASA NTRS1988

Aircraft on-board SAR processing using a frequency-domain fast correlation technique

The design of a frequency-domain fast correlation processor for aircraft onboard synthetic-aperture radar (SAR) applications is described. The design uses the fast Fourier transform (FFT) fast correlation technique to perform both range and azimuth pulse compression functions for the NASA/JPL L-band, quad-polarization airborne SAR. The subject processor is computationally efficient and requires a simple control unit. It is capable of producing single-look, 8-m (slant range) by 10-m (azimuth) resolution, SAR images of a selected polarization over a swath width of up to 15 km in real time onboard the aircraft.

Liu, Kuang Y.↗
NASA NTRS2011

Wavelet Filter Banks for Super-Resolution SAR Imaging

This paper discusses Innovative wavelet-based filter banks designed to enhance the analysis of super resolution Synthetic Aperture Radar (SAR) images using parametric spectral methods and signal classification algorithms, SAR finds applications In many of NASA's earth science fields such as deformation, ecosystem structure, and dynamics of Ice, snow and cold land processes, and surface water and ocean topography. Traditionally, standard methods such as Fast-Fourier Transform (FFT) and Inverse Fast-Fourier Transform (IFFT) have been used to extract Images from SAR radar data, Due to non-parametric features of these methods and their resolution limitations and observation time dependence, use of spectral estimation and signal pre- and post-processing techniques based on wavelets to process SAR radar data has been proposed. Multi-resolution wavelet transforms and advanced spectral estimation techniques have proven to offer efficient solutions to this problem.

Sheybani, Ehsan O.↗
NASA NTRS1989

Performance of FFT methods in local gravity field modelling

Fast Fourier transform (FFT) methods provide a fast and efficient means of processing large amounts of gravity or geoid data in local gravity field modelling. The FFT methods, however, has a number of theoretical and practical limitations, especially the use of flat-earth approximation, and the requirements for gridded data. In spite of this the method often yields excellent results in practice when compared to other more rigorous (and computationally expensive) methods, such as least-squares collocation. The good performance of the FFT methods illustrate that the theoretical approximations are offset by the capability of taking into account more data in larger areas, especially important for geoid predictions. For best results good data gridding algorithms are essential. In practice truncated collocation approaches may be used. For large areas at high latitudes the gridding must be done using suitable map projections such as UTM, to avoid trivial errors caused by the meridian convergence. The FFT methods are compared to ground truth data in New Mexico (xi, eta from delta g), Scandinavia (N from delta g, the geoid fits to 15 cm over 2000 km), and areas of the Atlantic (delta g from satellite altimetry using Wiener filtering). In all cases the FFT methods yields results comparable or superior to other methods.

Forsberg, Rene↗
NASA NTRS1988

Fast Fourier Transform algorithm design and tradeoffs

The Fast Fourier Transform (FFT) is a mainstay of certain numerical techniques for solving fluid dynamics problems. The Connection Machine CM-2 is the target for an investigation into the design of multidimensional Single Instruction Stream/Multiple Data (SIMD) parallel FFT algorithms for high performance. Critical algorithm design issues are discussed, necessary machine performance measurements are identified and made, and the performance of the developed FFT programs are measured. Fast Fourier Transform programs are compared to the currently best Cray-2 FFT program.

Kamin, Ray A., III↗
DOE OSTI2022

A Novel Approach to Simulate Realistic Concrete Microstructures under Irradiation

The concrete biological shield of light water reactors is exposed to high neutron and gamma irradiation doses in the long term. Irradiation deteriorates the physical and mechanical properties of concrete. Such effects need to be investigated to predict the concrete’s performance in the event of a lifetime extension of a nuclear power plant. This work combines high-resolution characterization techniques with fast-Fourier transform (FFT)-based 2-D simulations to evaluate the radiation-induced volumetric expansion (RIVE) and damage in concrete microstructures under neutron irradiation. Two concrete microstructures from samples provided by the Japan Concrete Aging Management Program (JCAMP) were characterized using micro x-ray fluorescence (mXRF) to obtain elemental intensity maps, and energy-dispersive x-ray spectroscopy to complement mXRF with local elemental information for Na. Minerals and cement paste are then identified based on the elemental composition to produce high-resolution phase maps, resulting in a more accurate representation of the microstructures compared to previous work. Simulations of radiation-induced volumetric expansion (RIVE), creep, and damage in JCAMP concrete use the fast Fourier transform (FFT)-based code Microstructure Oriented Scientific Analysis of Irradiated Concrete (MOSAIC) combined with the irradiated minerals, aggregates, and concrete (IMAC) database, which contains mineral-specific RIVE models. Overall, the simulation results are in fair agreement with experimental data.

Cheniour, Amani↗
NASA NTRS1991

A 640-MHz 32-megachannel real-time polyphase-FFT spectrum analyzer

A polyphase fast Fourier transform (FFT) spectrum analyzer being designed for NASA's Search for Extraterrestrial Intelligence (SETI) Sky Survey at the Jet Propulsion Laboratory is described. By replacing the time domain multiplicative window preprocessing with polyphase filter processing, much of the processing loss of windowed FFTs can be eliminated. Polyphase coefficient memory costs are minimized by effective use of run length compression. Finite word length effects are analyzed, producing a balanced system with 8 bit inputs, 16 bit fixed point polyphase arithmetic, and 24 bit fixed point FFT arithmetic. Fixed point renormalization midway through the computation is seen to be naturally accommodated by the matrix FFT algorithm proposed. Simulation results validate the finite word length arithmetic analysis and the renormalization technique.

Zimmerman, G. A.↗
NASA NTRS1982

Computing the Power-Density Spectrum for an Engineering Model

Computer program for calculating of power-density spectrum (PDS) from data base generated by Advanced Continuous Simulation Language (ACSL) uses algorithm that employs fast Fourier transform (FFT) to calculate PDS of variable. Accomplished by first estimating autocovariance function of variable and then taking FFT of smoothed autocovariance function to obtain PDS. Fast-Fourier-transform technique conserves computer resources.

Dunn, H. J.↗
NASA NTRS1976

Biplex, pipelined FFT

A method of implementing a pipelined fast Fourier transform (FFT) is presented that makes full use of the elements that comprise it. For a given bandwidth and spectral resolution, this approach requires 25 percent less memory, and needs only half the logic speed required for the conventional implementation. Since the spectrum is broken into two parts, two analog-to-digital converters, and attendant mixer-filters, are needed. These two input elements need only operate at half the speed of the one they replaced.

Emerson, R. F.↗
DOE OSTI2020

Model-Free Data Authentication for Cyber Security in Power Systems

With the development and wide deployment of measurement equipment, data can be automatically measured and visualized for situation awareness in power systems. However, the cyber security of power systems is also threated by data spoofing attacks. This letter proposed a measurement data source authentication (MDSA) algorithm based on feature extraction techniques including ensemble empirical mode decomposition (EEMD) and fast Fourier transform (FFT), and machine learning for real-time measurement data classification. Compared with previous work, the proposed algorithm can achieve higher accuracy of MDSA using a shorter window of data from closely located synchrophasor measurement sensors.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1992

Efficient Two-Dimensional-FFT Program

Program computes 64 X 64-point fast Fourier transform in less than 17 microseconds. Optimized 64 X 64 Point Two-Dimensional Fast Fourier Transform combines performance of real- and complex-valued one-dimensional fast Fourier transforms (FFT's) to execute two-dimensional FFT and coefficients of power spectrum. Coefficients used in many applications, including analyzing spectra, convolution, digital filtering, processing images, and compressing data. Source code written in C, 8086 Assembly, and Texas Instruments TMS320C30 Assembly languages.

Miko, J.↗
NASA NTRS1997

A High-Order Direct Solver for Helmholtz Equations with Neumann Boundary Conditions

In this study, a compact finite-difference discretization is first developed for Helmholtz equations on rectangular domains. Special treatments are then introduced for Neumann and Neumann-Dirichlet boundary conditions to achieve accuracy and separability. Finally, a Fast Fourier Transform (FFT) based technique is used to yield a fast direct solver. Analytical and experimental results show this newly proposed solver is comparable to the conventional second-order elliptic solver when accuracy is not a primary concern, and is significantly faster than that of the conventional solver if a highly accurate solution is required. In addition, this newly proposed fourth order Helmholtz solver is parallel in nature. It is readily available for parallel and distributed computers. The compact scheme introduced in this study is likely extendible for sixth-order accurate algorithms and for more general elliptic equations.

Sun, Xian-He↗
NASA NTRS1988

A high-performance FFT algorithm for vector supercomputers

Many traditional algorithms for computing the fast Fourier transform (FFT) on conventional computers are unacceptable for advanced vector and parallel computers because they involve nonunit, power-of-two memory strides. A practical technique for computing the FFT that avoids all such strides and appears to be near-optimal for a variety of current vector and parallel computers is presented. Performance results of a program based on this technique are given. Notable among these results is that a FORTRAN implementation of this algorithm on the CRAY-2 runs up to 77-percent faster than Cray's assembly-coded library routine.

Bailey, David H.↗
NASA NTRS1991

Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm

The disadvantages of numerical inversion of the Laplace transform via the conventional fast Fourier transform (FFT) are identified and an improved method is presented to remedy them. The improved method is based on introducing a new integration step length Delta(omega) = pi/mT for trapezoidal-rule approximation of the Bromwich integral, in which a new parameter, m, is introduced for controlling the accuracy of the numerical integration. Naturally, this method leads to multiple sets of complex FFT computations. A new inversion formula is derived such that N equally spaced samples of the inverse Laplace transform function can be obtained by (m/2) + 1 sets of N-point complex FFT computations or by m sets of real fast Hartley transform (FHT) computations.

Hwang, Chyi↗
DOE OSTI2024

Waveform resampling with LMN method

In this article, resampling is a common technique applied in digital signal processing. Based on the Fast Fourier Transformation (FFT), we apply an optimization called here the LMN method to achieve fast and robust re-sampling. In addition to performance comparisons with some other popular methods, we illustrate the effectiveness of this LMN method in a particle physics experiment: re-sampling of waveforms from Liquid Argon Time Projection Chambers.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1988

On the application of pseudo-spectral FFT technique to non-periodic problems

The reduction-to-periodicity method using the pseudo-spectral Fast Fourier Transform (FFT) technique is applied to the solution of nonperiodic problems including the two-dimensional Navier-Stokes equations. The accuracy of the method is demonstrated by calculating derivatives of given functions, one- and two-dimensional convective-diffusive problems, and by comparing the relative errors due to the FFT method with seocnd order Finite Difference Methods (FDM). Finally, the two-dimensional Navier-Stokes equations are solved by a fractional step procedure using both the FFT and the FDM methods for the driven cavity flow and the backward facing step problems. Comparisons of these solutions provide a realistic assessment of the FFT method indicating its range of applicability.

Biringen, S.↗
NASA NTRS1995

A FFT Method for the Quasiclassical Selection of Initial Ro-Vibrational States of Triatomic Molecules

This paper describes the use of an exact fast Fourier transform (FFT) method to prepare specified vibrational-rotational states of triatomic molecules. The method determines the Fourier coefficients needed to describe the coordinates and momenta of a vibrating-rotating triatomic molecule. Once the Fourier coefficients of a particular state are determined, it is possible to easily generate as many random sets of initial cartesian coordinates and momenta as desired. All the members of each set will correspond to the particular vibrational-rotational state selected. For example, in the case of the ground vibrational state of a non-rotating water molecule, the calculated actions of 100 sets of initial conditions produced actions within 0.001 h(bar) of the specified quantization values and energies within 5 cm(sup -1) of the semiclassical eigenvalue. The numerical procedure is straightforward for states in which all the fundamental frequencies are independent. However for states for which the fundamental frequencies become commensurate (resonance states), there are additional complications. In these cases it is necessary to determine a new set of "fundamental" frequencies and to modify the quantization conditions. Once these adjustments are made, good results are obtained for resonance states. The major problems are in labelling the large number of Fourier coefficients and the presence of regions of chaotic motion. Results are presented for the vibrational states of H2O and HCN and the ro-vibrational states of H2O.

Eaker, Charles W.↗