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

Stress wave calculations in composite plates using the fast Fourier transform.

The protection of composite turbine fan blades against impact forces has prompted the study of dynamic stresses in composites due to transient loads. The mathematical model treats the laminated plate as an equivalent anisotropic material. The use of Mindlin's approximate theory of crystal plates results in five two-dimensional stress waves. Three of the waves are flexural and two involve in-plane extensional strains. The initial value problem due to a transient distributed transverse force on the plate is solved using Laplace and Fourier transforms. A fast computer program for inverting the two-dimensional Fourier transform is used. Stress contours for various stresses and times after application of load are obtained for a graphite fiber-epoxy matrix composite plate. Results indicate that the points of maximum stress travel along the fiber directions.

Moon, F. C.↗

Optimizing the Fast Fourier Transform Using Mixed Precision on Tensor Core Hardware

The Fast Fourier Transform is a fundamental tool in scientific and technical computation. The highly parallelizable nature of the algorithm makes it a suitable candidate for GPU acceleration. This paper focuses on exploiting the speedup due to using the half precision multiplication capability of the latest GPUs' tensor core hardware without significantly degrading the precision of the Fourier Transform result. We develop an algorithm that dynamically splits the input single precision dataset into two half precision sets at the lowest level, uses half precision multiplication, and recombines the result at a later step. This work paves the way for using tensor cores for high precision inputs.

Sorna, Anumeena↗

A fluctuation-induced plasma transport diagnostic based upon fast-Fourier transform spectral analysis

A diagnostic, based on fast Fourier-transform spectral analysis techniques, that provides experimental insight into the relationship between the experimentally observable spectral characteristics of the fluctuations and the fluctuation-induced plasma transport is described. The model upon which the diagnostic technique is based and its experimental implementation is discussed. Some characteristic results obtained during the course of an experimental study of fluctuation-induced transport in the electric field dominated NASA Lewis bumpy torus plasma are presented.

Powers, E. J.↗

Ordered fast fourier transforms on a massively parallel hypercube multiprocessor

Design alternatives for ordered Fast Fourier Transformation (FFT) algorithms were examined on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication which is known to dominate the overall computing time. To this end, the order and computational phases of the FFT were combined, and the sequence to processor maps that reduce communication were used. The class of ordered transforms is expanded to include any FFT in which the order of the transform is the same as that of the input sequence. Two such orderings are examined, namely, standard-order and A-order which can be implemented with equal ease on the Connection Machine where orderings are determined by geometries and priorities. If the sequence has N = 2 exp r elements and the hypercube has P = 2 exp d processors, then a standard-order FFT can be implemented with d + r/2 + 1 parallel transmissions. An A-order sequence can be transformed with 2d - r/2 parallel transmissions which is r - d + 1 fewer than the standard order. A parallel method for computing the trigonometric coefficients is presented that does not use trigonometric functions or interprocessor communication. A performance of 0.9 GFLOPS was obtained for an A-order transform on the Connection Machine.

Tong, Charles↗

Parallel 3D Fast Fourier Transform Functions

BigFFT is a scalable implementation of a three dimensional Fast Fourier Transform operation. Functions are included for forward and backward real-to-complex 3D transforms.

Draeger, E. W.↗

Development and testing of a fast Fourier transform high dynamic-range spectral diagnostics for millimeter wave characterization

