SEARCH · Engineering Papers

Results for “Discrete 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Efficient demultiplexing algorithm for noncontiguous carriers

A channel separation algorithm for the frequency division multiple access/time division multiplexing (FDMA/TDM) scheme is presented. It is shown that implementation using this algorithm can be more effective than the fast Fourier transform (FFT) algorithm when only a small number of carriers need to be selected from many, such as satellite Earth terminals. The algorithm is based on polyphase filtering followed by application of a generalized Walsh-Hadamard transform (GWHT). Comparison of the transform technique used in this algorithm with discrete Fourier transform (DFT) and FFT is given. Estimates of the computational rates and power requirements to implement this system are also given.

Thanawala, A. A.↗

NASA NTRS1989

Studies in astronomical time series analysis. III - Fourier transforms, autocorrelation functions, and cross-correlation functions of unevenly spaced data

This paper develops techniques to evaluate the discrete Fourier transform (DFT), the autocorrelation function (ACF), and the cross-correlation function (CCF) of time series which are not evenly sampled. The series may consist of quantized point data (e.g., yes/no processes such as photon arrival). The DFT, which can be inverted to recover the original data and the sampling, is used to compute correlation functions by means of a procedure which is effectively, but not explicitly, an interpolation. The CCF can be computed for two time series not even sampled at the same set of times. Techniques for removing the distortion of the correlation functions caused by the sampling, determining the value of a constant component to the data, and treating unequally weighted data are also discussed. FORTRAN code for the Fourier transform algorithm and numerical examples of the techniques are given.

Scargle, Jeffrey D.↗

NASA NTRS1985

A separable two-dimensional discrete Hartley transform

Bracewell has proposed the Discrete Hartley Transform (DHT) as a substitute for the Discrete Fourier Transform (DFT), particularly as a means of convolution. Here, it is shown that the most natural extension of the DHT to two dimensions fails to be separate in the two dimensions, and is therefore inefficient. An alternative separable form is considered, corresponding convolution theorem is derived. That the DHT is unlikely to provide faster convolution than the DFT is also discussed.

Watson, A. B.↗

NASA NTRS1986

Separable two-dimensional discrete Hartley transform

Watson, Andrew B.↗

NASA NTRS2002

An Investigation into the Potential Application of Wavelets to Modal Testing and Analysis

The analysis of transient data of the type found in vibrating mechanical systems has been greatly improved through the use of modern techniques such as Fourier analysis. This is especially true when considered in conjunction with the development of the so-called Fast Fourier Transform algorithm by Cooley and the tremendous strides in computational power of the last several decades. The usefulness of the discrete Fourier Transform is its ability to transform sampled data from the "time-domain" to the "frequency domain," thereby allowing the analyst to decompose a signal into its frequency content. More recent developments have led to the wavelet transform. The strength of wavelet analysis is its ability to maintain both time and frequency information, thus making it an attractive candidate for the analysis of non-stationary signals. This report is an overview of wavelet theory and the potential use of the wavelet transform as an alternative to Fourier analysis in modal identification.

A. Fort Gwinn, Jr.↗

NASA NTRS1986

Short time Fourier analysis of the electromyogram - Fast movements and constant contraction

Short-time Fourier analysis was applied to surface electromyograms (EMG) recorded during rapid movements, and during isometric contractions at constant forces. A portion of the data to be transformed by multiplying the signal by a Hamming window was selected, and then the discrete Fourier transform was computed. Shifting the window along the data record, a new spectrum was computed each 10 ms. The transformed data were displayed in spectograms or 'voiceprints'. This short-time technique made it possible to see time-dependencies in the EMG that are normally averaged in the Fourier analysis of these signals. Spectra of EMGs during isometric contractions at constant force vary in the short (10-20 ms) term. Short-time spectra from EMGs recorded during rapid movements were much less variable. The windowing technique picked out the typical 'three-burst pattern' in EMG's from both wrist and head movements. Spectra during the bursts were more consistent than those during isometric contractions. Furthermore, there was a consistent shift in spectral statistics in the course of the three bursts. Both the center frequency and the variance of the spectral energy distribution grew from the first burst to the second burst in the same muscle. The analogy between EMGs and speech signals is extended to argue for future applicability of short-time spectral analysis of EMG.

