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 361 records · Page 20

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

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

Laboratory for Engineering Man/Machine Systems (LEMS): System identification, model reduction and deconvolution filtering using Fourier based modulating signals and high order statistics

Several important problems in the fields of signal processing and model identification, such as system structure identification, frequency response determination, high order model reduction, high resolution frequency analysis, deconvolution filtering, and etc. Each of these topics involves a wide range of applications and has received considerable attention. Using the Fourier based sinusoidal modulating signals, it is shown that a discrete autoregressive model can be constructed for the least squares identification of continuous systems. Some identification algorithms are presented for both SISO and MIMO systems frequency response determination using only transient data. Also, several new schemes for model reduction were developed. Based upon the complex sinusoidal modulating signals, a parametric least squares algorithm for high resolution frequency estimation is proposed. Numerical examples show that the proposed algorithm gives better performance than the usual. Also, the problem was studied of deconvolution and parameter identification of a general noncausal nonminimum phase ARMA system driven by non-Gaussian stationary random processes. Algorithms are introduced for inverse cumulant estimation, both in the frequency domain via the FFT algorithms and in the domain via the least squares algorithm.

Pan, Jianqiang↗

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↗

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

Preliminary results of a balloon flight of the solar disk sextant

Preliminary results of a balloon flight on October 11, 1991, of the solar disk sextant (SDS) experiment are reported. The SDS is an instrument which measures the solar diameter at different orientations with respect to the solar polar axis. Fitting straight lines through two fixed-angle data sets with time as the independent variable yields slopes of (7.1 +/ - 1.5) x 10 exp -3 and (6.7 +/- 1.6) x 10 exp -3/mas s, consistent with the value of 6.47 x 10 exp -3/mas s expected from the earth's approach to the sun due to the orbital motion toward perihelion. Upon the instrument's rotation on its axis a sinusoidal component of the diameter measurement was observed in each rotation cycle, with a variable amplitude of about 150 mas. The present result is epsilon of (5.6 +/- 6.3) x 10 exp -6, about 30 deg offset from the polar-equator position. The absolute diameter obtained by means of the FFT definition is found to be 1919.269 +/- 0.240 arcsec or 1919.131 +/- 0.240 arcsec, depending on the orientation mode of the measurement.

Maier, E.↗

A VLSI architecture for simplified arithmetic Fourier transform algorithm

The arithmetic Fourier transform (AFT) is a number-theoretic approach to Fourier analysis which has been shown to perform competitively with the classical FFT in terms of accuracy, complexity, and speed. Theorems developed in a previous paper for the AFT algorithm are used here to derive the original AFT algorithm which Bruns found in 1903. This is shown to yield an algorithm of less complexity and of improved performance over certain recent AFT algorithms. A VLSI architecture is suggested for this simplified AFT algorithm. This architecture uses a butterfly structure which reduces the number of additions by 25 percent of that used in the direct method.

Reed, Irving S.↗

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↗

Issues related to waveform computations for radar altimeter applications

An algorithm has been developed to model the average return power waveforms available from general radar altimeter systems, such as the Multimode Airborne Radar Altimeter (MARA) system operated at NASA Goddard Space Flight Center - Wallops Flight Facility. The algorithm is based on a convolutional model comprised of three functions: the average flat surface impulse response (FSIR), the radar system point target response (PTR), and the height pdf of the specular points on the sea surface. The FSIR is modified to account for the asymmetric antenna beam used by the MARA system, and then certain properties of this modified SIR are exploited to obtain closed-form expressions that can be rapidly evaluated. An FFT convolution routine is used to further speed up the computations. The result is an algorithm that can be used to study the effects of pointing errors in surface measurements.

Newkirk, Michael H.↗

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

STS-33 Emergency Egress Training

The STS-33 crew is shown donning flight survival gear, then entering the CCT for bailout exercises. After completion of the exercises in the CCT, the bailout procedures are practiced in the FFT.

Source record↗

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

A comparative study of an ABC and an artificial absorber for truncating finite element meshes

The type of mesh termination used in the context of finite element formulations plays a major role on the efficiency and accuracy of the field solution. The performance of an absorbing boundary condition (ABC) and an artificial absorber (a new concept) for terminating the finite element mesh was evaluated. This analysis is done in connection with the problem of scattering by a finite slot array in a thick ground plane. The two approximate mesh truncation schemes are compared with the exact finite element-boundary integral (FEM-BI) method in terms of accuracy and efficiency. It is demonstrated that both approximate truncation schemes yield reasonably accurate results even when the mesh is extended only 0.3 wavelengths away from the array aperture. However, the artificial absorber termination method leads to a substantially more efficient solution. Moreover, it is shown that the FEM-BI method remains quite competitive with the FEM-artificial absorber method when the FFT is used for computing the matrix-vector products in the iterative solution algorithm. These conclusions are indeed surprising and of major importance in electromagnetic simulations based on the finite element method.