A fast Fourier transform (FFT) based wide range millimeter wave diagnostics for spectral characterization of scattered millimeter waves in plasmas has been successfully brought into operation. The scattered millimeter waves are heterodyne downconverted and directly digitized using a fast analog-digital converter and a compact peripheral component interconnect computer. Frequency spectra are obtained by FFT in the time domain of the intermediate frequency signal. The scattered millimeter waves are generated during high power electron cyclotron resonance heating experiments on the TEXTOR tokamak and demonstrate the performance of the diagnostics and, in particular, the usability of direct digitizing and Fourier transformation of millimeter wave signals. The diagnostics is able to acquire 4 GHz wide spectra of signals in the range of 136-140 GHz. The rate of spectra is tunable and has been tested between 200 000 spectra/s with a frequency resolution of 100 MHz and 120 spectra/s with a frequency resolution of 25 kHz. The respective dynamic ranges are 52 and 88 dB. Major benefits of the new diagnostics are a tunable time and frequency resolution due to postdetection, near-real time processing of the acquired data. This diagnostics has a wider application in astrophysics, earth observation, plasma physics, and molecular spectroscopy for the detection and analysis of millimeter wave radiation, providing high-resolution spectra at high temporal resolution and large dynamic range.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Computing the Fast Fourier Transform on a vector computer

Two algorithms are presented for performing a Fast Fourier Transform on a vector computer and are compared on the Control Data Corporation STAR-100. The relative merits of the two algorithms are shown to depend upon whether only a few or many independent transforms are desired. A theorem is proved which shows that a set of independent transforms can be computed by performing a partial transformation on a single vector. The results of this theorem also apply to nonvector machines and have reduced the average time per transform by a factor of two on the CDC 6600 computer.

Korn, D. G.↗

A generalizable machine learning-assisted fast Fourier transform algorithm to simulate the large strain phenomena in polycrystalline materials

Machine learning methods have shown initial promise in constitutive modeling for single crystals or homogenized polycrystals, delivering notable computational efficiency. However, existing machine learning-based constitutive models often lack generalizability, limiting their application across diverse boundary value problems. This study introduces a thermodynamics-informed artificial neural network model to accelerate rate-tangent crystal plasticity fast Fourier transform simulations for cross-scale deformation behaviors of polycrystals under complex loading. Our model integrates microstructural variability and local interactions effectively. To address local effects in each grain, we employ K-means clustering to group Gauss points within the microstructure into clusters assumed to be in similar mechanical states. This approach, based on self-clustering analysis, extends model scope from macroscopic stress response to the granular level, capturing mechanical responses and orientation evolution across grains. This reduces the number of nonlinear problems to solve, with cluster responses propagated throughout each group. The thermodynamics-based artificial neural network-extracted features are further processed using local material state clusters to account for history-dependent deformation and evolving microstructures. Additionally, representative volume element simulations with rate-tangent crystal plasticity fast Fourier transform provide reliable datasets for model training. The proposed model demonstrates high efficiency, accuracy, self-consistency, and enhanced generalizability in predicting strain–stress responses and orientation evolution at both individual grain and aggregate scales under complex loading conditions, such as biaxial tension and arbitrary loading scenarios.

36 MATERIALS SCIENCE↗

Fast Fourier transform telescope

We propose an all-digital telescope for 21 cm tomography, which combines key advantages of both single dishes and interferometers. The electric field is digitized by antennas on a rectangular grid, after which a series of fast Fourier transforms recovers simultaneous multifrequency images of up to half the sky. Thanks to Moore's law, the bandwidth up to which this is feasible has now reached about 1 GHz, and will likely continue doubling every couple of years. The main advantages over a single dish telescope are cost and orders of magnitude larger field-of-view, translating into dramatically better sensitivity for large-area surveys. The key advantages over traditional interferometers are cost (the correlator computational cost for an N-element array scales as Nlog{sub 2}N rather than N{sup 2}) and a compact synthesized beam. We argue that 21 cm tomography could be an ideal first application of a very large fast Fourier transform telescope, which would provide both massive sensitivity improvements per dollar and mitigate the off-beam point source foreground problem with its clean beam. Another potentially interesting application is cosmic microwave background polarization.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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

Elasto-viscoplastic fast Fourier transform modeling framework for assessing microstructural effects on stress intensity factors characterizing fracture toughness

