Search NASA⌕ Search

SEARCH · Search NASA

Results for “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
DOE OSTI2025

kokkos-fft: A shared-memory FFT for the Kokkos ecosystem

kokkos-fft provides a unified, performance-portable interface for Fast Fourier Transforms (FFTs) within the Kokkos ecosystem (C. Trott et al., 2021). It seamlessly integrates with leading local FFT libraries including FFTW, cuFFT, rocFFT, and oneMKL. Designed for simplicity and efficiency, kokkos-fft offers a user experience akin to numpy.fft for in-place and out-of-place transforms, while leveraging the raw speed of vendor-optimized libraries. A demonstration solving 2D Hasegawa-Wakatani turbulence with the Fourier spectral method illustrates how kokkos-fft can deliver significant speedups over Python-based alternatives without drastically increasing code complexity, empowering researchers to perform high-performance FFTs simply and effectively.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2011

High-Throughput, Adaptive FFT Architecture for FPGA-Based Spaceborne Data Processors

Exponential growth in microelectronics technology such as field-programmable gate arrays (FPGAs) has enabled high-performance spaceborne instruments with increasing onboard data processing capabilities. As a commonly used digital signal processing (DSP) building block, fast Fourier transform (FFT) has been of great interest in onboard data processing applications, which needs to strike a reasonable balance between high-performance (throughput, block size, etc.) and low resource usage (power, silicon footprint, etc.). It is also desirable to be designed so that a single design can be reused and adapted into instruments with different requirements. The Multi-Pass Wide Kernel FFT (MPWK-FFT) architecture was developed, in which the high-throughput benefits of the parallel FFT structure and the low resource usage of Singleton s single butterfly method is exploited. The result is a wide-kernel, multipass, adaptive FFT architecture. The 32K-point MPWK-FFT architecture includes 32 radix-2 butterflies, 64 FIFOs to store the real inputs, 64 FIFOs to store the imaginary inputs, complex twiddle factor storage, and FIFO logic to route the outputs to the correct FIFO. The inputs are stored in sequential fashion into the FIFOs, and the outputs of each butterfly are sequentially written first into the even FIFO, then the odd FIFO. Because of the order of the outputs written into the FIFOs, the depth of the even FIFOs, which are 768 each, are 1.5 times larger than the odd FIFOs, which are 512 each. The total memory needed for data storage, assuming that each sample is 36 bits, is 2.95 Mbits. The twiddle factors are stored in internal ROM inside the FPGA for fast access time. The total memory size to store the twiddle factors is 589.9Kbits. This FFT structure combines the benefits of high throughput from the parallel FFT kernels and low resource usage from the multi-pass FFT kernels with desired adaptability. Space instrument missions that need onboard FFT capabilities such as the proposed DESDynl, SWOT (Surface Water Ocean Topography), and Europa sounding radar missions would greatly benefit from this technology with significant reductions in non-recurring cost and risk.

NguyenKobayashi, Kayla↗
NASA NTRS2010

A High-Throughput, Adaptive FFT Architecture for FPGA-Based Space-Borne Data Processors

Historically, computationally-intensive data processing for space-borne instruments has heavily relied on ground-based computing resources. But with recent advances in functional densities of Field-Programmable Gate-Arrays (FPGAs), there has been an increasing desire to shift more processing on-board; therefore relaxing the downlink data bandwidth requirements. Fast Fourier Transforms (FFTs) are commonly used building blocks for data processing applications, with a growing need to increase the FFT block size. Many existing FFT architectures have mainly emphasized on low power consumption or resource usage; but as the block size of the FFT grows, the throughput is often compromised first. In addition to power and resource constraints, space-borne digital systems are also limited to a small set of space-qualified memory elements, which typically lag behind the commercially available counterparts in capacity and bandwidth. The bandwidth limitation of the external memory creates a bottleneck for a large, high-throughput FFT design with large block size. In this paper, we present the Multi-Pass Wide Kernel FFT (MPWK-FFT) architecture for a moderately large block size (32K) with considerations to power consumption and resource usage, as well as throughput. We will also show that the architecture can be easily adapted for different FFT block sizes with different throughput and power requirements. The result is completely contained within an FPGA without relying on external memories. Implementation results are summarized.

Nguyen, Kayla↗
NASA NTRS1988

FFT applications to plane-polar near-field antenna measurements

The four-point bivariate Lagrange interpolation algorithm was applied to near-field antenna data measured in a plane-polar facility. The results were sufficiently accurate to permit the use of the FFT (fast Fourier transform) algorithm to calculate the far-field patterns of the antenna. Good agreement was obtained between the far-field patterns as calculated by the Jacobi-Bessel and the FFT algorithms. The significant advantage in using the FFT is in the calculation of the principal plane cuts, which may be made very quickly. Also, the application of the FFT algorithm directly to the near-field data was used to perform surface holographic diagnosis of a reflector antenna. The effects due to the focusing of the emergent beam from the reflector, as well as the effects of the information in the wide-angle regions, are shown. The use of the plane-polar near-field antenna test range has therfore been expanded to include these useful FFT applications.

