Search NASASearch

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 73 records · Page 4

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.

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.

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.

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

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.

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.

Ultrasonic Resonance Spectroscopy of Composite Rings for Flywheel Rotors

Flywheel energy storage devices comprising multilayered composite rotor systems are being studied extensively for utilization in the International Space Station. These composite material systems were investigated with a recently developed ultrasonic resonance spectroscopy technique. The system employs a swept frequency approach and performs a fast Fourier transform on the frequency spectrum of the response signal. In addition. the system allows for equalization of the frequency spectrum, providing all frequencies with equal amounts of energy to excite higher order resonant harmonics. Interpretation of the second fast Fourier transform, along with equalization of the frequency spectrum, offers greater assurance in acquiring and analyzing the fundamental frequency, or spectrum resonance spacing. The range of frequencies swept in a pitch-catch mode was varied up to 8 MHz, depending on the material and geometry of the component. Single and multilayered material samples, with and without known defects, were evaluated to determine how the constituents of a composite material system affect the resonant frequency. Amplitude and frequency changes in the spectrum and spectrum resonance spacing domains were examined from ultrasonic responses of a flat composite coupon, thin composite rings, and thick composite rings. Also, the ultrasonic spectroscopy responses from areas with an intentional delamination and a foreign material insert, similar to defects that may occur during manufacturing malfunctions, were compared with those from defect-free areas in thin composite rings. A thick composite ring with varying thickness was tested to investigate the full-thickness resonant frequency and any possible bulk interfacial bond issues. Finally, the effect on the frequency response of naturally occurring single and clustered voids in a composite ring was established.

Harmon, Laura M.

Propagation characteristics of optical fiber structures with arbitrary shape and index variation

The application of the scalar wave-fast Fourier transform (SW-FFT) technique to the computation of the propagation characteristics of some complex optical fiber structures is presented. The SW-FFT technique is based on the numerical solution of the scalar wave equation by a forward-marching fast Fourier transform method. This solution yields the spatial configuration of the fields as well as its modal characteristics in and around the guiding structure. The following are treated by the SW-FFT method: analysis of coupled optical fibers and computation of their odd and even modes and coupling length; the solution of tapered optical waveguides (transitions) and the study of the effect of the slope of the taper on mode conversion; and the analysis of branching optical fibers and demonstration of their mode-filtering and/or power-dividing properties.

Manshadi, F.

Two-Dimensional Ffowcs Williams/Hawkings Equation Solver

FWH2D is a Fortran 90 computer program that solves a two-dimensional (2D) version of the equation, derived by J. E. Ffowcs Williams and D. L. Hawkings, for sound generated by turbulent flow. FWH2D was developed especially for estimating noise generated by airflows around such approximately 2D airframe components as slats. The user provides input data on fluctuations of pressure, density, and velocity on some surface. These data are combined with information about the geometry of the surface to calculate histories of thickness and loading terms. These histories are fast-Fourier-transformed into the frequency domain. For each frequency of interest and each observer position specified by the user, kernel functions are integrated over the surface by use of the trapezoidal rule to calculate a pressure signal. The resulting frequency-domain signals are inverse-fast-Fourier-transformed back into the time domain. The output of the code consists of the time- and frequency-domain representations of the pressure signals at the observer positions. Because of its approximate nature, FWH2D overpredicts the noise from a finite-length (3D) component. The advantage of FWH2D is that it requires a fraction of the computation time of a 3D Ffowcs Williams/Hawkings solver.

Lockard, David P.

On the normality and accuracy of simulated random processes.

Efficient methods of simulating stationary and nonstationary random processes and envelopes, by using a series of sine or cosine functions or by using the fast Fourier transform, have been proposed previously. Without applying the central limit theorem, it is shown in this paper that the simulated random processes are asymptotically Gaussian processes as the number of terms, N, of sine or cosine functions approaches infinity. The accuracy of the first-order probability densities of the simulated random processes is investigated by using the fast Fourier transform. Numerical results are computed with respect to the variation of the number of terms, N, of sine or cosine functions used for simulation. It is shown that within the practical range of N, such as 500, the accuracy is remarkably satisfactory even outside the region of 3 standard deviations.

Yang, J.-N.

Dynamic Stability Instrumentation System (DSIS). Volume 1: Hardware description

