Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
NASA NTRS1964

Useful operator in plasma kinetic theory.

Operator used in derivation of plasma kinetic equation, expressing integral of pair correlation function for stable and unstable cases via Fourier transform

PLASMA DYNAMICS↗
NASA NTRS1986

A VLSI pipeline design of a fast prime factor DFT on a finite field

A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q sub n). A pipeline structure is used to implement this prime factor DFT over GF(q sub n). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode Reed-Solomon codes. Such a pipeline fast prime factor DFT algorithm over GF(q sub n) is regular, simple, expandable, and naturally suitable for VLSI implementation. An example illustrating the pipeline aspect of a 30-point transform over GF(q sub n) is presented.

Truong, T. K.↗
NASA NTRS1988

A pipeline design of a fast prime factor DFT on a finite field

A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q sub n). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode Reed-Solomon codes. Such a pipeline fast prime factor DFT algorithm over GF(q sub n) is regular, simple, expandable, and naturally suitable for VLSI implementation. An example illustrating the pipeline aspect of a 30-point transform over GF(q sub n) is presented.

Truong, T. K.↗
NASA NTRS1981

Three methods for performing Hankel transforms

Three methods for performing Hankel transforms with optical or digital processors are described. The first method is applicable when the input data is available in Cartesian (x-y) format and uses the close connection between generalized Hankel transform and the two dimensional Fourier transform in Cartesian coordinates. The second method is useful when the input data is in polar (r - theta) format and uses change of variables to perform the nth order Hankel transform as a correlation integral. The third method utilizes the von Neumann addition theorem for Bessel functions to extract the Hankel coefficients from a correlation between the radial part of the input and a Bessel function. Initial experimental results obtained for optical implementation of the first two methods are presented.

Athale, R. A.↗
NASA NTRS1985

Polar convection patterns under quiet conditions

Convection electric field patterns at high latitudes appropriate to periods of low geomagnetic activity are presented. The postulate that the global Joule dissipation rate is a minimum is employed to derive characteristic field distributions for the situation when ring current ohmic losses are negligible and the auroral oval enhancement of height-integrated Hall conductivity is small. The fast Fourier transform is introduced to compute Fourier coefficients of discrete field-aligned current data, and the method is shown to be quite useful in this context as a least squares fitting routine. The model calculations demonstrate the approach of the high-latitude ionosphere toward the perfect shielding configuration predicted by the theory for quiet times.

Barbosa, D. D.↗
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↗
NASA NTRS1976

Fourier and Hadamard transform spectrometers - A limited comparison

An encoding figure of merit is established for a detector-noise limited Fourier transform spectrometer (FTS) and compared to the comparable figure for a Hadamard transform spectrometer (HTS). The limitation of the Fourier system is partly that it does not truly Fourier analyze the radiation. Instead a cosine squared modulation is imposed on the different spectral frequencies. An additional difficulty is that neither the cosine nor the cosine squared functions form an orthonormal set. This makes the Fellgett's advantage (root-mean-squared figure of merit) for a single detector Michelson interferometer a factor of the square root of (N/8) greater than for a conventional grating instrument - rather than the square root of (N/2). The theoretical limit would be the square root of N.

Tai, M. H.↗
NASA NTRS1974

A note on parallel and pipeline computation of fast unitary transforms

The parallel and pipeline organization of fast unitary transform algorithms such as the Fast Fourier Transform are discussed. The efficiency is pointed out of a combined parallel-pipeline processor of a transform such as the Haar transform in which 2 to the n minus 1 power hardware butterflies generate a transform of order 2 to the n power every computation cycle.

Fino, B. J.↗
NASA NTRS1975

Parallel and pipeline computation of fast unitary transforms

The letter discusses the parallel and pipeline organization of fast-unitary-transform algorithms such as the fast Fourier transform, and points out the efficiency of a combined parallel-pipeline processor of a transform such as the Haar transform, in which (2 to the n-th power) -1 hardware 'butterflies' generate a transform of order 2 to the n-th power every computation cycle.

Fino, B. J.↗
NASA NTRS1979

Supersonic propeller noise in a uniform flow

The reported investigation is concerned with an extension of a theory presented by Hawkings and Lowson (1974). The extension considers also forward flight. Attention is given to the retarded potential solution of the convected wave equation, the Fourier components of acoustic pressure, the zones of relative silence and Doppler amplification, and the asymptotic evaluation of a noise field for a large wave number. The discussed analysis provides the Fourier coefficients of the acoustic signature of a supersonic rotor in a uniform flow. The results are represented by an integral over the blade planform which must be evaluated numerically. The fast Fourier transform can be employed for the Fourier inversion.

Jou, W.-H.↗
NASA NTRS2010

Transforming Mean and Osculating Elements Using Numerical Methods

Mean element propagation of perturbed two body orbits has as its mathematical basis averaging theory of nonlinear dynamical systems. Averaged mean elements define the long-term evolution characteristics of an orbit. Using averaging theory, a near identity transformation can be found that transforms the mean elements back to the osculating elements that contain short period terms in addition to the secular and long period mean elements. The ability to perform the conversion is necessary so that orbit design conducted in mean elements can be converted back into osculating results. In the present work, this near identity transformation is found using the Fast Fourier Transform. An efficient method is found that is capable of recovering the osculating elements to first order

averaging↗