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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

The ISPM unified radio and plasma wave experiment

Hardware for the International Solar Polar Mission (ISPM) Unified Radio and Plasma (URAP) wave experiment is presented. The URAP determines direction and polarization of distant radio sources for remote sensing of the heliosphere, and studies local wave phenomena which determine the transport coefficients of the ambient plasma. Electric and magnetic field antennas and preamplifiers; the electromagnetic compatibility plan and grounding; radio astronomy and plasma frequency receivers; a fast Fourier transformation data processing unit waveform analyzer; dc voltage measurements; a fast envelope sampler for the solar wind, and plasmas near Jupiter; a sounder; and a power converter are described.

Stone, R. G.↗
NASA NTRS1984

Analysis and application of Fourier transform spectroscopy in atmospheric remote sensing

An analysis method for Fourier transform spectroscopy is summarized with applications to various types of distortion in atmospheric absorption spectra. This analysis method includes the fast Fourier transform method for simulating the interferometric spectrum and the nonlinear least-squares method for retrieving the information from a measured spectrum. It is shown that spectral distortions can be simulated quite well and that the correct information can be retrieved from a distorted spectrum by this analysis technique.

Park, J. H.↗
DOE OSTI2017

Structure in the 3D Galaxy Distribution. III. Fourier Transforming the Universe: Phase and Power Spectra

We demonstrate the effectiveness of a relatively straightforward analysis of the complex 3D Fourier transform of galaxy coordinates derived from redshift surveys. Numerical demonstrations of this approach are carried out on a volume-limited sample of the Sloan Digital Sky Survey redshift survey. The direct unbinned transform yields a complex 3D data cube quite similar to that from the Fast Fourier Transform of finely binned galaxy positions. In both cases, deconvolution of the sampling window function yields estimates of the true transform. Simple power spectrum estimates from these transforms are roughly consistent with those using more elaborate methods. The complex Fourier transform characterizes spatial distributional properties beyond the power spectrum in a manner different from (and we argue is more easily interpreted than) the conventional multipoint hierarchy. We identify some threads of modern large-scale inference methodology that will presumably yield detections in new wider and deeper surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2017

Structure in the 3D Galaxy Distribution. III. Fourier Transforming the Universe: Phase and Power Spectra

We demonstrate the effectiveness of a relatively straightforward analysis of the complex 3D Fourier transform of galaxy coordinates derived from redshift surveys. Numerical demonstrations of this approach are carried out on a volume-limited sample of the Sloan Digital Sky Survey redshift survey. The direct unbinned transform yields a complex 3D data cube quite similar to that from the Fast Fourier Transform of finely binned galaxy positions. In both cases, deconvolution of the sampling window function yields estimates of the true transform. Simple power spectrum estimates from these transforms are roughly consistent with those using more elaborate methods. The complex Fourier transform characterizes spatial distributional properties beyond the power spectrum in a manner different from (and we argue is more easily interpreted than) the conventional multipoint hierarchy. We identify some threads of modern large-scale inference methodology that will presumably yield detections in new wider and deeper surveys.

Galaxies↗
NASA NTRS2017

Structure in the 3D Galaxy Distribution: III. Fourier Transforming the Universe: Phase and Power Spectra

We demonstrate the effectiveness of a relatively straightforward analysis of the complex 3D Fourier transform of galaxy coordinates derived from redshift surveys. Numerical demonstrations of this approach are carried out on a volume-limited sample of the Sloan Digital Sky Survey redshift survey. The direct unbinned transform yields a complex 3D data cube quite similar to that from the Fast Fourier Transform (FFT) of finely binned galaxy positions. In both cases deconvolution of the sampling window function yields estimates of the true transform. Simple power spectrum estimates from these transforms are roughly consistent with those using more elaborate methods. The complex Fourier transform characterizes spatial distributional properties beyond the power spectrum in a manner different from (and we argue is more easily interpreted than) the conventional multi-point hierarchy. We identify some threads of modern large scale inference methodology that will presumably yield detections in new wider and deeper surveys.

Galactic clusters↗
NASA NTRS1976

Turbulence excited frequency domain damping measurement and truncation effects

Existing frequency domain modal frequency and damping analysis methods are discussed. The effects of truncation in the Laplace and Fourier transform data analysis methods are described. Methods for eliminating truncation errors from measured damping are presented. Implications of truncation effects in fast Fourier transform analysis are discussed. Limited comparison with test data is presented.

Soovere, J.↗
NASA NTRS1989

Fourier transform methods in local gravity modeling

