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 19 records

Big Data in Reciprocal Space: Sliding Fast Fourier Transforms for Determining Periodicity

Significant advances in atomically resolved imaging of crystals and surfaces have occurred in the last decade allowing unprecedented insight into local crystal structures and periodicity. Yet, the analysis of the long-range periodicity from the local imaging data, critical to correlation of functional properties and chemistry to the local crystallography, remains a challenge. Here, we introduce a Sliding Fast Fourier Transform (FFT) filter to analyze atomically resolved images of in-situ grown La5/8Ca3/8MnO3 films. We demonstrate the ability of sliding FFT algorithm to differentiate two sub-lattices, resulting from a mixed-terminated surface. Principal Component Analysis (PCA) and Independent Component Analysis (ICA) of the Sliding FFT dataset reveal the distinct changes in crystallography, step edges and boundaries between the multiple sub-lattices. The method is universal for images with any periodicity, and is especially amenable to atomically resolved probe and electron-microscopy data for rapid identification of the sub-lattices present.

74 ATOMIC AND MOLECULAR PHYSICS↗

Improved motional Stark effect signal processing using fast Fourier transform spectral analysis

A Fast Fourier Transform (FFT) based method has been developed, which improves the frequency response of the Motional Stark Effect (MSE) system by about a factor of 10 over the conventional analog lock-in method. The method uses fits to rigorously derived analytic expressions for the FFT spectral components of the MSE signal to accurately obtain the amplitudes and phases of the 2f1 and 2f2 photo-elastic modulator (PEM) frequencies that encode the polarization angle. Since no frequency filtering is used in the FFT method, the frequency response is limited by fundamental measurement properties: the frequency response of the detector, photon statistics, sample rate, and the ability to resolve the spectral components. In contrast, the frequency response of the analog lock-in is limited by a low pass filter with a cutoff of around 500 Hz. In the case of the DIII-D MSE system, the output of the photo-multiplier tube detector was sampled at 500 kHz and FFTs with as few as 100 points were used to obtain the amplitudes of the 2f1 and 2f2 PEM frequency components. This corresponds to a frequency response of 5 kHz, about ten times faster than the analog lock-in amplifier system. Details of the FFT method will be presented and compared to those of the analog lock-in system.

Makowski, M. A.↗

Fast Fourier Transform Spectral Analysis Program

Fast Fourier Transform Spectral Analysis Program is used in frequency spectrum analysis of postflight, space vehicle telemetered trajectory data. This computer program with a digital algorithm can calculate power spectrum rms amplitudes and cross spectrum of sampled parameters at even time increments.

Daniel, J. A., Jr.↗

Optimal Padding for the Two-Dimensional Fast Fourier Transform

One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that can benefit from this algorithm, including optics, image-processing, signal-processing, and engineering applications.

Dean, Bruce H.↗

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↗

Using single buffers and data reorganization to implement a multi-megasample fast Fourier transform

Data ordering in large fast Fourier transforms (FFT's) is both conceptually and implementationally difficult. Discribed here is a method of visualizing data orderings as vectors of address bits, which enables the engineer to use more efficient data orderings and reduce double-buffer memory designs. Also detailed are the difficulties and algorithmic solutions involved in FFT lengths up to 4 megasamples (Msamples) and sample rates up to 80 MHz.

Brown, R. D.↗

Fast Fourier Transform for multivariate aggregate claims

The Fast Fourier Transform provides an alternative approximate method to evaluate the distribution of aggregate losses in insurance and finance. The efficiency of this method has already been proved for univariate and bivariate insurance models; therefore, in this paper, we extend it to a multivariate setting by considering its application to a particular model that includes losses of different types and dependency between them. Since the Fourier transform method works with truncated claims distributions, it can generate aliasing errors by wrapping around the probability mass that lies at the truncation point below this point. To eliminate this problem, we also discuss a suitable change of measure called exponential tilting that forces the tail of the distribution to decrease at exponential rate. Other possible errors are also discussed. We also illustrate the method on several numerical examples.

97 MATHEMATICS AND COMPUTING↗

Hardware schemes for fast Fourier transform, part 7.4A

Real-time fast fourier transformer (FFT) processing of a MST radar data and cost-effective approaches to hardware FFT generation were studied. Previously devised hardware FFT configurations are described including the estimated number of chips used and the time required to perform a 1024-point FFT. The remaining entries in the table correspond to original designs, which presuppose the availability of a microcomputer and a modestly complicated hardware peripheral. These original designs, all of which implement a radix-4 FFT with twiddle factors, are assigned model numbers to make them easier to refer to.

Stitt, G. R.↗

Modeling the viscoplastic micromechanical response of two-phase materials using fast Fourier transforms

A viscoplastic approach using the Fast Fourier Transform (FFT) method for obtaining local mechanical response is utilized to study microstructure-property relationships in composite materials. Specifically, three-dimensional, two-phase digital materials containing isotropically coarsened particles surrounded by a matrix phase, generated through a Kinetic Monte Carlo Potts model for Ostwald ripening, are used as instantiations in order to calculate the stress and strain rate fields under uniaxial tension. The effects of the morphology of the matrix phase, the volume fraction and the contiguity of particles, and the polycrystallinity of matrix phase, on the stress and strain rate fields under uniaxial tension are examined. It is found that the first moments of the stress and strain rate fields have a different dependence on the particle volume fraction and the particle contiguity from their second moments. The average stresses and average strain rates of both phases and of the overall composite have rather simple relationships with the particle volume fraction whereas their standard deviations vary strongly, especially when the particle volume fraction is high, and the contiguity of particles has a noticeable effect on the mechanical response. It is also found that the shape of stress distribution in the BCC hard particle phase evolves as the volume fraction of particles in the composite varies, such that it agrees with the stress field in the BCC polycrystal as the volume of particles approaches unity. Finally, it is observed that the stress and strain rate fields in the microstructures with a polycrystalline matrix are less sensitive to changes in volume fraction and contiguity of particles.

36 MATERIALS SCIENCE↗

Simulation of micromechanical behavior of polycrystals: finite elements vs. fast Fourier transforms

In this work, we compare finite element and fast Fourier transform approaches for the prediction of micromechanical behavior of polycrystals. Both approaches are full-field approaches and use the same visco-plastic single crystal constitutive law. We investigate the texture and the heterogeneity of the inter- and intragranular, stress and strain fields obtained from the two models. Additionally, we also look into their computational performance. Two cases - rolling of aluminium and wire drawing of tungsten - are used to evaluate the predictions of the two mode1s. Results from both the models are similar, when large grain distortions do not occur in the polycrystal. The finite element simulations were found to be highly computationally intensive, in comparison to the fast Fourier transform simulations.

36 MATERIALS SCIENCE↗

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.↗