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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Experimental and analytical evaluation of dynamic load vibration of a 2240-kW (3000-hp) rotorcraft transmission

A dynamic analysis of a 2240-kW (3000-hp) helicopter planetary system is presented. Results from both analytical and experimental studies show good correlation in gear-tooth loads. A parametric study indicates that the mesh damping ratio has a significant effect on maximum gear tooth load, stress, and vibration. Correlation with experimental results indicates that the Sun-planet mesh damping ratio can significantly differ from the planet ring mesh damping ratio. A numerical fast Fourier transform (FFT) procedure was applied to examine the mesh load components in the frequency domain and the magnitudes of multiple tooth pass frequencies excited by nonsynchronous meshing of the planets. Effects of tooth-spacing errors and tooth-profile modifications with tip relief are examined. A general discussion of results and correlation with the experimental study are also presented.

Choy, Fred K.↗
NASA NTRS1990

Spread-spectrum code acquisition in the presence of Doppler shift and data modulation

A spread-spectrum code acquisition technique for a direct-sequence (DS) system in the presence of Doppler effect and data modulation is investigated. Both the carrier-frequency offset and code-frequency offset due to severe Doppler effect are considered. The code-chip slipping during the correlation process caused by code-frequency offset can degrade the acquisition performance significantly. However, this issue can be alleviated by compensating code-frequency offset in an appropriate manner. Results are presented for the cases with and without data modulation. Coherent detection is considered when there is no data modulation. If data modulation is present, the authors partition the correlation time into subintervals and the integration results in these subintervals are square-law noncoherently combined for detection. The implementation of this code acquisition technique using the fast Fourier transform (FFT) algorithm is described. The use of theoretical results to estimate the hardware complexity of an actual system is illustrated step by step, showing that implementation is feasible with existing technology. The tradeoff between hardware complexity and acquisition performance is discussed.

Cheng, Unjeng↗
NASA NTRS1990

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

The NASA-Cornell Univ.-Worcester Polytechnic Institute Fast Fourier Transform (FFT) chip based on the architecture of the systolic FFT computation as presented by Boriakoff is implemented into an operating device design. The kernel of the system, a systolic inner product floating point processor, was designed to be assembled into a systolic network that would take incoming data streams in pipeline fashion and provide an FFT output at the same rate, word by word. It was thoroughly simulated for proper operation, and it has passed a comprehensive set of tests showing no operational errors. The black box specifications of the chip, which conform to the initial requirements of the design as specified by NASA, are given. The five subcells are described and their high level function description, logic diagrams, and simulation results are presented. Some modification of the Read Only Memory (ROM) design were made, since some errors were found in it. Because a four stage pipeline structure was used, simulating such a structure is more difficult than an ordinary structure. Simulation methods are discussed. Chip signal protocols and chip pinout are explained.

Boriakoff, Valentin↗
NASA NTRS1990

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

A finite element-boundary integral method for scattering and radiation by two- and three-dimensional structures

A review of a hybrid finite element-boundary integral formulation for scattering and radiation by two- and three-dimensional composite structures is presented. In contrast to other hybrid techniques involving the finite element method, the proposed one is in principle exact and can be implemented using a low O(N) storage. This is of particular importance for large scale applications and is a characteristic of the boundary chosen to terminate the finite element mesh, usually as close to the structure as possible. A certain class of these boundaries lead to convolutional boundary integrals which can be evaluated via the fast Fourier transform (FFT) without a need to generate a matrix; thus, retaining the O(N) storage requirement. The paper begins with a general description of the method. A number of two- and three-dimensional applications are then given, including numerical computations which demonstrate the method's accuracy, efficiency, and capability.

Jin, Jian-Ming↗
NASA NTRS1991

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↗
NASA NTRS1990

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

A new technique is presented for computing the scattering by 2-D structures of arbitrary composition. The proposed solution approach combines the usual finite element method with the boundary-integral equation to formulate a discrete system. This is subsequently solved via the conjugate gradient (CG) algorithm. A particular characteristic of the method is the use of rectangular boundaries to enclose the scatterer. Several of the resulting boundary integrals are therefore convolutions and may be evaluated via the fast Fourier transform (FFT) in the implementation of the CG algorithm. The solution approach offers the principal advantage of having O(N) memory demand and employs a 1-D FFT versus a 2-D FFT as required with a traditional implementation of the CGFFT algorithm. The speed of the proposed solution method is compared with that of the traditional CGFFT algorithm, and results for rectangular bodies are given and shown to be in excellent agreement with the moment method.

