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 181 records · Page 10

Fixed-point error analysis of Winograd Fourier transform algorithms

The quantization error introduced by the Winograd Fourier transform algorithm (WFTA) when implemented in fixed-point arithmetic is studied and compared with that of the fast Fourier transform (FFT). The effect of ordering the computational modules and the relative contributions of data quantization error and coefficient quantization error are determined. In addition, the quantization error introduced by the Good-Winograd (GW) algorithm, which uses Good's prime-factor decomposition for the discrete Fourier transform (DFT) together with Winograd's short length DFT algorithms, is studied. Error introduced by the WFTA is, in all cases, worse than that of the FFT. In general, the WFTA requires one or two more bits for data representation to give an error similar to that of the FFT. Error introduced by the GW algorithm is approximately the same as that of the FFT.

Patterson, R. W.↗

Secondary pattern computation of an offset reflector antenna

Reflector antennas are widely used in communications satellite systems because they provide high gain at low cost. In analyzing reflector antennas the computation of the secondary pattern is the main concern. A computer program for calculating the secondary pattern of an offset reflector has been developed and implemented at the NASA Lewis Research Center. The theoretical foundation for this program is based on the use of geometrical optics to describe the fields from the feed to the reflector surface and to the aperture plane. The resulting aperture field distribution is then transformed to the far-field zone by the fast Fourier transform algorithm. Comparing this technique with other well-known techniques (the geometrical theory of diffraction, physical optics (Jacobi-Bessel), etc.) shows good agreement for large (diameter of 100 lambda or greater) reflector antennas.

Acosta, R. J.↗

A discrete Fourier transform for virtual memory machines

An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of the details of the theory leads to a computationally efficient fast Fourier transform for the use on computers with virtual memory. Such an algorithm is of great use on modern desktop machines. A FORTRAN coded version of the algorithm is given for the case when the sequence of numbers to be transformed is a power of two.

Galant, David C.↗

A High-Order Direct Solver for Helmholtz Equations with Neumann Boundary Conditions

In this study, a compact finite-difference discretization is first developed for Helmholtz equations on rectangular domains. Special treatments are then introduced for Neumann and Neumann-Dirichlet boundary conditions to achieve accuracy and separability. Finally, a Fast Fourier Transform (FFT) based technique is used to yield a fast direct solver. Analytical and experimental results show this newly proposed solver is comparable to the conventional second-order elliptic solver when accuracy is not a primary concern, and is significantly faster than that of the conventional solver if a highly accurate solution is required. In addition, this newly proposed fourth order Helmholtz solver is parallel in nature. It is readily available for parallel and distributed computers. The compact scheme introduced in this study is likely extendible for sixth-order accurate algorithms and for more general elliptic equations.

Sun, Xian-He↗

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

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

Non-contact feature detection using ultrasonic Lamb waves

Apparatus and method for non-contact ultrasonic detection of features on or within the walls of hollow pipes are described. An air-coupled, high-power ultrasonic transducer for generating guided waves in the pipe wall, and a high-sensitivity, air-coupled transducer for detecting these waves, are disposed at a distance apart and at chosen angle with respect to the surface of the pipe, either inside of or outside of the pipe. Measurements may be made in reflection or transmission modes depending on the relative position of the transducers and the pipe. Data are taken by sweeping the frequency of the incident ultrasonic waves, using a tracking narrow-band filter to reduce detected noise, and transforming the frequency domain data into the time domain using fast Fourier transformation, if required.

47 OTHER INSTRUMENTATION↗

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↗

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↗

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↗

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

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

Diverse methods of analyzing neutron detector signal for power monitoring in commercial fast reactors

In a fast reactor, the measurement of instantaneous power, accurately at any point of time is of prime importance. To control the reactor power within its design limit for safe operation, measurement of power and safety functions operated by different systems based on power is required. This is done with neutron detectors from which signal come as current pulses in random following Poisson distribution. Due to heavy overlap, individual pulse counting is extremely difficult beyond certain frequency. So to count pulses in the detector output in a given length of time, which will be measure of power in the reactor, indirect method of signal processing is applied here. After applying signal processing methods on the detector output, linear relation is established between maximum amplitude of absolute of FFT (Fast Fourier Transform) of the signal and no of pulses in a given length of time of the signal i.e. rate of arrival of pulses to the detector. This linear relation is verified in different ways i.e. with simulated fixed rate of arrival of the pulses, random rate of arrival of the pulses and with neutron detector simulator output. The paper explains various stages of development and testing. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

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↗

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↗

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

Numerical Solution of 3D Poisson-Nernst-Planck Equations Coupled with Classical Density Functional Theory for Modeling Ion and Electron Transport in a Confined Environment

We have developed efficient numerical algorithms for the solution of 3D steady-state Poisson-Nernst-Planck equations (PNP) with excess chemical potentials described by the classical density functional theory (cDFT). The coupled PNP equations are discretized by finite difference scheme and solved iteratively by Gummel method with relaxation. The Nernst-Planck equations are transformed into Laplace equations through the Slotboom transformation. Algebraic multigrid method is then applied to efficiently solve the Poisson equation and the transformed Nernst-Planck equations. A novel strategy for calculating excess chemical potentials through fast Fourier transforms is proposed which reduces computational complexity from O(N2) to O(NlogN) where N is the number of grid points. Integrals involving Dirac delta function are evaluated directly by coordinate transformation which yields more accurate result compared to applying numerical quadrature to an approximated delta function. Numerical results for ion and electron transport in solid electrolyte for Li ion batteries are shown to be in good agreement with the experimental data and the results from previous studies.

Meng, Da↗

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