Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “FFT”

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 145 records · Page 8

SETI - High sensitivity searches at NASA with high speed tape recorders

The paper reports the two observing programs conducted to compare two techniques which have been proposed as methods for performing the requisite Fourier transformations in very large multichannel spectrum analysers (MCSA): the direct digital FFT and optical transform processor. The details of the observations at NRAO utilizing a direct digital FFT are given. A description of the NAIC, Arecibo observations utilizing an optical processor at the Environmental Research Institute of Michigan (ERIM) and a microdensitometer at Electromagnetics System Laboratories (ESL) is presented. For both observing programs, statistical analysis of the power spectra produced by the nonreal-time MCSAs (or post-processing) was accomplished.

Tarter, J.↗

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

Fast polynomial transform and its implementation by computer

A fast polynomial transform (FPT) algorithm for computing two-dimensional cyclic convolutions on a general-purpose computer is demonstrated and compared with the FFT approach. An FPT program for two-dimensional convolutions written in FORTRAN is shown to be 20% faster than the conventional FFT algorithm. This higher speed advantage makes the FPT algorithm a candidate for many two-dimensional digital image filtering applications.

Reed, I. S.↗

Further SEASAT SAR coastal ocean wave analysis

Analysis techniques used to exploit SEASAT synthetic aperture radar (SAR) data of gravity waves are discussed and the SEASAT SAR's ability to monitor large scale variations in gravity wave fields in both deep and shallow water is evaluated. The SAR analysis techniques investigated included motion compensation adjustments and the semicausal model for spectral analysis of SAR wave data. It was determined that spectra generated from fast Fourier transform analysis (FFT) of SAR wave data were not significantly altered when either range telerotation adjustments or azimuth focus shifts were used during processing of the SAR signal histories, indicating that SEASAT imagery of gravity waves is not significantly improved or degraded by motion compensation adjustments. Evaluation of the semicausal (SC) model using SEASAT SAR data from Rev. 974 indicates that the SC spectral estimates were not significantly better than the FFT results.

Kasischke, E. S.↗

A parallel-pipeline architecture of the fast polynomial transform for computing a two-dimensional cyclic convolution

It is pointed out that the two-dimensional cyclic convolution is a useful tool for many two-dimensional digital signal processing applications. Two important applications are related to spaceborne high-resolution synthetic aperture radar (SAR) processing and image processing. Nussbaumer and Quandalle (1978) showed that a radix-2 polynomial transform analogous to the conventional radix-2 FFT algorithm can be used to compute a two-dimensional cyclic convolution. On the basis of results reported by Arambepola and Rayner (1979), a radix-2 polynomial transform can be defined to compute a multidimensional cyclic convolution. Truong et al. (1981) used the considered ideas together with the Chinese Theorem to further reduce the complexity of the radix-2 fast polynomial transform (FPT). Reed et al. (1981) demonstrated that such a new FPT algorithm is significantly faster than the FFT algorithm for computing a two-dimensional convolution. In the present investigation, a parallel-pipeline architecture is considered for implementing the FPT developed by Truong et al.

Truong, T. K.↗

Coherent integration

Coherent integration which is a digital filtering process and was applied to MST radar observations is discussed. It is simple to implement with either hardware or software and is appropriate for the very narrow band signals usually received by MST radars. By filtering the signal before performing spectral processing, the computations required for FFT or similar analysis are greatly reduced. Coherent integration does not increase the signal-to-noise ratio per unit bandwidth in the signal band. It filters out much of the wideband noise, which could also be done by full FFT processing of the raw signal.

Farley, D. T.↗

Insulation bonding test system

A method and a system for testing the bonding of foam insulation attached to metal is described. The system involves the use of an impacter which has a calibrated load cell mounted on a plunger and a hammer head mounted on the end of the plunger. When the impacter strikes the insulation at a point to be tested, the load cell measures the force of the impact and the precise time interval during which the hammer head is in contact with the insulation. This information is transmitted as an electrical signal to a load cell amplifier where the signal is conditioned and then transmitted to a fast Fourier transform (FFT) analyzer. The FFT analyzer produces energy spectral density curves which are displayed on a video screen. The termination frequency of the energy spectral density curve may be compared with a predetermined empirical scale to determine whether a igh quality bond, good bond, or debond is present at the point of impact.

Beggs, J. M.↗

Strategy for reflector pattern calculation: Let the computer do the work

