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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
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 NTRS1976

A fast Karhunen-Loeve transform for a class of random processes

It is shown that for a class of finite first-order Markov signals, the Karhunen-Loeve (KL) transform for data compression is a set of periodic sine functions if the boundary values of the signal are fixed or known. These sine functions are shown to be related to the Fourier transform so that a fast Fourier transform algorithm can be used to implement the KL transform. Extension to two dimensions with reference to images with separable contravariance function is shown.

Jain, A. K.↗
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 NTRS2008

Algorithm for Wavefront Sensing Using an Extended Scene

A recently conceived algorithm for processing image data acquired by a Shack-Hartmann (SH) wavefront sensor is not subject to the restriction, previously applicable in SH wavefront sensing, that the image be formed from a distant star or other equivalent of a point light source. That is to say, the image could be of an extended scene. (One still has the option of using a point source.) The algorithm can be implemented in commercially available software on ordinary computers. The steps of the algorithm are the following: 1. Suppose that the image comprises M sub-images. Determine the x,y Cartesian coordinates of the centers of these sub-images and store them in a 2xM matrix. 2. Within each sub-image, choose an NxN-pixel cell centered at the coordinates determined in step 1. For the ith sub-image, let this cell be denoted as si(x,y). Let the cell of another subimage (preferably near the center of the whole extended-scene image) be designated a reference cell, denoted r(x,y). 3. Calculate the fast Fourier transforms of the sub-sub-images in the central NxN portions (where N < N and both are preferably powers of 2) of r(x,y) and si(x,y). 4. Multiply the two transforms to obtain a cross-correlation function Ci(u,v), in the Fourier domain. Then let the phase of Ci(u, v) constitute a phase function, phi(u,v). 5. Fit u and v slopes to phi (u,v) over a small u,v subdomain. 6. Compute the fast Fourier transform, Si(u,v) of the full NxN cell si(x,y). Multiply this transform by the u and phase slopes obtained in step 4. Then compute the inverse fast Fourier transform of the product. 7. Repeat steps 4 through 6 in an iteration loop, cumulating the u and slopes, until a maximum iteration number is reached or the change in image shift becomes smaller than a predetermined tolerance. 8. Repeat steps 4 through 7 for the cells of all other sub-images.

Sidick, Erkin↗
NASA NTRS1982

The application of digital signal processing techniques to a teleoperator radar system

A digital signal processing system was studied for the determination of the spectral frequency distribution of echo signals from a teleoperator radar system. The system consisted of a sample and hold circuit, an analog to digital converter, a digital filter, and a Fast Fourier Transform. The system is interfaced to a 16 bit microprocessor. The microprocessor is programmed to control the complete digital signal processing. The digital filtering and Fast Fourier Transform functions are implemented by a S2815 digital filter/utility peripheral chip and a S2814A Fast Fourier Transform chip. The S2815 initially simulates a low-pass Butterworth filter with later expansion to complete filter circuit (bandpass and highpass) synthesizing.

Pujol, A.↗
NASA NTRS1974

Application and sensitivity investigation of Fourier transforms for microwave radiometric inversions

Existing microwave radiometer technology now provides a suitable method for remote determination of the ocean surface's absolute brightness temperature. To extract the brightness temperature of the water from the antenna temperature equation, an unstable Fredholm integral equation of the first kind was solved. Fast Fourier Transform techniques were used to invert the integral after it is placed into a cross-correlation form. Application and verification of the methods to a two-dimensional modeling of a laboratory wave tank system were included. The instability of the Fredholm equation was then demonstrated and a restoration procedure was included which smooths the resulting oscillations. With the recent availability and advances of Fast Fourier Transform techniques, the method presented becomes very attractive in the evaluation of large quantities of data. Actual radiometric measurements of sea water are inverted using the restoration method, incorporating the advantages of the Fast Fourier Transform algorithm for computations.

Holmes, J. J.↗
DOE OSTI2019

A fast Fourier transform-based mesoscale field dislocation mechanics study of grain size effects and reversible plasticity in polycrystals