New algorithms were derived for computing terrain corrections, all components of the attraction of the topography at the topographic surface and the gradients of these attractions. These algoriithms utilize fast Fourier transforms, but, in contrast to methods currently in use, all divergences of the integrals are removed during the analysis. Sequential methods employing a smooth intermediate reference surface were developed to avoid the very large transforms necessary when making computations at high resolution over a wide area. A new method for the numerical solution of Molodensky's problem was developed to mitigate the convergence difficulties that occur at short wavelengths with methods based on a Taylor series expansion. A trial field on a level surface is continued analytically to the topographic surface, and compared with that predicted from gravity observations. The difference is used to compute a correction to the trial field and the process iterated. Special techniques are employed to speed convergence and prevent oscillations. Three different spectral methods for fitting a point-mass set to a gravity field given on a regular grid at constant elevation are described. Two of the methods differ in the way that the spectrum of the point-mass set, which extends to infinite wave number, is matched to that of the gravity field which is band-limited. The third method is essentially a space-domain technique in which Fourier methods are used to solve a set of simultaneous equations.

Harrison, J. C.↗
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↗
DOE OSTI2016

FAST-PT: a novel algorithm to calculate convolution integrals in cosmological perturbation theory

We present a novel algorithm, FAST-PT, for performing convolution or mode-coupling integrals that appear in nonlinear cosmological perturbation theory. The algorithm uses several properties of gravitational structure formation—the locality of the dark matter equations and the scale invariance of the problem—as well as Fast Fourier Transforms to describe the input power spectrum as a superposition of power laws. This yields extremely fast performance, enabling mode-coupling integral computations fast enough to embed in Monte Carlo Markov Chain parameter estimation. We describe the algorithm and demonstrate its application to calculating nonlinear corrections to the matter power spectrum, including one-loop standard perturbation theory and the renormalization group approach. We also describe our public code (in Python) to implement this algorithm. The code, along with a user manual and example implementations, is available at https://github.com/JoeMcEwen/FAST-PT.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1992

Verification of the PROS timing analysis package

ROSAT observations of known pulsars are used to verify the functions of timing programs. The Crab Pulsar and PSR 0540-69, with 33 and 50 millisecond periods, are used to examine the fast Fourier transform and the epoch-folding task used to search for periodic signals. These fast pulsars provide a more vigorous test of the system than those with periods of a few seconds.

Manning, K. R.↗
NASA NTRS1976

The fast decoding of Reed-Solomon codes using number theoretic transforms

It is shown that Reed-Solomon (RS) codes can be encoded and decoded by using a fast Fourier transform (FFT) algorithm over finite fields. The arithmetic utilized to perform these transforms requires only integer additions, circular shifts and a minimum number of integer multiplications. The computing time of this transform encoder-decoder for RS codes is less than the time of the standard method for RS codes. More generally, the field GF(q) is also considered, where q is a prime of the form K x 2 to the nth power + 1 and K and n are integers. GF(q) can be used to decode very long RS codes by an efficient FFT algorithm with an improvement in the number of symbols. It is shown that a radix-8 FFT algorithm over GF(q squared) can be utilized to encode and decode very long RS codes with a large number of symbols. For eight symbols in GF(q squared), this transform over GF(q squared) can be made simpler than any other known number theoretic transform with a similar capability. Of special interest is the decoding of a 16-tuple RS code with four errors.

Reed, I. S.↗
DOE OSTI2023

Role of grain boundary crystallography on void growth in FCC metals

The growth of an isolated spherical void at and near a grain boundary or a triple junction is studied by means of full-field crystal plasticity simulations with explicit representation of the void. To examine the fundamental aspects of void/grain boundary interactions in these cases, a three-dimensional large-strain elasto-viscoplastic fast-Fourier transform (LS-EVP-FFT) model with axisymmetric tensile periodic boundary conditions was developed. We employ this model to reveal the role of crystallography (grain orientations, grain boundary misorientation and inclination angle with respect to the largest component of the applied stress) and type of loading on void growth. It was found that grain orientation was the primary crystallographic feature governing void growth in strain-rate controlled simulations. For strains small enough to not significantly alter the local geometry, the overall growth of the void in bicrystal boundaries was not strongly affected by grain boundary inclination angle. The relative amount of void growth experienced within each grain in a bicrystal or tri-crystal was strongly dependent on the grain boundary inclination angle. We found a subset of orientations that exhibit faster void growth in bicrystal boundaries than inside the constituent single crystals. Last, we show that when placed primarily in one grain but near the grain boundary, void growth was similar to void growth when placed at the grain boundary. Furthermore, the growing void remained in the original grain and did not grow into the other grain, regardless of crystallographic character.

36 MATERIALS SCIENCE↗
DOE OSTI2017

An accurate and efficient algorithm for detection of radio bursts with an unknown dispersion measure, for single-dish telescopes and interferometers

