Performance Comparison Between Adaptive Line Enhancer and FFT for Fast Carrier Acquisition
FFT is a well known technique for frequency estimation. Similarly, adaptive line enhancer can.
Adaptive Line Enhancer FFT↗
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.
Organizing a special purpose computer using the FFT to perform speech analysis in real time
Design of special purpose computer using FFT to perform speech analysis in real time
Source record↗
Simulation of multicorrelated random processes using the FFT algorithm
A technique for the digital simulation of multicorrelated Gaussian random processes is described. This technique is based upon generating discrete frequency functions which correspond to the Fourier transform of the desired random processes, and then using the fast Fourier transform (FFT) algorithm to obtain the actual random processes. The main advantage of this method of simulation over other methods is computation time; it appears to be more than an order of magnitude faster than present methods of simulation. One of the main uses of multicorrelated simulated random processes is in solving nonlinear random vibration problems by numerical integration of the governing differential equations. The response of a nonlinear string to a distributed noise input is presented as an example.
Wittig, L. E.↗
Biplex, pipelined FFT
A method of implementing a pipelined fast Fourier transform (FFT) is presented that makes full use of the elements that comprise it. For a given bandwidth and spectral resolution, this approach requires 25 percent less memory, and needs only half the logic speed required for the conventional implementation. Since the spectrum is broken into two parts, two analog-to-digital converters, and attendant mixer-filters, are needed. These two input elements need only operate at half the speed of the one they replaced.
Emerson, R. F.↗
Microprocessor implementation of an FFT for ionospheric VLF observations
A fast Fourier transform algorithm is implemented on a CMOS microprocessor for application to very low-frequency electric fields (less than 10 kHz) sensed on high-altitude scientific balloons. Two FFT's are calculated simultaneously by associating them with conjugate symmetric and conjugate antisymmetric results. One goal of the system was to detect spectral signatures associated with fast time variations present in natural signals such as whistlers and chorus. Although a full evaluation of the system was not possible for operational reasons, a measure of the system's success has been defined and evaluated.
Elvidge, J.↗
A test of a modified algorithm for computing spherical harmonic coefficients using an FFT
The Dilts (1985) algorithm for computing the spherical harmonic expansion coefficients for a function on a sphere, on the basis of a two-dimensional FFT, is presently modified, tested, and found to eliminate problems of overflow and large storage requirements associated with the encounter of harmonic degree values greater than 16. Results from timing tests show the Dilts program to be impractical, however, for the computation of spherical harmonic expansion coefficients for large harmonic degree values.
Elowitz, Mark↗
FFT-local gravimetric geoid computation
Model computations show that changes of sampling interval introduce only 0.3 cm changes, whereas zero padding provides an improvement of more than 5 cm in the fast Fourier transformation (FFT) generated geoid. For the Global Positioning System (GPS) survey of Franklin County, Ohio, the parameters selected as a result of model computations, allow large reduction in local data requirements while still retaining the cm accuracy when tapering and padding is applied. The results are shown in tables.
Nagy, Dezso↗
A finite element conjugate gradient FFT method for scattering
An extension of a two dimensional formulation is presented for a three dimensional body of revolution. With the introduction of a Fourier expansion of the vector electric and magnetic fields, a coupled two dimensional system is generated and solved via the finite element method. An exact boundary condition is employed to terminate the mesh and the fast fourier transformation (FFT) is used to evaluate the boundary integrals for low O(n) memory demand when an iterative solution algorithm is used. By virtue of the finite element method, the algorithm is applicable to structures of arbitrary material composition. Several improvements to the two dimensional algorithm are also described. These include: (1) modifications for terminating the mesh at circular boundaries without distorting the convolutionality of the boundary integrals; (2) the development of nonproprietary mesh generation routines for two dimensional applications; (3) the development of preprocessors for interfacing SDRC IDEAS with the main algorithm; and (4) the development of post-processing algorithms based on the public domain package GRAFIC to generate two and three dimensional gray level and color field maps.
Collins, Jeffery D.↗
Applications of the conjugate gradient FFT method in scattering and radiation including simulations with impedance boundary conditions
The theoretical and computational aspects related to the application of the Conjugate Gradient FFT (CGFFT) method in computational electromagnetics are examined. The advantages of applying the CGFFT method to a class of large scale scattering and radiation problems are outlined. The main advantages of the method stem from its iterative nature which eliminates a need to form the system matrix (thus reducing the computer memory allocation requirements) and guarantees convergence to the true solution in a finite number of steps. Results are presented for various radiators and scatterers including thin cylindrical dipole antennas, thin conductive and resistive strips and plates, as well as dielectric cylinders. Solutions of integral equations derived on the basis of generalized impedance boundary conditions (GIBC) are also examined. The boundary conditions can be used to replace the profile of a material coating by an impedance sheet or insert, thus, eliminating the need to introduce unknown polarization currents within the volume of the layer. A general full wave analysis of 2-D and 3-D rectangular grooves and cavities is presented which will also serve as a reference for future work.
Barkeshli, Kasra↗
Real-Time, Polyphase-FFT, 640-MHz Spectrum Analyzer
Real-time polyphase-fast-Fourier-transform, polyphase-FFT, spectrum analyzer designed to aid in detection of multigigahertz radio signals in two 320-MHz-wide polarization channels. Spectrum analyzer divides total spectrum of 640 MHz into 33,554,432 frequency channels of about 20 Hz each. Size and cost of polyphase-coefficient memory substantially reduced and much of processing loss of windowed FFTs eliminated.
Zimmerman, George A.↗
STS-29 EVA Prep in FFT
Astronauts Blaha, Springer, and Bagian are shown donning suits in the FFT. Blaha runs through checklists while the other two suit up in the airlock.
Source record↗
STS-33 EVA Prep and Post with Gregory, Blaha, Carter, Thorton, and Musgrave in FFT
This video shows the crew in the airlock of the FFT, talking with technicians about the extravehicular activity (EVA) equipment. Thornton and Carter put on EVA suits and enter the airlock as the other crew members help with checklists.
Source record↗
FFT Computation with Systolic Arrays, A New Architecture
The use of the Cooley-Tukey algorithm for computing the l-d FFT lends itself to a particular matrix factorization which suggests direct implementation by linearly-connected systolic arrays. Here we present a new systolic architecture that embodies this algorithm. This implementation requires a smaller number of processors and a smaller number of memory cells than other recent implementations, as well as having all the advantages of systolic arrays. For the implementation of the decimation-in-frequency case, word-serial data input allows continuous real-time operation without the need of a serial-to-parallel conversion device. No control or data stream switching is necessary. Computer simulation of this architecture was done in the context of a 1024 point DFT with a fixed point processor, and CMOS processor implementation has started.
Boriakoff, Valentin↗
A FFT Method for the Quasiclassical Selection of Initial Ro-Vibrational States of Triatomic Molecules
This paper describes the use of an exact fast Fourier transform (FFT) method to prepare specified vibrational-rotational states of triatomic molecules. The method determines the Fourier coefficients needed to describe the coordinates and momenta of a vibrating-rotating triatomic molecule. Once the Fourier coefficients of a particular state are determined, it is possible to easily generate as many random sets of initial cartesian coordinates and momenta as desired. All the members of each set will correspond to the particular vibrational-rotational state selected. For example, in the case of the ground vibrational state of a non-rotating water molecule, the calculated actions of 100 sets of initial conditions produced actions within 0.001 h(bar) of the specified quantization values and energies within 5 cm(sup -1) of the semiclassical eigenvalue. The numerical procedure is straightforward for states in which all the fundamental frequencies are independent. However for states for which the fundamental frequencies become commensurate (resonance states), there are additional complications. In these cases it is necessary to determine a new set of "fundamental" frequencies and to modify the quantization conditions. Once these adjustments are made, good results are obtained for resonance states. The major problems are in labelling the large number of Fourier coefficients and the presence of regions of chaotic motion. Results are presented for the vibrational states of H2O and HCN and the ro-vibrational states of H2O.
Eaker, Charles W.↗
Application for a non-uniform FFT to spectral resampling in fourier transform spectrometry
Explore the source record for details and available documents.
non-uniform FFT fourier transform spectrometry↗
A Portable 3D FFT Package for Distributed-Memory Parallel Architectures
A parallel algorithm for 3D FFTs is implemented as a series of local 1D FFTs combined with data transposes. This allows the use of vendor supplied (often fully optimized) sequential 1D FFTs. The FFTs are carried out in-place by using an in-place data transpose across the processors.
fast Fourrier transform FFT parallel processing↗
FFT methods in signal processing of the coal interface detector radar
The FM radar for the coal interface detector, operating in the frequency band 2 to 4 GHz, is intended for the display of thicknesses between 2 cm and 20 cm. Because of such a short range, the thickness information is contained in the very few lowest spectral components of the output signal. To overcome this inconvenience, the Fourier series of the output signal was augmented to approximate a Fourier integral. This modification in the signal processing resulted in a higher spectral density, which in turn enabled an easier identification of the interface position in the laboratory. The orientation and spacing of the receiving and transmitting antennas is found to have an important influence on the system performance.
Kajfez, D.↗
Cloud cover typing from environmental satellite imagery. Discriminating cloud structure with Fast Fourier Transforms (FFT)
The use of two dimensional Fast Fourier Transforms (FFTs) subjected to pattern recognition technology for the identification and classification of low altitude stratus cloud structure from Geostationary Operational Environmental Satellite (GOES) imagery was examined. The development of a scene independent pattern recognition methodology, unconstrained by conventional cloud morphological classifications was emphasized. A technique for extracting cloud shape, direction, and size attributes from GOES visual imagery was developed. These attributes were combined with two statistical attributes (cloud mean brightness, cloud standard deviation), and interrogated using unsupervised clustering amd maximum likelihood classification techniques. Results indicate that: (1) the key cloud discrimination attributes are mean brightness, direction, shape, and minimum size; (2) cloud structure can be differentiated at given pixel scales; (3) cloud type may be identifiable at coarser scales; (4) there are positive indications of scene independence which would permit development of a cloud signature bank; (5) edge enhancement of GOES imagery does not appreciably improve cloud classification over the use of raw data; and (6) the GOES imagery must be apodized before generation of FFTs.
Logan, T. L.↗