Hannaford, Blake↗

NASA NTRS1980

System design for a million channel digital spectrum analyzer /MCSA/

The system design of a wideband (8 MHz) million-channel digital spectrum analyzer for use with a SETI receiver is presented. The analyzer makes use of a digital bandpass filter bank for transforming the wideband input signal into a specified number (120) of uniform narrowband output channels by the use of a Fourier transform digital processor combined with a prototype digital weighting network (finite impulse response filter). The output is then processed separately by 120 microprocessor-based discrete Fourier transform computers, each producing 8190 output channels of approximately 8 Hz bandwidth by the use of an 8190-point prime factor algorithm.

Peterson, A.↗

NASA NTRS1978

A fast D.F.T. algorithm using complex integer transforms

Winograd (1976) has developed a new class of algorithms which depend heavily on the computation of a cyclic convolution for computing the conventional DFT (discrete Fourier transform); this new algorithm, for a few hundred transform points, requires substantially fewer multiplications than the conventional FFT algorithm. Reed and Truong have defined a special class of finite Fourier-like transforms over GF(q squared), where q = 2 to the p power minus 1 is a Mersenne prime for p = 2, 3, 5, 7, 13, 17, 19, 31, 61. In the present paper it is shown that Winograd's algorithm can be combined with the aforementioned Fourier-like transform to yield a new algorithm for computing the DFT. A fast method for accurately computing the DFT of a sequence of complex numbers of very long transform-lengths is thus obtained.

Reed, I. S.↗

NASA NTRS1981

Study of high speed complex number algorithms

A method of evaluating the radiation integral on the curved surface of a reflecting antenna is presented. A three dimensional Fourier transform approach is used to generate a two dimensional radiation cross-section along a planer cut at any angle phi through the far field pattern. Salient to the method is an algorithm for evaluating a subset of the total three dimensional discrete Fourier transform results. The subset elements are selectively evaluated to yield data along a geometric plane of constant. The algorithm is extremely efficient so that computation of the induced surface currents via the physical optics approximation dominates the computer time required to compute a radiation pattern. Application to paraboloid reflectors with off-focus feeds in presented, but the method is easily extended to offset antenna systems and reflectors of arbitrary shapes. Numerical results were computed for both gain and phase and are compared with other published work.

Heisler, R.↗

NASA NTRS1978

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

NASA NTRS1994

Adaptive model reduction for continuous systems via recursive rational interpolation

A method for adaptive identification of reduced-order models for continuous stable SISO and MIMO plants is presented. The method recursively finds a model whose transfer function (matrix) matches that of the plant on a set of frequencies chosen by the designer. The algorithm utilizes the Moving Discrete Fourier Transform (MDFT) to continuously monitor the frequency-domain profile of the system input and output signals. The MDFT is an efficient method of monitoring discrete points in the frequency domain of an evolving function of time. The model parameters are estimated from MDFT data using standard recursive parameter estimation techniques. The algorithm has been shown in simulations to be quite robust to additive noise in the inputs and outputs. A significant advantage of the method is that it enables a type of on-line model validation. This is accomplished by simultaneously identifying a number of models and comparing each with the plant in the frequency domain. Simulations of the method applied to an 8th-order SISO plant and a 10-state 2-input 2-output plant are presented. An example of on-line model validation applied to the SISO plant is also presented.

Lilly, John H.↗

NASA NTRS1976

CCD correlation techniques

Two CCD techniques were discussed for performing an N-point sampled data correlation between an input signal and an electronically programmable reference function. The design and experimental performance of an implementation of the direct time correlator utilizing two analog CCDs and MOS multipliers on a single IC were evaluated. The performance of a CCD implementation of the chirp z transform was described, and the design of a new CCD integrated circuit for performing correlation by multiplication in the frequency domain was presented. This chip provides a discrete Fourier transform (DFT) or inverse DFT, multipliers, and complete support circuitry for the CCD CZT. The two correlation techniques are compared.

Hewes, C. R.↗