Collins, Jeffery D.↗
NASA NTRS1990

Steady-state analysis of a nonlinear rotor-housing system

The periodic steady state response of a high pressure oxygen turbopump (HBOTP) of a Space Shuttle main engine (SSME), involving a clearance between the bearing and housing carrier, is sought. A harmonic balance method utilizig Fast Fourier Transform (FFT) algorithm is developed for the analysis. An impedance method is used to reduce the number of degrees of freedom to the displacements at the bearing clearance. Harmonic and subharmonic responses to imbalance for various system parameters are studied. The results show that the computational technique developed in this study is an effective and flexible method for determining the stable and unstable periodic response of complex rotor-housing systems with clearance type nonlinearity.

Noah, S. T.↗
NASA NTRS1991

A finite element-boundary integral method for scattering and radiation by two- and three-dimensional structures

A review of a hybrid finite element-boundary integral formulation for scattering and radiation by two- and three-composite structures is presented. In contrast to other hybrid techniques involving the finite element method, the proposed one is in principle exac, and can be implemented using a low O(N) storage. This is of particular importance for large scale applications and is a characteristic of the boundary chosen to terminate the finite-element mesh, usually as close to the structure as possible. A certain class of these boundaries lead to convolutional boundary integrals which can be evaluated via the fast Fourier transform (FFT) without a need to generate a matrix; thus, retaining the O(N) storage requirement.

Jin, Jian-Ming↗
NASA NTRS1990

Time-dependent treatment of scattering - Integral equation approaches using the time-dependent amplitude density

The time-dependent form of the Lippmann-Schwinger integral equation is used as the basis of several new wave packet propagation schemes. These can be formulated in terms of either the time-dependent wave function or a time-dependent amplitude density. The latter is nonzero only in the region of configuratiaon space for which the potential is nonzero, thereby in principle obviating the necessity of large grids or the use of complex absorbing potentials when resonances cause long collision times (leading, consequently, to long propagation times). Transition amplitudes are obtained in terms of Fourier transforms of the amplitude density from the time to the energy domain. The approach is illustrated by an application to a standard potential scattering model problem where, as in previous studies, the action of the kinetic energy operator is evaluated by fast Fourier transform (FFT) techniques.

Hoffman, David K.↗
NASA NTRS1992

Open-Loop Acquisition Of Suppressed Carrier Signals