Gatti, Mark S.↗
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↗
DOE OSTI2025

Achieving geometric accuracy in FFT-based micromechanical models using conformal grid

Owing to its efficiency, simplicity and robustness, the FFT-based method has become the standard for computation of mechanical fields in a heterogeneous periodic unit cell. One of the main disadvantages of the FFT-based method is the inaccurate representation of the initial microstructure on a regular grid of voxels, which can be alleviated through the use of distorted initial grids. Here, in this paper, a method for generation of distorted initial grids conforming to the microstructural features (e.g. straight/curved boundaries) is proposed. The method determines the positions of the grid nodes in the initial configuration by solving a system of springs connecting the nodes. Microstructures consisting of layers, Voronoi tessellation and circular/spherical inclusions are considered, and mechanical fields simulated using the FFT-based method. It is found that distorted initial grids, conforming to the microstructural features, lead to more accurate mechanical fields in comparison to the corresponding non-distorted initial grid solution. The effect of initial grid distortion on the convergence of the FFT-based method is analyzed and discussed.

36 MATERIALS SCIENCE↗
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.↗
DOE OSTI2024

A FFT-based mesoscale continuum dislocation mechanics with defect energy: Applications to composites and polycrystals

A crystal plasticity elastoviscoplastic FFT (fast Fourier transform) formulation with a mesoscale continuum field dislocation mechanics model is presented, which incorporates a defect energy density that depends on GND densities and an associated material length scale. This allows to thermodynamically derive internal length scale dependent intra-crystalline backstress and Peach–Koehler force acting on GND densities. The model considers GND density evolution through a filtered numerical spectral approach, which is coupled with stress equilibrium through the elastoviscoplastic FFT algorithm. The discrete Fourier transform (DFT) method together with finite difference (FD) schemes is applied to solve both the backstress tensor and the Fourier–Green operator. Numerical results are first reported for two-phase laminate composites with plastic single crystal channels and elastic precipitates for shear loadings. Channel size effects are simulated and analyzed on the overall and local hardening behaviors during monotonous loadings. In addition, the evolutions of GND densities and the role of their associated backstress on size effects are examined during reversible shear loading. In a second part, the role of the defect energy internal length scale on polycrystal’s hardening during tension–compression is discussed. The results are compared to those obtained using FFT-based continuum field dislocation mechanics without defect energy.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Implementation and experimental validation of nonlocal damage in a large-strain elasto-viscoplastic FFT-based framework for predicting ductile fracture in 3D polycrystalline materials

Ductile materials, such as metal alloys, can undergo substantial deformation before failure. Additionally, these materials are usually of polycrystalline composition and exhibit strongly anisotropic behavior at small length scales. Previously developed fast Fourier transform (FFT)-based models can model ductile fracture of isotropic materials or the elastic–plastic behavior of anisotropic polycrystalline materials; however, there remains a need to couple both capabilities. This work extends a large-strain FFT-based crystal plasticity model to simulate ductile fracture of polycrystalline materials. In this work, a triaxiality-based continuum damage mechanics (CDM) formulation is incorporated into a large-strain elasto-viscoplastic FFT (LS-EVPFFT) framework. The CDM formulation is augmented with an integral-based nonlocal regularization approach that correctly handles gas-phase material necessary to model unconstrained surfaces. To validate the damage-enabled LS-EVPFFT framework, mesoscale copper tensile coupons were machined using microwire electrical discharge machining and experimentally characterized using electron backscatter diffraction. In-situ optical digital image correlation was performed during uniaxial testing to provide a side-by-side comparison of the experimental and computational strain fields and stress–strain responses. The damage-enabled LS-EVPFFT framework can simulate the complete macroscopic stress–strain response of ductile polycrystals to failure. The model reproduces necking behavior that qualitatively agrees with experimental observations. By leveraging the relatively low computational cost of the damage-enabled LS-EVPFFT framework, the framework presented here allows the ductile fracture response of 3D polycrystalline materials to be tractably predicted.

36 MATERIALS SCIENCE↗
NASA NTRS1979

A comparison of WFTA and FFT programs

Bounds on the minimum number of data transfers (i.e., loads and stores) required by WFTA (Winograd Fourier Transform Algorithm) and FFT programs are presented. The analysis is applicable to those general-purpose computers with a small number of general processor registers (e.g., the IBM370, PDP-11, etc.). It is shown that the 1008-point WFTA requires about 21% more data transfers than the 1024-point radix-4 FFT; on the other hand, the 120-point WFTA has about 22% fewer data transfers than the 128-point radix-2 FFT. Finally, comparisons of the 'total' program execution times (multiplications, additions, and data transfers, but not indexing or permutations) are presented.

Nawab, H.↗
NASA NTRS1979

Bounds on the minimum number of data transfers in WFTA and FFT programs