NASA NTRS1993

Cramer-Rao Bound for Gaussian Random Processes and Applications to Radar Processing of Atmospheric Signals

Calculations of the exact Cramer-Rao Bound (CRB) for unbiased estimates of the mean frequency, signal power, and spectral width of Doppler radar/lidar signals (a Gaussian random process) are presented. Approximate CRB's are derived using the Discrete Fourier Transform (DFT). These approximate results are equal to the exact CRB when the DFT coefficients are mutually uncorrelated. Previous high SNR limits for CRB's are shown to be inaccurate because the discrete summations cannot be approximated with integration. The performance of an approximate maximum likelihood estimator for mean frequency approaches the exact CRB for moderate signal to noise ratio and moderate spectral width.

Frehlich, Rod↗

NASA NTRS1972

Design study of a low bit rate transmitter and simulator

The results achieved toward developing a baseline communications channel model for studying low bit rate telemetry transmissions from Venus Planetary Explorer spacecraft are presented. The overall communications systems model, discrete channel model, input signal generation, and signal acquisition model are discussed. Discrete Fourier transform considerations, sampling routines, and flow charts are included.

Zusman, F. S.↗

NASA NTRS1974

Single-tone parameter estimation from discrete-time observations

Estimation of the parameters of a single-frequency complex tone from a finite number of noisy discrete-time observations is discussed. The appropriate Cramer-Rao bounds and maximum-likelihood (ML) estimation algorithms are derived. Some properties of the ML estimators are proved. The relationship of ML estimation to the discrete Fourier transform is exploited to obtain practial algorithms. The threshold effect of one algorithm is analyzed and compared to simulation results. Other simulation results verify other aspects of the analysis.

Rife, D. C.↗

NASA NTRS1978

Doppler lidar processing for atmospheric turbulence measurements

A Doppler lidar is described, its processing methods are characterized, and two alternate techniques are considered. The described system uses a CO2 laser transmitting at 10.6 microns and a bank of narrow band filters for the spectrum analysis. Typical results obtained with this system are presented. The two alternate techniques involve computation of the discrete spectrum by use of the discrete Fourier transform. The first technique involves single-pulse processing and incoherent integration, while the second technique performs coherent processing on the train of received pulses.

Polge, R. J.↗

NASA NTRS1980

An experimental distributed microprocessor implementation with a shared memory communications and control medium

The distributed processing concept is defined in terms of control primitives, variables, and structures and their use in performing a decomposed discrete Fourier transform (DET) application function. The design assumes interprocessor communications to be anonymous. In this scheme, all processors can access an entire common database by employing control primitives. Access to selected areas within the common database is random, enforced by a hardware lock, and determined by task and subtask pointers. This enables the number of processors to be varied in the configuration without any modifications to the control structure. Decompositional elements of the DFT application function in terms of tasks and subtasks are also described. The experimental hardware configuration consists of IMSAI 8080 chassis which are independent, 8 bit microcomputer units. These chassis are linked together to form a multiple processing system by means of a shared memory facility. This facility consists of hardware which provides a bus structure to enable up to six microcomputers to be interconnected. It provides polling and arbitration logic so that only one processor has access to shared memory at any one time.

Mejzak, R. S.↗

NASA NTRS1980

Calculation of power spectrums from digital time series with missing data points

Two algorithms are developed for calculating power spectrums from the autocorrelation function when there are missing data points in the time series. Both methods use an average sampling interval to compute lagged products. One method, the correlation function power spectrum, takes the discrete Fourier transform of the lagged products directly to obtain the spectrum, while the other, the modified Blackman-Tukey power spectrum, takes the Fourier transform of the mean lagged products. Both techniques require fewer calculations than other procedures since only 50% to 80% of the maximum lags need be calculated. The algorithms are compared with the Fourier transform power spectrum and two least squares procedures (all for an arbitrary data spacing). Examples are given showing recovery of frequency components from simulated periodic data where portions of the time series are missing and random noise has been added to both the time points and to values of the function. In addition the methods are compared using real data. All procedures performed equally well in detecting periodicities in the data.

Murray, C. W., Jr.↗