Oezdemir, T.↗

A theoretical and numerical study of polarimetric scattering and emission from random rough surfaces with anisotropic directional spectrum

In this paper, theoretical and numerical results of the polarimetric scattering and emission from random rough surfaces with anisotropic directional spectrum are presented for the remote sensing of ocean and soil surfaces. The polarimetric scattered field for rough dielectric surfaces is derived to the second order by the small perturbation method (SPM). It is found that the second-order scattered field is coherent in nature, and its coefficients for different polarizations present the lowest-order corrections to the Fresnel reflection coefficients of the surfaces. In addition, the cross-polarized (HV and VH) components of the coherent fields are reciprocal and not zero for surfaces with anisotropic directional spectrum when the azimuth angle of the incident direction is not aligned with the symmetry directions of surfaces. In order to verify the energy conservation condition of the theoretical results, which is important if the theory is to be applied to the passive polarimetry of rough surfaces, a Monte Carlo simulation is performed to numerically calculate the polarimetric reflectivities of one-dimensional random rough surfaces which are generated with a prescribed power-law spectrum in the spectral domain and transformed to the spatial domain by the FFT. The surfaces simulated by this approach are periodic with the period corresponding to the low-wavenumber cutoff. To calculate the scattering from periodic dielectric surfaces, the authors present a new numerical technique which applies the Floquet theorem to reduce the problem to one period and does not require the evaluation of one-dimensional periodic Green's function used in the conventional method of moment formulation. Once the scattering coefficients are obtained, the polarimetric Stokes vectors for the emission from the random surfaces are then calculated according to the Kirchhoff's law and are illustrated as functions of relative azimuth observation and row directions. The second-order SPM is also reduced to this one-dimensional case, and theoretical results for all four Stokes parameters are in excellent agreement with the numerical results obtained from the Monte Carlo simulation. Moreover, the second order coherent fields are found to be necessary for the theoretical evaluation of the third and fourth Stokes parameters. Without that, the reflectivities of random rough surfaces are significantly over-estimated, and the signs of the third and the fourth Stokes parameters are found to be incorrect, if calculated by using the first-order incoherent fields alone.

Yueh, S. H.↗

A low-cost vector processor boosting compute-intensive image processing operations

Low-cost vector processing (VP) is within reach of everyone seriously engaged in scientific computing. The advent of affordable add-on VP-boards for standard workstations complemented by mathematical/statistical libraries is beginning to impact compute-intensive tasks such as image processing. A case in point in the restoration of distorted images from the Hubble Space Telescope. A low-cost implementation is presented of the standard Tarasko-Richardson-Lucy restoration algorithm on an Intel i860-based VP-board which is seamlessly interfaced to a commercial, interactive image processing system. First experience is reported (including some benchmarks for standalone FFT's) and some conclusions are drawn.

Adorf, Hans-Martin↗

A spectral boundary integral equation method for the 2-D Helmholtz equation

In this paper, we present a new numerical formulation of solving the boundary integral equations reformulated from the Helmholtz equation. The boundaries of the problems are assumed to be smooth closed contours. The solution on the boundary is treated as a periodic function, which is in turn approximated by a truncated Fourier series. A Fourier collocation method is followed in which the boundary integral equation is transformed into a system of algebraic equations. It is shown that in order to achieve spectral accuracy for the numerical formulation, the nonsmoothness of the integral kernels, associated with the Helmholtz equation, must be carefully removed. The emphasis of the paper is on investigating the essential elements of removing the nonsmoothness of the integral kernels in the spectral implementation. The present method is robust for a general boundary contour. Aspects of efficient implementation of the method using FFT are also discussed. A numerical example of wave scattering is given in which the exponential accuracy of the present numerical method is demonstrated.

Hu, Fang Q.↗

An efficient three-dimensional Poisson solver for SIMD high-performance-computing architectures

We present an algorithm that solves the three-dimensional Poisson equation on a cylindrical grid. The technique uses a finite-difference scheme with operator splitting. This splitting maps the banded structure of the operator matrix into a two-dimensional set of tridiagonal matrices, which are then solved in parallel. Our algorithm couples FFT techniques with the well-known ADI (Alternating Direction Implicit) method for solving Elliptic PDE's, and the implementation is extremely well suited for a massively parallel environment like the SIMD architecture of the MasPar MP-1. Due to the highly recursive nature of our problem, we believe that our method is highly efficient, as it avoids excessive interprocessor communication.

Cohl, H.↗