A numerical implementation of a non-local polycrystal plasticity theory based on a mesoscale version of the field dislocation mechanics theory (MFDM) of Acharya and Roy (2006) is presented using small-strain elasto-viscoplastic fast Fourier transform-based (EVPFFT) algorithm developed by Lebensohn et al. (2012). In addition to considering plastic flow and hardening only due to SSDs (statistically stored dislocations) as in the classic EVPFFT framework, the proposed method accounts for the evolution of GND (geometrically necessary dislocations) densities solving a hyperbolic-type partial differential equation, and GND effects on both plastic flow and hardening. This allows consideration of an enhanced strain-hardening law that includes the effect of the GND density tensor. The numerical implementation of a reduced version of the MFDM is presented in the framework of the FFT-based augmented Lagrangian procedure of Michel et al. (2001). A Finite Differences scheme combined with discrete Fourier transforms is applied to solve both incompatibility and equilibrium equations. The numerical procedure named MFDM-EVPFFT is used to perform full field simulations of polycrystal plasticity considering different grain sizes and their mechanical responses during monotonic tensile and reversible tension-compression tests. Using Voronoi tessellation and periodic boundary conditions, voxelized representative volume elements (RVEs) with different grain sizes are generated. With MFDM-EVPFFT, a Hall-Petch type scaling law is obtained in contrast with the conventional crystal plasticity EVPFFT. In the case of reversible plasticity, a stronger Bauschinger effect is observed with the MFDM-EVPFFT approach in comparison with conventional EVPFFT. Here, the origin of these differences is analyzed in terms of heterogeneity, GND density and stress evolutions during the compression stage.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Surface Merging Technique to Design GA-Optimized Heat Sinks

High-power density inverters require efficient and small heat dissipation systems. For liquid cooling systems, an effective heat sink design is important to enable higher heat transfer and keep the pressure drop within reasonable limits. A heat sink geometry generated from an extruded, 1D fast Fourier transform can achieve more even temperature distribution and improved heat transfer than a conventional heat sink. Building on this concept, this paper proposes a new heat sink geometry creation algorithm. Instead of one plane profile being extruded, multiple plane profiles, each created from the fast Fourier transform method, are subsequently merged by smooth surfaces along the flow direction of the heat sink. Thus, a 3D heat sink geometry is created that enables 3D coolant flow and efficient heat transfer. The volume of this design was reduced by 50% compared with pin fin heat sinks. Compared with extruded 1D fast Fourier transform heat sinks, the proposed design showed an approximately 5% device temperature reduction and a 20% pressure drop reduction.

Barua, Himel↗
DOE OSTI2021

Predictive Data Analytics Framework Using Advanced Test Reactor Acoustic Data

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 at the Advanced Test Reactor (ATR) nozzle trench area to record acoustic signals that has the ability to capture different operating regime of the reactor. This AMI includes ATR in-pile structural components, coolant, acoustic receivers, primary coolant pumps (PCP) as signal sources, a data acquisition system, and signal-processing algorithms, enabling real-time. This report will discusses development of recursive Fast Fourier Transform approach to process in real-time acoustic signals, application of short time Fast Fourier Transform to the ATR brush data to understand the vibration level and to develop spectrograms for different primary coolant pump combinations. The combination of primary coolant pumps for normal and power axial locator mechanism of ATR are different and generates different signatures. These acoustic signatures were used to develop machine learning approaches to automatically classify different operating regimes. This lay the foundation for predictive analytic framework that can be leverage by ATR to optimize their operation and maintenance. The path forward involves continued engagement with ATR and expanded implementation of AMI and predictive framework at ATR and other facilities within INL and at other experimental reactors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1980

A Fourier transform with speed improvements for microprocessor applications

A fast Fourier transform algorithm for the RCA 1802microprocessor was developed for spacecraft instrument applications. The computations were tailored for the restrictions an eight bit machine imposes. The algorithm incorporates some aspects of Walsh function sequency to improve operational speed. This method uses a register to add a value proportional to the period of the band being processed before each computation is to be considered. If the result overflows into the DF register, the data sample is used in computation; otherwise computation is skipped. This operation is repeated for each of the 64 data samples. This technique is used for both sine and cosine portions of the computation. The processing uses eight bit data, but because of the many computations that can increase the size of the coefficient, floating point form is used. A method to reduce the alias problem in the lower bands is also described.

Lokerson, D. C.↗
NASA NTRS1992