This paper is a hardware description manual for the Dynamic Stability Instrumentation System that is used in specific NASA Langley wind tunnels. The instrumentation system performs either a synchronous demodulation or a fast Fourier transform on dynamic balance strain gage signals, and ultimately computes aerodynamic coefficients. The DSIS consists of a double rack of instruments, a remote motor-generator set, two special stings each with motor driven shafts, and specially designed balances. The major components in the instrumentation rack include a personal computer, digital signal processor microcomputers, computer-controlled signal conditioners, function generator, digital multimeter, and an optional fast Fourier transform analyzer.

Jordan, T. L.

Onboard multichannel demultiplexer/demodulator

An investigation performed for NASA LeRC by COMSAT Labs, of a digitally implemented on-board demultiplexer/demodulator able to process a mix of uplink carriers of differing bandwidths and center frequencies and programmable in orbit to accommodate variations in traffic flow is reported. The processor accepts high speed samples of the signal carried in a wideband satellite transponder channel, processes these as a composite to determine the signal spectrum, filters the result into individual channels that carry modulated carriers and demodulate these to recover their digital baseband content. The processor is implemented by using forward and inverse pipeline Fast Fourier Transformation techniques. The recovered carriers are then demodulated using a single digitally implemented demodulator that processes all of the modulated carriers. The effort has determined the feasibility of the concept with multiple TDMA carriers, identified critical path technologies, and assessed the potential of developing these technologies to a level capable of supporting a practical, cost effective on-board implementation. The result is a flexible, high speed, digitally implemented Fast Fourier Transform (FFT) bulk demultiplexer/demodulator.

Campanella, S. Joseph

The fast decoding of Reed-Solomon codes using high-radix fermat theoretic transforms

Fourier-like transforms over GF(F sub n), where F sub n = 2(2n) + 1 is a Fermat prime, are applied in decoding Reed-Solomon codes. It is shown that such transforms can be computed using high-radix fast Fourier transform (FFT) algorithms requiring considerably fewer multiplications than the more usual radix 2 FFT algorithm. A special 256-symbol, 16-symbol-error-correcting, Reed-Solomon (RS) code for space communication-link applications can be encoded and decoded using this high-radix FFT algorithm over GF(F sub 3).

Liu, K. Y.

An active antenna for ELF magnetic fields

The work of Nikola Tesla, especially that directed toward world-wide electrical energy distribution via excitation of the earth-ionosphere cavity resonances, has stimulated interest in the study of these resonances. Not only are they important for their potential use in the transmission of intelligence and electrical power, they are important because they are an integral part of our natural environment. This paper describes the design of a sensitive, untuned, low noise active antenna which is uniquely suited to modern earth-ionosphere cavity resonance measurements employing fast-Fourier transform techniques for near-real-time data analysis. It capitalizes on a little known field-antenna interaction mechanism. Recently, the authors made preliminary measurements of the magnetic fields in the earth-ionosphere cavity. During the course of this study, the problem of designing an optimized ELF magnetic field sensor presented itself. The sensor would have to be small, light weight (for portable use), and capable of detecting the 5-50 Hz picoTesla-level signals generated by the natural excitations of the earth-ionosphere cavity resonances. A review of the literature revealed that past researchers had employed very large search coils, both tuned and untuned. Hill and Bostick, for example, used coils of 30,000 turns wound on high permeability cores of 1.83 m length, weighing 40 kg. Tuned coils are unsuitable for modern fast-Fourier transform data analysis techniques which require a broad spectrum input. 'Untuned' coils connected to high input impedance voltage amplifiers exhibit resonant responses at the resonant frequency determined by the coil inductance and the coil distributed winding capacitance. Also, considered as antennas, they have effective areas equal only to their geometrical areas.

Sutton, John F.

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

Addendum to 'A new hybrid algorithm for computing a fast discrete Fourier transform'

The reported investigation represents a continuation of a study conducted by Reed and Truong (1979), who proposed a hybrid algorithm for computing the discrete Fourier transform (DFT). The proposed technique employs a Winograd-type algorithm in conjunction with the Mersenne prime-number theoretic transform to perform a DFT. The implementation of the technique involves a considerable number of additions. The new investigation shows an approach which can reduce the number of additions significantly. It is proposed to use Winograd's algorithm for computing the Mersenne prime-number theoretic transform in the transform portion of the hybrid algorithm.

Reed, I. S.