Using high frequency approximations, the secondary pattern of a reflector antenna can be calculated by numerically evaluating a radiation integral I(u,v). In recent years, tremendous effort has been expended to reducing I(u,v) to Fourier integrals. These reduction schemes are invariably reflector geometry dependent. Hence, different analyses/computer software development must be carried out for different reflector shapes/boundaries. it is pointed out, that, as the computer power improves, these reduction schemes are no longer necessary. Comparable accuracy and computation time can be achieved by evaluating I(u,v) by a brute force FFT described in this note. Furthermore, there is virtually no restriction on the reflector geometry by using the brute force FFT.

Lam, P. T.↗

Strategy for reflector pattern calculation - Let the computer do the work

Using high frequency approximations, the secondary pattern of a reflector antenna can be calculated by numerically evaluating a radiation integral I(u,v). In recent years, tremendous effort has been expended to reducing I(u,v) to Fourier integrals. These reduction schemes are invariably reflector geometry dependent. Hence, different analyses/computer software development must be carried out for different reflector shapes/boundaries. It is pointed out, that, as the computer power improves, these reduction schemes are no longer necessary. Comparable accuracy and computation time can be achieved by evaluating I(u,v) by a brute force FFT described in this note. Furthermore, there is virtually no restriction on the reflector geometry by using the brute force FFT.

Lam, P. T.↗

Least-Squares Frequency-Acquisition Algorithm

Algorithm finds frequency and phase of sinudoidal signal in presence of noise. Algorithm is special case of more-general, adaptive-paramenter-estimation techniques. Computational requirements of algorithm comparable to corresponding fast-Fourier-transform (FFT) algorithm. Algorithm works directly in time domain, whereas FFT algorithm transforms data into frequency domain for estimation and detection and requires secondary algorithm to interpolate between frequencies.

Kumar, Rajendra↗

A microcomputer based frequency-domain processor for laser Doppler anemometry

A prototype multi-channel laser Doppler anemometry (LDA) processor was assembled using a wideband transient recorder and a microcomputer with an array processor for fast Fourier transform (FFT) computations. The prototype instrument was used to acquire, process, and record signals from a three-component wind tunnel LDA system subject to various conditions of noise and flow turbulence. The recorded data was used to evaluate the effectiveness of burst acceptance criteria, processing algorithms, and selection of processing parameters such as record length. The recorded signals were also used to obtain comparative estimates of signal-to-noise ratio between time-domain and frequency-domain signal detection schemes. These comparisons show that the FFT processing scheme allows accurate processing of signals for which the signal-to-noise ratio is 10 to 15 dB less than is practical using counter processors.

Horne, W. Clifton↗

A microcomputer based frequency-domain processor for laser Doppler anemometry

A prototype multi-channel laser Doppler anemometry (LDA) processor was assembled using a wideband transient recorder and a microcomputer with an array processor for fast Fourier transform (FFT) computations. The prototype instrument was used to acquire, process, and record signals from a three-component wind tunnel LDA system subject to various conditions of noise and flow turbulence. The recorded data was used to evaluate the effectiveness of burst acceptance criteria, processing algorithms, and selection of processing parameters such as record length. The recorded signals were also used to obtain comparative estimates of signal-to-noise ratio between time-domain and frequency-domain signal detection schemes. These comparisons show that the FFT processing scheme allows accurate processing of signals for which the signal-to-noise ratio is 10 to 15 dB less than is practical using counter processors.

Horne, W. Clifton↗

A combined finite element-boundary element formulation for solution of two-dimensional problems via CGFFT

A method for the computation of electromagnetic scattering from arbitrary two-dimensional bodies is presented. The method combines the finite element and boundary element methods leading to a system for solution via the conjugate gradient Fast Fourier Transform (FFT) algorithm. Two forms of boundaries aimed at reducing the storage requirement of the boundary integral are investigated. It is shown that the boundary integral becomes convolutional when a circular enclosure is chosen, resulting in reduced storage requirement when the system is solved via the conjugate gradient FFT method. The same holds for the ogival enclosure, except that some of the boundary integrals are not convolutional and must be carefully treated to maintain O(N) memory requirement. Results for several circular and ogival structures are presented and shown to be in excellent agreement with those obtained by traditional methods.

Collins, Jeffery D.↗

The role of topography in geodetic gravity field modelling