Propagation Characteristics Of Weakly Guiding Optical Fibers

Report discusses electromagnetic propagation characteristics of weakly guiding optical-fiber structures having complicated shapes with cross-sectional dimensions of order of wavelength. Coupling, power-dividing, and transition dielectric-waveguide structures analyzed. Basic data computed by scalar-wave, fast-Fourier-transform (SW-FFT) technique, based on numerical solution of scalar version of wave equation by forward-marching fast-Fourier-transform method.

Manshadi, Farzin↗
DOE OSTI2016

Reducing the two-loop large-scale structure power spectrum to low-dimensional, radial integrals

Modeling the large-scale structure of the universe on nonlinear scales has the potential to substantially increase the science return of upcoming surveys by increasing the number of modes available for model comparisons. One way to achieve this is to model nonlinear scales perturbatively. Unfortunately, this involves high-dimensional loop integrals that are cumbersome to evaluate. Here, trying to simplify this, we show how two-loop (next-to-next-to-leading order) corrections to the density power spectrum can be reduced to low-dimensional, radial integrals. Many of those can be evaluated with a one-dimensional fast Fourier transform, which is significantly faster than the five-dimensional Monte-Carlo integrals that are needed otherwise. The general idea of this fast fourier transform perturbation theory method is to switch between Fourier and position space to avoid convolutions and integrate over orientations, leaving only radial integrals. This reformulation is independent of the underlying shape of the initial linear density power spectrum and should easily accommodate features such as those from baryonic acoustic oscillations. We also discuss how to account for halo bias and redshift space distortions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

MEUMAPPS (C++ Version)

Many materials, metal alloys in particular, have features on the on micrometer or nanometer scale that have a large impact on the properties of the material. These features are known as the microstructure of the material. Understanding why and how the microstructure forms in a material is of fundamental scientific interest as well as of significant technological interest. The capability to predict microstructure evolution in a material allows the intentional design of microstructures and hence the intentional design of material properties. The phase-field method is one of the leading methods for predicting microstructure evolution. One of the most significant problems for phase-field models is their computational expense. Even limited phase-field simulations can easily require thousands of CPU core-hours to complete, which significantly limits their use. This code provides both a general framework for creating scalable, GPU-accelerated phase-field model applications as well as several applications themselves. The code is capable of using hundreds of GPUs efficiently, which greatly reduces the time required to perform simulations. The code is written with an emphasis on performance portability, that is the ability for the code to run efficiently on a number of different computing architectures without modification of the source code. The performance portability of this code is primarily enabled through the use of two libraries, Kokkos (performance portable data structures and execution patterns) and heFFTe (performance portable distributed 3D fast Fourier transforms). The code consists of a core library, applications, and tests. The core library includes shared functionality between applications. This includes interfaces with fast Fourier transform (FFT) libraries such as heFFTe, data structures based on Kokkos, file input and output capabilities, and a solver for infinitesimal strain mechanical equilibrium problems. Five applications are included in the code. The flagship application is the MEUMAPPS-SS application, which implements the Kim-Kim-Suzuki phase-field model for precipitation for an arbitrary number of phases and components in a metal alloy. Five simpler applications are also included that solve the Eshelby inclusion problem, Allen-Cahn equation, the coupled Allen-Cahn and diffusion equations, and the Cahn-Hilliard equation. The code includes two applications to solve the Cahn-Hilliard equation, one with constant-step-size first-order time integration and the second with adaptive high-order time integration.

DeWitt, Stephen [Oak Ridge National Lab. (ORNL), O↗
NASA NTRS1990

New correction procedures for the fast field program which extend its range

A fast field program (FFP) algorithm was developed based on the method of Lee et al., for the prediction of sound pressure level from low frequency, high intensity sources. In order to permit accurate predictions at distances greater than 2 km, new correction procedures have had to be included in the algorithm. Certain functions, whose Hankel transforms can be determined analytically, are subtracted from the depth dependent Green's function. The distance response is then obtained as the sum of these transforms and the Fast Fourier Transformation (FFT) of the residual k dependent function. One procedure, which permits the elimination of most complex exponentials, has allowed significant changes in the structure of the FFP algorithm, which has resulted in a substantial reduction in computation time.

West, M.↗
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.↗