A large-strain elasto-viscoplastic fast Fourier transform (LS-EVPFFT) model with non-periodic (NP) velocity-based boundary conditions is adapted to simulate the sensitivity of stress intensity factors on microstructure for 304L stainless steel. The material was characterized via electron backscattered diffraction (EBSD) serial-sectioning to obtain a measured 3-D microstructural cell to perform simulations. The NP-LS-EVPFFT model, including the simulation setup and boundary conditions, was verified using a crystal plasticity finite element (CPFE) model. To this end, the generation of meshes of notched specimens was developed, which involved creating Python scripts for mesh “cutting” in Abaqus, and Sculpt scripts in Cubit for meshing of the measured microstructural cell processed with DREAM.3D. The complexity of the mesh preparation highlighted the advantages of the FFT-based model, which circumvents the mesh generation process. Given the efficiency of the FFT-based model, statistical distribution of stress intensity factors in function of crystal orientation at the crack tip, grain structure, and crystallographic texture surrounding the crack tip were predicted. Further, the distributions reveal about 10% variation of stress intensity factors with microstructure with the most significant sensitivity found to be the crystal orientation at the crack tip. The methodology developed in this work is discussed as a practical simulation tool for predicting the sensitivity of stress intensity factors on microstructural variability in metallic materials.

36 MATERIALS SCIENCE↗

Recursive Use of the Short-Time Fast Fourier Transform for Signature Analysis in Continuous Processes

Although a nuclear reactor is a hostile environment for sensing and electrical communications, the reactor core is amenable to acoustic communication. An acoustic measurement infrastructure (AMI) has been installed in the Advanced Test Reactor (ATR) to record acoustic signals that can capture its different operating regimes. AMI uses coolant pumps as continuous signal sources, coolant and structural components as transmission lines, and accelerometers to capture system motion. A recursive signal processing technique based on the short-time fast Fourier transform (STFFT) for continuous processes provides unique signatures for diagnostic and prognostic analyses from the system motion data. Here this article presents a recursive STFFT methodology that processes acoustic signals from continuous industrial processes. The article first discusses the initial STFFT use with simulated data to elucidate the basic principles necessary to understand and interpret the STFFT results from actual pump vibration data. Each repetitive use of the STFFT on pump vibration data using the results from the prior STFFT processing will generate additional complimentary time-frequency-based signatures. These signatures are generated by the coolant pumps operating under different process conditions. After each use of the STFFT, the resulting signatures provide exemplary examples of the diversity and intuitive nature of recursively using the STFFT. This article focuses on recursively using the STFFT to provide numerous complimentary and diverse signatures that will ultimately be inputs for machine learning algorithms that provide predictive data analytics. The intuitive nature of the information and signatures from recursive STFFT processing will also bring intuitive interpretation capabilities to machine learning and predictive data analytic techniques.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Coolant Pump Predictive Data Analytics from Signatures Generated by the Recursive Short Time Fast Fourier Transform

Although a nuclear reactor is a hostile environment for sensors and signal transmissions, the reactor core is amenable to acoustic communication. An acoustic measurement infrastructure installed at the Advanced Test Reactor (ATR) nozzle trench area records acoustic signals that can capture reactor operating states. The distinct states produce unique signatures that can be identified and tracked using data processing and data analytics. The infrastructure relies on acoustic transmission through ATR in-pile structural components, piping, and coolant that transmit acoustically modified signals generated by the coolant pumps. This paper will discuss results from using the Recursive Short Time Fast Fourier Transform (RSTFFT) technique used to process acoustic signals and provide signatures that are identified and monitored by analytics. The RSTFFT is applied to ATR data to understand the vibration levels and signatures for different operating regimes as displayed by the spectrogram. The combination of coolant pumps for normal and high-power operation generate unique signatures. These acoustic signatures are used to develop machine learning approaches to automatically classify operating regimes. Two machine-learning models, Support Vector Machines and Linear Discriminant Analysis, were developed to classify two event classes. Class 1 is a normal steady-state operation, and Class 2 is any event that is due to start up, shut down, or other actions. Both types of machine learning models had over a 96% prediction accuracy for the two classes. These results lay the foundation for predictive analytic frameworks that can be leveraged by ATR to optimize operations and maintenance.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