Masses associated with the topography, bathymetry, and its isostatic compensation are a dominant source of gravity field variations, especially at shorter wavelengths. On global scales the topographic/isostatic effects are also significant, except for the lowest harmonics. In practice, though, global effects need not be taken into account as such effects are included in the coefficients of the geopotential reference fields. On local scales, the short-wavelength gravity variations due to the topography may, in rugged terrain, be an order of magnitude larger than other effects. In such cases, explicit or implicit terrain reduction procedures are mandatory in order to obtain good prediction results. Such effects may be computed by space-domain integration or by fast Fourier transformation (FFT) methods. Numerical examples are given for areas of the Canadian Rockies. In principle, good knowledge of the topographic densities is required to produce the smoothest residual field. Densities may be determined from sample measurements or by gravimetric means, but both are somewhat troublesome methods in practice. The use of a standard density, e.g., 2.67 g/cu cm, may often yield satisfactory results and may be put within a consistent theoretical framework. The independence of density assumptions is the key point of the classical Molodensky approach to the geodetic boundary value problem. The Molodensky solutions take into account that land gravity field observations are done on a non-level surface. Molodensky's problem may be solved by integral expansions or more effective FFT methods, but the solution should not be intermixed with the use of terrain reductions. The methods are actually complimentary and may both be required in order to obtain the smoothest possible signal, least prone to aliasing and other effects coming from sparse data coverage, typical of rugged topography.

Forsberg, R.↗

Regional quasigeoid determination in Northern Germany and comparison with GPS

For the northern part of the Federal Republic of Germany, new quasigeoid solutions were computed by least squares collocation and fast Fourier transformation (FFT) techniques using point and mean gravity data, a digital terrain model, and a global geopotential model. As severe accuracy limitations for precise regional quasigeoid determination come from global model uncertainties, different geopotential models were investigated by combining them with gravimetric data and comparing the quasigeoid heights with GPS and leveling. Optimum results were obtained by a global model tailored to gravity data in Europe. Collocation and FFT results based on this model agree well. The comparison with GPS and leveling yields rms discrepancies of + or - 2 cm over approximately 400 km range.

Denker, Heiner↗

FFTs in external or hierarchical memory

A description is given of advanced techniques for computing an ordered FFT on a computer with external or hierarchical memory. These algorithms (1) require as few as two passes through the external data set, (2) use strictly unit stride, long vector transfers between main memory and external storage, (3) require only a modest amount of scratch space in main memory, and (4) are well suited for vector and parallel computation. Performance figures are included for implementations of some of these algorithms on Cray supercomputers. Of interest is the fact that a main memory version outperforms the current Cray library FFT routines on the Cray-2, the Cray X-MP, and the Cray Y-MP systems. Using all eight processors on the Cray Y-MP, this main memory routine runs at nearly 2 Gflops.

Bailey, David H.↗

A satellite-based radar wind sensor

The objective is to investigate the application of Doppler radar systems for global wind measurement. A model of the satellite-based radar wind sounder (RAWS) is discussed, and many critical problems in the designing process, such as the antenna scan pattern, tracking the Doppler shift caused by satellite motion, and backscattering of radar signals from different types of clouds, are discussed along with their computer simulations. In addition, algorithms for measuring mean frequency of radar echoes, such as the Fast Fourier Transform (FFT) estimator, the covariance estimator, and the estimators based on autoregressive models, are discussed. Monte Carlo computer simulations were used to compare the performance of these algorithms. Anti-alias methods are discussed for the FFT and the autoregressive methods. Several algorithms for reducing radar ambiguity were studied, such as random phase coding methods and staggered pulse repitition frequncy (PRF) methods. Computer simulations showed that these methods are not applicable to the RAWS because of the broad spectral widths of the radar echoes from clouds. A waveform modulation method using the concept of spread spectrum and correlation detection was developed to solve the radar ambiguity. Radar ambiguity functions were used to analyze the effective signal-to-noise ratios for the waveform modulation method. The results showed that, with suitable bandwidth product and modulation of the waveform, this method can achieve the desired maximum range and maximum frequency of the radar system.

Xin, Weizhuang↗

Ordered fast Fourier transforms on a massively parallel hypercube multiprocessor

The present evaluation of alternative, massively parallel hypercube processor-applicable designs for ordered radix-2 decimation-in-frequency FFT algorithms gives attention to the reduction of computation time-dominating communication. A combination of the order and computational phases of the FFT is accordingly employed, in conjunction with sequence-to-processor maps which reduce communication. Two orderings, 'standard' and 'cyclic', in which the order of the transform is the same as that of the input sequence, can be implemented with ease on the Connection Machine (where orderings are determined by geometries and priorities. A parallel method for trigonometric coefficient computation is presented which does not employ trigonometric functions or interprocessor communication.

Tong, Charles↗