Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast Fourier transform (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 163 records · Page 9

High speed hardware development for FDMA/TDM system

The development of a transmultiplexor and a quadrature phase shift keying (QPSK) demodulator is discussed. The system is designed to meet real time signal processing requirements of future satellite systems and should consume very little power. The architectures of the transmultiplexor and the demodulator are designed for the pipelining of all the modules, namely the commutator, the filter bank fast fourier transform (FFT), and the internal modules of the QPSK. The architecture is designed for the case of 800 channels. Each channel is to have a bandwidth of 45 KHz and a bit rate of 64 Kb/s. In this case each module will have 22.22 micro seconds to complete a computation.

Kwatra, S. C.↗

Using single buffers and data reorganization to implement a multi-megasample fast Fourier transform

Data ordering in large fast Fourier transforms (FFT's) is both conceptually and implementationally difficult. Discribed here is a method of visualizing data orderings as vectors of address bits, which enables the engineer to use more efficient data orderings and reduce double-buffer memory designs. Also detailed are the difficulties and algorithmic solutions involved in FFT lengths up to 4 megasamples (Msamples) and sample rates up to 80 MHz.

Brown, R. D.↗

Scattering and radiation analysis of three-dimensional cavity arrays via a hybrid finite element method

A hybrid numerical technique is presented for a characterization of the scattering and radiation properties of three-dimensional cavity arrays recessed in a ground plane. The technique combines the finite element and boundary integral methods and invokes Floquet's representation to formulate a system of equations for the fields at the apertures and those inside the cavities. The system is solved via the conjugate gradient method in conjunction with the Fast Fourier Transform (FFT) thus achieving an O(N) storage requirement. By virtue of the finite element method, the proposed technique is applicable to periodic arrays comprised of cavities having arbitrary shape and filled with inhomogeneous dielectrics. Several numerical results are presented, along with new measured data, which demonstrate the validity, efficiency, and capability of the technique.

Jin, Jian-Ming↗

Real-time processing of radar return on a parallel computer

NASA is working with the FAA to demonstrate the feasibility of pulse Doppler radar as a candidate airborne sensor to detect low altitude windshears. The need to provide the pilot with timely information about possible hazards has motivated a demand for real-time processing of a radar return. Investigated here is parallel processing as a means of accommodating the high data rates required. A PC based parallel computer, called the transputer, is used to investigate issues in real time concurrent processing of radar signals. A transputer network is made up of an array of single instruction stream processors that can be networked in a variety of ways. They are easily reconfigured and software development is largely independent of the particular network topology. The performance of the transputer is evaluated in light of the computational requirements. A number of algorithms have been implemented on the transputers in OCCAM, a language specially designed for parallel processing. These include signal processing algorithms such as the Fast Fourier Transform (FFT), pulse-pair, and autoregressive modelling, as well as routing software to support concurrency. The most computationally intensive task is estimating the spectrum. Two approaches have been taken on this problem, the first and most conventional of which is to use the FFT. By using table look-ups for the basis function and other optimizing techniques, an algorithm has been developed that is sufficient for real time. The other approach is to model the signal as an autoregressive process and estimate the spectrum based on the model coefficients. This technique is attractive because it does not suffer from the spectral leakage problem inherent in the FFT. Benchmark tests indicate that autoregressive modeling is feasible in real time.

Aalfs, David D.↗

A numerical resolution study of high order essentially non-oscillatory schemes applied to incompressible flow

High order essentially non-oscillatory (ENO) schemes, originally designed for compressible flow and in general for hyperbolic conservation laws, are applied to incompressible Euler and Navier-Stokes equations with periodic boundary conditions. The projection to divergence-free velocity fields is achieved by fourth order central differences through Fast Fourier Transforms (FFT) and a mild high-order filtering. The objective of this work is to assess the resolution of ENO schemes for large scale features of the flow when a coarse grid is used and small scale features of the flow, such as shears and roll-ups, are not fully resolved. It is found that high-order ENO schemes remain stable under such situations and quantities related to large-scale features, such as the total circulation around the roll-up region, are adequately resolved.

Weinan, E.↗

A general purpose subroutine for fast fourier transform on a distributed memory parallel machine

One issue which is central in developing a general purpose Fast Fourier Transform (FFT) subroutine on a distributed memory parallel machine is the data distribution. It is possible that different users would like to use the FFT routine with different data distributions. Thus, there is a need to design FFT schemes on distributed memory parallel machines which can support a variety of data distributions. An FFT implementation on a distributed memory parallel machine which works for a number of data distributions commonly encountered in scientific applications is presented. The problem of rearranging the data after computing the FFT is also addressed. The performance of the implementation on a distributed memory parallel machine Intel iPSC/860 is evaluated.

Dubey, A.↗

MAC to VAX Connectivity: Heartrate Spectral Analysis System

The heart rate Spectral Analysis System (SAS) acquires and analyzes, in real-time, the Space Shuttle onboard electrocardiograph (EKG) experiment signals, calculates the heartrate, and applies a Fast Fourier Transformation (FFT) to the heart rate. The system also calculates other statistical parameters such as the 'mean heart rate' over specific time period and heart rate histogram. This SAS is used by NASA Principal Investigators as a research tool to determine the effects of weightlessness on the human cardiovascular system. This is also used to determine if Lower Body Negative Pressure (LBNP) is an effective countermeasure to the orthostatic intolerance experienced by astronauts upon return to normal gravity. In microgravity, astronauts perform the LBNP experiment in the mid deck of the Space Shuttle. The experiment data are downlinked by the orbiter telemetry system, then processed and analyzed in real-time by the integrated Life Sciences Data Acquisition (LSDS) - Spectral Analysis System. The data system is integrated within the framework of two different computer systems, VAX and Macintosh (Mac), using the networking infrastructure to assist the investigators in further understanding the most complex machine on Earth--the human body.

Rahman, Hasan H.↗

Wide-bandwidth high-resolution search for extraterrestrial intelligence

Research accomplished during the third 6-month period is summarized. Research covered the following: dual-horn antenna performance; high electron mobility transistors (HEMT) low-noise amplifiers; downconverters; fast Fourier transform (FFT) array; and backend 'feature recognizer' array.

Horowitz, Paul↗

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

Fast Fourier transformation results from gamma-ray burst profiles

Several gamma-ray bursts in the BATSE data have sufficiently long durations and complex temporal structures with pulses that appear to be spaced quasi-periodically. In order to test and quantify these periods we have applied fast Fourier transformations (FFT) to all these events. We have also performed cross spectral analyses of the FFT of the two extreme (high-low) energy bands in each case to determine the lead/lag of the pulses in different energies.

Kouveliotou, Chryssa↗

Advanced transponders for deep space applications

Three architectures for advanced deep space transponders are proposed. The architectures possess various digital techniques such as fast Fourier transform (FFT), digital phase-locked loop (PLL), and digital sideband aided carrier detection with analog or digital turn-around ranging. Preliminary results on the design and conceptual implementation are presented. Modifications to the command detector unit (CDU) are also presented.

Nguyen, Tien M.↗

Design for testability and diagnosis at the system-level

The growing complexity of full-scale systems has surpassed the capabilities of most simulation software to provide detailed models or gate-level failure analyses. The process of system-level diagnosis approaches the fault-isolation problem in a manner that differs significantly from the traditional and exhaustive failure mode search. System-level diagnosis is based on a functional representation of the system. For example, one can exercise one portion of a radar algorithm (the Fast Fourier Transform (FFT) function) by injecting several standard input patterns and comparing the results to standardized output results. An anomalous output would point to one of several items (including the FFT circuit) without specifying the gate or failure mode. For system-level repair, identifying an anomalous chip is sufficient. We describe here an information theoretic and dependency modeling approach that discards much of the detailed physical knowledge about the system and analyzes its information flow and functional interrelationships. The approach relies on group and flow associations and, as such, is hierarchical. Its hierarchical nature allows the approach to be applicable to any level of complexity and to any repair level. This approach has been incorporated in a product called STAMP (System Testability and Maintenance Program) which was developed and refined through more than 10 years of field-level applications to complex system diagnosis. The results have been outstanding, even spectacular in some cases. In this paper we describe system-level testability, system-level diagnoses, and the STAMP analysis approach, as well as a few STAMP applications.

Simpson, William R.↗

Parallel spatial direct numerical simulations on the Intel iPSC/860 hypercube

The implementation and performance of a parallel spatial direct numerical simulation (PSDNS) approach on the Intel iPSC/860 hypercube is documented. The direct numerical simulation approach is used to compute spatially evolving disturbances associated with the laminar-to-turbulent transition in boundary-layer flows. The feasibility of using the PSDNS on the hypercube to perform transition studies is examined. The results indicate that the direct numerical simulation approach can effectively be parallelized on a distributed-memory parallel machine. By increasing the number of processors nearly ideal linear speedups are achieved with nonoptimized routines; slower than linear speedups are achieved with optimized (machine dependent library) routines. This slower than linear speedup results because the Fast Fourier Transform (FFT) routine dominates the computational cost and because the routine indicates less than ideal speedups. However with the machine-dependent routines the total computational cost decreases by a factor of 4 to 5 compared with standard FORTRAN routines. The computational cost increases linearly with spanwise wall-normal and streamwise grid refinements. The hypercube with 32 processors was estimated to require approximately twice the amount of Cray supercomputer single processor time to complete a comparable simulation; however it is estimated that a subgrid-scale model which reduces the required number of grid points and becomes a large-eddy simulation (PSLES) would reduce the computational cost and memory requirements by a factor of 10 over the PSDNS. This PSLES implementation would enable transition simulations on the hypercube at a reasonable computational cost.

Joslin, Ronald D.↗

Application of an improved Nelson-Nguyen analysis to eccentric, arbitrary profile liquid annular seals

An improved dynamic analysis for liquid annular seals with arbitrary profile based on a method, first proposed by Nelson and Nguyen, is presented. An improved first order solution that incorporates a continuous interpolation of perturbed quantities in the circumferential direction, is presented. The original method uses an approximation scheme for circumferential gradients, based on Fast Fourier Transforms (FFT). A simpler scheme based on cubic splines is found to be computationally more efficient with better convergence at higher eccentricities. A new approach of computing dynamic coefficients based on external specified load is introduced. This improved analysis is extended to account for arbitrarily varying seal profile in both axial and circumferential directions. An example case of an elliptical seal with varying degrees of axial curvature is analyzed. A case study based on actual operating clearances of an interstage seal of the Space Shuttle Main Engine High Pressure Oxygen Turbopump is presented.

Padavala, Satyasrinivas↗

In-flight estimation of gyro noise on the Upper Atmosphere Research Satellite (UARS) and Extreme Ultraviolet Explorer (EUVE) missions

This paper characterizes the low-frequency noise response of the Teledyne dry rotor inertial reference unit (DRIRU) gyroscopes on the Upper Atmosphere Research Satellite (UARS) and the Extreme Ultraviolet Explorer (EUVE). The accuracy of spacecraft attitude estimation algorithms that use gyro data for propagating the spacecraft attitude is sensitive to gyro noise. EUVE gyro data were processed to validate a single-axis gyro noise model, which is used onboard various spacecraft. The paper addresses the potential impact of temperature effects on the gyro noise model and the overall impact on attitude determination accuracy. The power spectral density (PSD) of the gyro noise is estimated from UARS in-flight data by Fast Fourier Transform (FFT). The role of actuator dynamics on the PSD function is also discussed.

Lee, M.↗

Feasibility study, software design, layout and simulation of a two-dimensional Fast Fourier Transform machine for use in optical array interferometry

The goal of this project was the feasibility study of a particular architecture of a digital signal processing machine operating in real time which could do in a pipeline fashion the computation of the fast Fourier transform (FFT) of a time-domain sampled complex digital data stream. The particular architecture makes use of simple identical processors (called inner product processors) in a linear organization called a systolic array. Through computer simulation the new architecture to compute the FFT with systolic arrays was proved to be viable, and computed the FFT correctly and with the predicted particulars of operation. Integrated circuits to compute the operations expected of the vital node of the systolic architecture were proven feasible, and even with a 2 micron VLSI technology can execute the required operations in the required time. Actual construction of the integrated circuits was successful in one variant (fixed point) and unsuccessful in the other (floating point).

Boriakoff, Valentin↗

Investigation of Allan variance for determining noise spectral forms with application to microwave radiometry

An investigation of the Allan variance method as a possible means for characterizing fluctuations in radiometric noise diodes has been performed. The goal is to separate fluctuation components into white noise, flicker noise, and random-walk noise. The primary means is by discrete-time processing, and the study focused primarily on the digital processes involved. Noise satisfying the requirements was generated by direct convolution, fast Fourier transformation (FFT) processing in the time domain, and FFT processing in the frequency domain. Some of the numerous results obtained are presented along with the programs used in the study.

Stanley, William D.↗

An algorithm for extraction of periodic signals from sparse, irregularly sampled data

Temporal gaps in discrete sampling sequences produce spurious Fourier components at the intermodulation frequencies of an oscillatory signal and the temporal gaps, thus significantly complicating spectral analysis of such sparsely sampled data. A new fast Fourier transform (FFT)-based algorithm has been developed, suitable for spectral analysis of sparsely sampled data with a relatively small number of oscillatory components buried in background noise. The algorithm's principal idea has its origin in the so-called 'clean' algorithm used to sharpen images of scenes corrupted by atmospheric and sensor aperture effects. It identifies as the signal's 'true' frequency that oscillatory component which, when passed through the same sampling sequence as the original data, produces a Fourier image that is the best match to the original Fourier space. The algorithm has generally met with succession trials with simulated data with a low signal-to-noise ratio, including those of a type similar to hourly residuals for Earth orientation parameters extracted from VLBI data. For eight oscillatory components in the diurnal and semidiurnal bands, all components with an amplitude-noise ratio greater than 0.2 were successfully extracted for all sequences and duty cycles (greater than 0.1) tested; the amplitude-noise ratios of the extracted signals were as low as 0.05 for high duty cycles and long sampling sequences. When, in addition to these high frequencies, strong low-frequency components are present in the data, the low-frequency components are generally eliminated first, by employing a version of the algorithm that searches for non-integer multiples of the discrete FET minimum frequency.

Wilcox, J. Z.↗