Astronomical radio signals are subjected to phase dispersion while traveling through the interstellar medium. To optimally detect a short-duration signal within a frequency band, we have to precisely compensate for the unknown pulse dispersion, which is a computationally demanding task. We present the “fast dispersion measure transform” algorithm for optimal detection of such signals. Our algorithm has a low theoretical complexity of 2N{sub f}N{sub t}+N{sub t}N{sub Δ}log{sub 2}(N{sub f}), where N{sub f}, N{sub t}, and N{sub Δ} are the numbers of frequency bins, time bins, and dispersion measure bins, respectively. Unlike previously suggested fast algorithms, our algorithm conserves the sensitivity of brute-force dedispersion. Our tests indicate that this algorithm, running on a standard desktop computer and implemented in a high-level programming language, is already faster than the state-of-the-art dedispersion codes running on graphical processing units (GPUs). We also present a variant of the algorithm that can be efficiently implemented on GPUs. The latter algorithm’s computation and data-transport requirements are similar to those of a two-dimensional fast Fourier transform, indicating that incoherent dedispersion can now be considered a nonissue while planning future surveys. We further present a fast algorithm for sensitive detection of pulses shorter than the dispersive smearing limits of incoherent dedispersion. In typical cases, this algorithm is orders of magnitude faster than enumerating dispersion measures and coherently dedispersing by convolution. We analyze the computational complexity of pulsed signal searches by radio interferometers. We conclude that, using our suggested algorithms, maximally sensitive blind searches for dispersed pulses are feasible using existing facilities. We provide an implementation of these algorithms in Python and MATLAB.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1977

Three-dimensional vector modeling and restoration of flat finite wave tank radiometric measurements

In this paper, a three-dimensional Fourier transform inversion method describing the interaction between water surface emitted radiation from a flat finite wave tank and antenna radiation characteristics is reported. The transform technique represents the scanning of the antenna mathematically as a correlation. Computation time is reduced by using the efficient and economical fast Fourier transform algorithm. To verify the inversion method, computations have been made and compared with known data and other available results. The technique has been used to restore data of the finite wave tank system and other available antenna temperature measurements made at the Cape Cod Canal. The restored brightness temperatures serve as better representations of the emitted radiation than the measured antenna temperatures.

Truman, W. M.↗
NASA NTRS1976

The fast decoding of Reed-Solomon codes using fermat theoretic transforms and continued fractions

It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform algorithm over finite fields GF(F sub n) where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.

Welch, L. R.↗
NASA NTRS1978

The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions

It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fields GF(F sub n), where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.

Reed, I. S.↗
NASA NTRS1989

Methods for local gravity field approximation

The most widely known modern method for estimating gravity field values from observed data is least-squares collocation. Its advantages are that it can make estimates at arbitrary locations based on irregularly spaced observations, and that it makes use of statistical information about errors in the input data while providing corresponding information about the quality of the output estimates. Disadvantages of collocation include the necessity of inverting square matrices of dimension equal to the number of data values and the need to assume covariance models for the gravity field and the data errors. Fourier methods are an important alternative to collocation; having the advantage of greater computational efficiency, but requiring data estimates to be on a regular grid and not using or providing statistical accuracy information. The GEOFAST algorithm is an implementation of collocation that achieves high computational efficiency by transforming the estimation equations into the frequency domain where an accurate approximation may be made to reduce the workload. The forward and inverse Fast Fourier Transforms (FFTs) are utilized. The accuracy and computational efficiency of the GEOFAST algorithm is demonstrated using two sets of synthetic gravity data: marine gravity for an ocean trench region including wavelengths longer than 200 km; and local land gravity containing wavelengths as short as 5 km. These results are discussed along with issues such as the advantages of first removing reference field models before carrying out the estimation algorithm.

Sailor, R. V.↗
DOE OSTI2022

Investigation of crossed-twin structure formation in magnesium and magnesium alloys

In this work, the effect of alloying addition on the propensity for twin-twin interactions to transform into crossed-twin structures in magnesium alloys is investigated. A full-field elasto-viscoplastic fast Fourier transform (EVP-FFT) framework combined with a discrete twin model and dislocation density-based hardening law for slip strengths is used to calculate the micromechanical fields in the crystalline matrix around the interacting twins. AZ31 and MgLi alloys are selected along with pure Mg to study the influence of plastic anisotropy in connection with alloying elements. These alloys were selected since their plastic anisotropy measure, which is defined as the ratio between the critical resolved shear stress for pyramidal $\langle$c +a$\rangle$ and basal $\langle$a$\rangle$ slip modes, spanned a wide range. To quantify the role of twin thicknesses, we probe a range of impinging twin thicknesses while fixing the recipient twin thickness. The analysis reveals that: (i) the local driving stress for crossed twin structure formation generated from the interaction of the two twins is lower in a low plastically anisotropic material, like a MgLi alloy, than a high plastically anisotropic material like pure Mg and (ii) the critical impinging twin thickness needed to form the crossed twin structure in pure Mg, AZ31 and MgLi alloys is ~0.5, ~0.75 and ~1.5 times the recipient twin thickness. We propose a relationship between the tendency for crossed twin structure formation and the experimentally observed higher ductility in MgLi alloys compared to pure Mg. Finally, one key implication of the findings is that crossed- twin structure formation can be hindered and the ductility of magnesium alloy thereby improved by properly choosing alloying elements that lower the slip strength for pyramidal $\langle$c + a$\rangle$ slip.

36 MATERIALS SCIENCE↗