Bounds on the minimum number of data transfers (i.e., loads, stores, copies) required by WFTA and FFT programs are presented. The analysis is applicable to those general-purpose computers with M general processor registers, where M is equal to or greater than 4 but much less than the transform length. It is shown that the 1008-point WFTA requires about 21 percent more data transfers than the 1024-point radix-4 FFT; on the other hand, the 120-point WFTA has about the same number of data transfers as the mixed radix (4 x 4 x 4 x 2) version of the 128-point FFT and 22 percent fewer than the radix-2 version. Finally, comparisons of the 'total' program execution times (multiplications, additions, and data transfers, but not indexing or permutations) are presented.

Nawab, H.↗
NASA NTRS1983

Numerical evaluation of the radiation from unbaffled, finite plates using the FFT

An iteration technique is described which numerically evaluates the acoustic pressure and velocity on and near unbaffled, finite, thin plates vibrating in air. The technique is based on Rayleigh's integral formula and its inverse. These formulas are written in their angular spectrum form so that the fast Fourier transform (FFT) algorithm may be used to evaluate them. As an example of the technique the pressure on the surface of a vibrating, unbaffled disk is computed and shown to be in excellent agreement with the exact solution using oblate spheroidal functions. Furthermore, the computed velocity field outside the disk shows the well-known singularity at the rim of the disk. The radiated fields from unbaffled flat sources of any geometry with prescribed surface velocity may be evaluated using this technique. The use of the FFT to perform the integrations in Rayleigh's formulas provides a great savings in computation time compared with standard integration algorithms, especially when an array processor can be used to implement the FFT.

Williams, E. G.↗
NASA NTRS1984

Pipelined digital SAR azimuth correlator using hybrid FFT-transversal filter

A synthetic aperture radar system (SAR) having a range correlator is provided with a hybrid azimuth correlator which utilizes a block-pipe-lined fast Fourier transform (FFT). The correlator has a predetermined FFT transform size with delay elements for delaying SAR range correlated data so as to embed in the Fourier transform operation a corner-turning function as the range correlated SAR data is converted from the time domain to a frequency domain. The azimuth correlator is comprised of a transversal filter to receive the SAR data in the frequency domain, a generator for range migration compensation and azimuth reference functions, and an azimuth reference multiplier for correlation of the SAR data. Following the transversal filter is a block-pipelined inverse FFT used to restore azimuth correlated data in the frequency domain to the time domain for imaging.

Wu, C.↗
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 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 OSTI2025

Extended FFT-based micromechanical formulation to consider general non-periodic boundary conditions

Here, this paper presents a new approach for applying non-periodic boundary conditions in the context of FFT-based methods to solve micromechanical problems in heterogeneous solids. The domain of the original problem is extended to satisfy the periodicity requirements at the boundary of the extended domain. The velocity constraint on the boundary of the original domain is replaced by a corresponding constraint on the velocity gradient in the extended volume, and a two-level augmented Lagrangian method is used to enforce the constraint. The proposed method is implemented as an extension of the large-strain elasto-viscoplastic FFT-based (LS-EVPFFT) model of Zecevic et al. (2022). The proposed method is verified in the cases of fully imposed velocity boundary conditions and mixed velocity/traction-free boundary conditions. The accuracy and convergence of the method are studied next, followed by applications to bending and indentation of polycrystals that illustrate the extended capabilities of the proposed formulation.

36 MATERIALS SCIENCE↗
DOE OSTI2025

An FFT-based micromechanical model for gradient enhanced brittle fracture

Damage models incorporated within FFT-based micromechanical methods have received much attention recently because of the need to better understand and predict brittle and ductile fracture. An important aspect of a damage model is non-local regularization, which removes the mesh dependence of the predictions that otherwise become physically unacceptable upon grid refinement. In this work, the Helmholtz-type equation for non-local gradient regularization of a damage model on a distorted grid is solved using an FFT-based approach. Further, the resulting system of equations is solved using the Jacobi iterative method. The model is applied to simulate brittle fracture of an intermetallic. The influence of the time and space discretization, the length-scale parameter, and intermetallic crystallographic orientation on crack evolution is studied.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Weighted FFT estimators for 1D and 3D correlations of the Lyman- α forest

Correlations in the Lyman-α (Lyα) forest, both as a function of line of sight separation (1D) and 3D separation, provide a unique window to the distribution of matter at redshifts not accessible by current galaxy surveys. While optimal quadratic estimators have been used to measure 1D correlations, they are computationally expensive and difficult to extend to 3D analyses. On the other hand, estimators based on the Fast Fourier Transform (FFT) are significantly faster, but are affected by missing data in the spectra (masked pixels) and so far have not used pixel weights to reduce the uncertainties in the measurement. In this publication we describe how to compute the window matrix that enables forward-modelling the impact of masked pixels and weights on the FFT-based estimators. Here, we use Gaussian and hydrodynamical simulations with artificially masked pixels to validate the method on the measurement of 1D correlations. Finally, we show that the formalism can be extended to model the impact on 3D correlations, in particular on the cross-spectrum, the correlation of 1D Fourier modes as a function of transverse separation. This work will enable more precise clustering measurements with the Lyα forest dataset recently collected by the Dark Energy Spectroscopic Instrument (DESI).

Lokken, Martine [Univ. Autonoma de Barcelona (Spai↗