Three digital techniques for open-loop acquisition of suppressed carrier signals in presence of binary-phase-shift-keyed (BPSK) modulation representing non-return-to-zero (NRZ) data symbols. Based on assumption that offset, tau, between timing of symbols and clock in receiver unknown, but fixed fraction of symbol period, T. In all three, fast Fourier transforms (FFT's) performed on outputs of integrate-and-dump filters that are parts of Costas-type loops used to demodulate BPSK signals. Timing of integrate-and-dump filters constant. Outputs mixed to obtain an error signal.

Shah, Biren N.↗
NASA NTRS1989

Totally parallel multilevel algorithms for sparse elliptic systems

The fastest known algorithms for the solution of a large elliptic boundary value problem on a massively parallel hypercube all require O(log(n)) floating point operations and O(log(n)) distance-1 communications, if massively parallel is defined to mean a number of processors proportional to the size n of the problem. The Totally Parallel Multilevel Algorithm (TPMA) that has, as special cases, four of these fast algorithms is described. These four algorithms are Parallel Superconvergent Multigrid (PSMG), Robust Multigrid, the Fast Fourier Transformation (FFT) based Spectral Algorithm, and Parallel Cyclic Reduction. The algorithm TPMA, when described recursively, has four steps: (1) project to a collection of interlaced, coarser problems at the next lower level; (2) apply TPMA, recursively, to each of these lower level problems, solving directly at the lowest level; (3) interpolate these approximate solutions to the finer grid, and to verage them to form an approximate solution on this grid; and (4) refine this approximate solution with a defect-correction step, using a local approximate inverse. Choice of the projection operator (P), the interpolation operator (Q), and the smoother (S) determines the class of problems on which TPMA is most effective. There are special cases in which the first three steps produce an exact solution, and the smoother is not needed (e.g., constant coefficient operators).

Frederickson, Paul O.↗
NASA NTRS1989

Efficient detection of a CW signal with a linear frequency drift

An efficient method is presented for the detection of a continuous wave (CW) signal with a frequency drift that is linear in time. Signals of this type occur in transmissions between any two locations that are accelerating relative to one another, e.g., transmissions from the Voyager spacecraft. We assume that both the frequency and the drift are unknown. We also assume that the signal is weak compared to the Gaussian noise. The signal is partitioned into subsequences whose discrete Fourier transforms provide a sequence of instantaneous spectra at equal time intervals. These spectra are then accumulated with a shift that is proportional to time. When the shift is equal to the frequency drift, the signal to noise ratio increases and detection occurs. Here, we show how to compute these accumulations for many shifts in an efficient manner using a variety of Fast Fourier Transformations (FFT). Computing time is proportional to L log L where L is the length of the time series.

Swarztrauber, Paul N.↗
NASA NTRS1989

Ordered fast fourier transforms on a massively parallel hypercube multiprocessor

Design alternatives for ordered Fast Fourier Transformation (FFT) algorithms were examined on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication which is known to dominate the overall computing time. To this end, the order and computational phases of the FFT were combined, and the sequence to processor maps that reduce communication were used. The class of ordered transforms is expanded to include any FFT in which the order of the transform is the same as that of the input sequence. Two such orderings are examined, namely, standard-order and A-order which can be implemented with equal ease on the Connection Machine where orderings are determined by geometries and priorities. If the sequence has N = 2 exp r elements and the hypercube has P = 2 exp d processors, then a standard-order FFT can be implemented with d + r/2 + 1 parallel transmissions. An A-order sequence can be transformed with 2d - r/2 parallel transmissions which is r - d + 1 fewer than the standard order. A parallel method for computing the trigonometric coefficients is presented that does not use trigonometric functions or interprocessor communication. A performance of 0.9 GFLOPS was obtained for an A-order transform on the Connection Machine.

Tong, Charles↗
NASA NTRS1991

NASA SETI microwave observing project: Sky Survey element

The SETI Sky Survey Observing Program is one of two complimentary strategies that NASA plans to use in its microwave Search for Extraterrestrial Intelligence (SETI). The primary objective of the sky survey is to search the entire sky over the frequency range of 1.0 to 10.0 GHz for evidence of narrow band signals of extraterrestrial intelligent origin. Frequency resolutions of 30 Hz or narrower will be used across the entire band. Spectrum analyzers with upwards of ten million channels are required to keep the survey time approximately 6 years. Data rates in excess of 10 megabits per second will be generated in the data taking process. Sophisticated data processing techniques will be required to determine the ever changing receiver baselines, and to detect and archive potential SETI signals. Existing radio telescopes, including several of NASA's Deep Space Network (DSN) 34 meter antennas located at Goldstone, CA and Tidbinbilla, Australia will be used for the observations. The JPL has the primary responsibility to develop and carry out the sky survey. In order to lay the foundation for the full scale SETI Sky Survey, a prototype system is being developed at the JPL. The system will be installed at the new 34-m high efficiency antenna at the Deep Space Station (DSS) 13 research and development station, Goldstone, CA, where it will be used to initiate the observational phase of the NASA SETI Sky Survey. It is anticipated that the early observations will be useful to test signal detection algorithms, scan strategies, and radio frequency interference rejection schemes. The SETI specific elements of the prototype system are: (1) the Wide Band Spectrum Analyzer (WBSA); a 2-million channel fast Fourier transformation (FFT) spectrum analyzer which covers an instantaneous bandpass of 40 MHz; (2) the signal detection processor; and (3) the SETI Sky Survey Manager, a network-based C-language environment that provides observatory control, performs data acquisition and analysis algorithms. A high level description of the prototype hardware and software systems will be given and the current status of the system development will be reported.

Klein, M. J.↗
NASA NTRS1991

A reconfigurable multicarrier demodulator architecture

An architecture based on parallel and pipline design approaches has been developed for the Frequency Division Multiple Access/Time Domain Multiplexed (FDMA/TDM) conversion system. The architecture has two main modules namely the transmultiplexer and the demodulator. The transmultiplexer has two pipelined modules. These are the shared multiplexed polyphase filter and the Fast Fourier Transform (FFT). The demodulator consists of carrier, clock, and data recovery modules which are interactive. Progress on the design of the MultiCarrier Demodulator (MCD) using commercially available chips and Application Specific Integrated Circuits (ASIC) and simulation studies using Viewlogic software will be presented at the conference.

Kwatra, S. C.↗
NASA NTRS1991

Design, modeling, and analysis of multi-channel demultiplexer/demodulator

Traditionally, satellites have performed the function of a simple repeater. Newer data distribution satellite architectures, however, require demodulation of many frequency division multiplexed uplink channels by a single demultiplexer/demodulator unit, baseband processing and routing of individual voice/data circuits, and remodulation into time division multiplexed (TDM) downlink carriers. The TRW MCDD (Multichannel Demultiplexer/Multirate Demodulator) operates on a 37.4 MHz composite input signal. Individual channel data rates are either 64 Kbps or 2.048 Mbps. The wideband demultiplexer divides the input signal into 1.44 MHz segments containing either a single 2.048 Mbps channel or thirty two 64 Kbps channels. In the latter case, the narrowband demultiplexer further divides the single 1.44 MHz wideband channel into thirty two 45 KHz narrowband channels. With this approach the time domain Fast Fourier Transformation (FFT) channelizer processing capacity is matched well to the bandwidth and number of channels to be demultiplexed. By using a multirate demodulator fewer demodulators are required while achieving greater flexibility. Each demodulator can process a wideband channel or thirty two narrowband channels. Either all wideband channels, a mixture of wideband and narrowband channels, or all narrowband channels can be demodulated. The multirate demodulator approach also has lower nonrecurring costs since only one design and development effort is needed. TRW has developed a proof of concept (POC) model which fully demonstrates the signal processing fuctions of MCDD. It is capable of processing either three 2.048 Mbps channels or two 2.048 Mbps channels and thirty two 64 Kbps channels. An overview of important MCDD system engineering issues is presented as well as discussion on some of the Block Oriented System Simulation analyses performed for design verification and selection of operational parameters of the POC model. Systems engineering analysis of the POC model confirmed that the MCDD concepts are not only achievable but also balance the joint goals of minimizing on-board complexity and cost of ground equipment, while retaining the flexibility needed to meet a wide range of system requirements.

Lee, David D.↗
NASA NTRS1991

Comparison of different fractal dimension measuring algorithms for RE-TM M-O films

Noise in magneto-optical recording devices is discussed. In general, it appears that either the divider technique or amplitude spectrum technique may be used interchangeably to measure the fractal dimension (D) in the domain wall structure of ideal images. However, some caveats must be observed for best results. The divider technique is attractive for its simplicity and relatively modest computation requirements. However, it is sensitive to noise, in that noise pixels that touch the domain boundary are interpreted as being part of the boundary, skewing the measurement. Also, it is not useful in measuring nucleation-dominated films or domains that have significant amounts of structure within the interior of the domain wall. The amplitude spectrum method is more complex, and less intuitive than the divider method, and somewhat more expensive to implement computationally. However, since the camera noise tends to be white, the noise can be avoided in the measurement of D by avoiding that portion of the curve that is flat (due to the white noise) when the least squares line is fit to the plot. Also, many image processing software packages include a Fast Fourier Transformation (FFT) facility, while the user will most likely have to write his own edge extraction routine for the divider method. The amplitude spectrum method is a true two dimensional technique that probes the interior of the domain wall, and in fact, can measure arbitrary clusters of domains. It can also be used to measure grey-level images, further reducing processing steps needed to threshold the image.

Bernacki, Bruce E.↗