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 415 records · Page 23

Parallel Signal Processing and System Simulation using aCe

Recently, networked and cluster computation have become very popular for both signal processing and system simulation. A new language is ideally suited for parallel signal processing applications and system simulation since it allows the programmer to explicitly express the computations that can be performed concurrently. In addition, the new C based parallel language (ace C) for architecture-adaptive programming allows programmers to implement algorithms and system simulation applications on parallel architectures by providing them with the assurance that future parallel architectures will be able to run their applications with a minimum of modification. In this paper, we will focus on some fundamental features of ace C and present a signal processing application (FFT).

Dorband, John E.↗

Statistical properties of DNA sequences

We review evidence supporting the idea that the DNA sequence in genes containing non-coding regions is correlated, and that the correlation is remarkably long range--indeed, nucleotides thousands of base pairs distant are correlated. We do not find such a long-range correlation in the coding regions of the gene. We resolve the problem of the "non-stationarity" feature of the sequence of base pairs by applying a new algorithm called detrended fluctuation analysis (DFA). We address the claim of Voss that there is no difference in the statistical properties of coding and non-coding regions of DNA by systematically applying the DFA algorithm, as well as standard FFT analysis, to every DNA sequence (33301 coding and 29453 non-coding) in the entire GenBank database. Finally, we describe briefly some recent work showing that the non-coding sequences have certain statistical features in common with natural and artificial languages. Specifically, we adapt to DNA the Zipf approach to analyzing linguistic texts. These statistical properties of non-coding sequences support the possibility that non-coding regions of DNA may carry biological information.

Non-NASA Center↗

Statistical and linguistic features of DNA sequences

We present evidence supporting the idea that the DNA sequence in genes containing noncoding regions is correlated, and that the correlation is remarkably long range--indeed, base pairs thousands of base pairs distant are correlated. We do not find such a long-range correlation in the coding regions of the gene. We resolve the problem of the "non-stationary" feature of the sequence of base pairs by applying a new algorithm called Detrended Fluctuation Analysis (DFA). We address the claim of Voss that there is no difference in the statistical properties of coding and noncoding regions of DNA by systematically applying the DFA algorithm, as well as standard FFT analysis, to all eukaryotic DNA sequences (33 301 coding and 29 453 noncoding) in the entire GenBank database. We describe a simple model to account for the presence of long-range power-law correlations which is based upon a generalization of the classic Levy walk. Finally, we describe briefly some recent work showing that the noncoding sequences have certain statistical features in common with natural languages. Specifically, we adapt to DNA the Zipf approach to analyzing linguistic texts, and the Shannon approach to quantifying the "redundancy" of a linguistic text in terms of a measurable entropy function. We suggest that noncoding regions in plants and invertebrates may display a smaller entropy and larger redundancy than coding regions, further supporting the possibility that noncoding regions of DNA may carry biological information.

Non-NASA Center↗

Control and Identification of Turbulent Boundary Layer Separation

Effective delay of turbulent boundary layer separation could be achieved via closed-loop control. Constructing such a system requires that sensor data be processed, real-time, and fed into the controller to determine the output. Current methods for detection of turbulent boundary layer separation are lacking the capability of localized, fast and reliable identification of the boundary layer state. A method is proposed for short-time FFT processing of time series, measured by hot-film sensors, with the purpose of identifying the alternation of the balance between small and large scales as the boundary layer separates, favoring the large scales. The method has been validated by comparison to other criteria of separation detection and over a range of baseline and controlled flow conditions on a simplified high-lift system, incorporating active flow control.

Seifert, Avi↗

Scalability of Parallel Spatial Direct Numerical Simulations on Intel Hypercube and IBM SP1 and SP2

The implementation and performance of a parallel spatial direct numerical simulation (PSDNS) approach on the Intel iPSC/860 hypercube and IBM SP1 and SP2 parallel computers is documented. Spatially evolving disturbances associated with the laminar-to-turbulent transition in boundary-layer flows are computed with the PSDNS code. The feasibility of using the PSDNS to perform transition studies on these computers is examined. The results indicate that PSDNS approach can effectively be parallelized on a distributed-memory parallel machine by remapping the distributed data structure during the course of the calculation. Scalability information is provided to estimate computational costs to match the actual costs relative to changes in the number of grid points. By increasing the number of processors, slower than linear speedups are achieved with optimized (machine-dependent library) routines. This slower than linear speedup results because the computational cost is dominated by FFT routine, which yields less than ideal speedups. By using appropriate compile options and optimized library routines on the SP1, the serial code achieves 52-56 M ops on a single node of the SP1 (45 percent of theoretical peak performance). The actual performance of the PSDNS code on the SP1 is evaluated with a "real world" simulation that consists of 1.7 million grid points. One time step of this simulation is calculated on eight nodes of the SP1 in the same time as required by a Cray Y/MP supercomputer. For the same simulation, 32-nodes of the SP1 and SP2 are required to reach the performance of a Cray C-90. A 32 node SP1 (SP2) configuration is 2.9 (4.6) times faster than a Cray Y/MP for this simulation, while the hypercube is roughly 2 times slower than the Y/MP for this application. KEY WORDS: Spatial direct numerical simulations; incompressible viscous flows; spectral methods; finite differences; parallel computing.

Joslin, Ronald D.↗

Implementation of a Message Passing Interface into a Cloud-Resolving Model for Massively Parallel Computing

The capability for massively parallel programming (MPP) using a message passing interface (MPI) has been implemented into a three-dimensional version of the Goddard Cumulus Ensemble (GCE) model. The design for the MPP with MPI uses the concept of maintaining similar code structure between the whole domain as well as the portions after decomposition. Hence the model follows the same integration for single and multiple tasks (CPUs). Also, it provides for minimal changes to the original code, so it is easily modified and/or managed by the model developers and users who have little knowledge of MPP. The entire model domain could be sliced into one- or two-dimensional decomposition with a halo regime, which is overlaid on partial domains. The halo regime requires that no data be fetched across tasks during the computational stage, but it must be updated before the next computational stage through data exchange via MPI. For reproducible purposes, transposing data among tasks is required for spectral transform (Fast Fourier Transform, FFT), which is used in the anelastic version of the model for solving the pressure equation. The performance of the MPI-implemented codes (i.e., the compressible and anelastic versions) was tested on three different computing platforms. The major results are: 1) both versions have speedups of about 99% up to 256 tasks but not for 512 tasks; 2) the anelastic version has better speedup and efficiency because it requires more computations than that of the compressible version; 3) equal or approximately-equal numbers of slices between the x- and y- directions provide the fastest integration due to fewer data exchanges; and 4) one-dimensional slices in the x-direction result in the slowest integration due to the need for more memory relocation for computation.

Juang, Hann-Ming Henry↗

Qualitative Features Extraction from Sensor Data using Short-time Fourier Transform

The information gathered from sensors is used to determine the health of a sensor. Once a normal mode of operation is established any deviation from the normal behavior indicates a change. This change may be due to a malfunction of the sensor(s) or the system (or process). The step-up and step-down features, as well as sensor disturbances are assumed to be exponential. An RC network is used to model the main process, which is defined by a step-up (charging), drift, and step-down (discharging). The sensor disturbances and spike are added while the system is in drift. The system runs for a period of at least three time-constants of the main process every time a process feature occurs (e.g. step change). The Short-Time Fourier Transform of the Signal is taken using the Hamming window. Three window widths are used. The DC value is removed from the windowed data prior to taking the FFT. The resulting three dimensional spectral plots provide good time frequency resolution. The results indicate distinct shapes corresponding to each process.

Amini, Abolfazl M.↗

Buoyancy Effects on Flow Structure and Instability of Low-Density Gas Jets

A low-density gas jet injected into a high-density ambient gas is known to exhibit self-excited global oscillations accompanied by large vortical structures interacting with the flow field. The primary objective of the proposed research is to study buoyancy effects on the origin and nature of the flow instability and structure in the near-field of low-density gas jets. Quantitative rainbow schlieren deflectometry, Computational fluid dynamics (CFD) and Linear stability analysis were the techniques employed to scale the buoyancy effects. The formation and evolution of vortices and scalar structure of the flow field are investigated in buoyant helium jets discharged from a vertical tube into quiescent air. Oscillations at identical frequency were observed throughout the flow field. The evolving flow structure is described by helium mole percentage contours during an oscillation cycle. Instantaneous, mean, and RMS concentration profiles are presented to describe interactions of the vortex with the jet flow. Oscillations in a narrow wake region near the jet exit are shown to spread through the jet core near the downstream location of the vortex formation. The effects of jet Richardson number on characteristics of vortex and flow field are investigated and discussed. The laminar, axisymmetric, unsteady jet flow of helium injected into air was simulated using CFD. Global oscillations were observed in the flow field. The computed oscillation frequency agreed qualitatively with the experimentally measured frequency. Contours of helium concentration, vorticity and velocity provided information about the evolution and propagation of vortices in the oscillating flow field. Buoyancy effects on the instability mode were evaluated by rainbow schlieren flow visualization and concentration measurements in the near-field of self-excited helium jets undergoing gravitational change in the microgravity environment of 2.2s drop tower at NASA John H. Glenn Research Center. The jet Reynolds number was varied from 200 to 1500 and jet Richardson number was varied from 0.72 to 0.002. Power spectra plots generated from Fast Fourier Transform (FFT) analysis of angular deflection data acquired at a temporal resolution of 1000Hz reveal substantial damping of the oscillation amplitude in microgravity at low Richardson numbers (~0.002). Quantitative concentration data in the form of spatial and temporal evolutions of the instability data in Earth gravity and microgravity reveal significant variations in the jet flow structure upon removal of buoyancy forces. Radial variation of the frequency spectra and time traces of helium concentration revealed the importance of gravitational effects in the jet shear layer region. Linear temporal and spatio-temporal stability analyses of a low-density round gas jet injected into a high-density ambient gas were performed by assuming hyper-tan mean velocity and density profiles. The flow was assumed to be non parallel. Viscous and diffusive effects were ignored. The mean flow parameters were represented as the sum of the mean value and a small normal-mode fluctuation. A second order differential equation governing the pressure disturbance amplitude was derived from the basic conservation equations. The effects of the inhomogeneous shear layer and the Froude number (signifying the effects of gravity) on the temporal and spatio-temporal results were delineated. A decrease in the density ratio (ratio of the density of the jet to the density of the ambient gas) resulted in an increase in the temporal amplification rate of the disturbances. The temporal growth rate of the disturbances increased as the Froude number was reduced. The spatio-temporal analysis performed to determine the absolute instability characteristics of the jet yield positive absolute temporal growth rates at all Fr and different axial locations. As buoyancy was removed (Fr . 8), the previously existing absolute instability disappeared at all locations establhing buoyancy as the primary instability mechanism in self-excited low-density jets.

Pasumarthi, Kasyap Sriramachandra↗

Schlieren Measurements of Buoyancy Effects on Flow Transition in Low-Density Gas Jets

The transition from laminar to turbulent flow in helium jets discharged into air was studied using Rainbow Schlieren Deflectometry technique. In particular, the effects of buoyancy on jet oscillations and flow transition length were considered. Experiments to simulate microgravity were conducted in the 2.2s drop tower at NASA Glenn Research Center. The jet Reynolds numbers varied from 800 to1200 and the jet Richardson numbers ranged between 0.01 and 0.004. Schlieren images revealed substantial variations in the flow structure during the drop. Fast Fourier Transform (FFT) analysis of the data obtained in Earth gravity experiments revealed the existence of a discrete oscillating frequency in the transition region, which matched the frequency in the upstream laminar regime. In microgravity, the transition occurred farther downstream indicating laminarization of the jet in the absence of buoyancy. The amplitude of jet oscillations was reduced by up to an order of magnitude in microgravity. Results suggest that jet oscillations were buoyancy induced and that the brief microgravity period may not be sufficient for the oscillations to completely subside.

Pasumarthi, Kasyap S.↗

On the Hilbert-Huang Transform Theoretical Developments

One of the main heritage tools used in scientific and engineering data spectrum analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). Both carry strong a-priori assumptions about the source data, such as linearity, of being stationary, and of satisfying the Dirichlet conditions. A recent development at the National Aeronautics and Space Administration (NASA) Goddard Space Flight Center (GSFC), known as the Hilbert-Huang Transform (HHT), proposes a novel approach to the solution for the nonlinear class of spectrum analysis problems. Using a-posteriori data processing based on the Empirical Mode Decomposition (EMD) sifting process (algorithm), followed by the normalized Hilbert Transform of the decomposition data, the HHT allows spectrum analysis of nonlinear and nonstationary data. The EMD sifting process results in a non-constrained decomposition of a source real value data vector into a finite set of Intrinsic Mode Functions (IMF). These functions form a near orthogonal adaptive basis, a basis that is derived from the data. The IMFs can be further analyzed for spectrum interpretation by the classical Hilbert Transform. A new engineering spectrum analysis tool using HHT has been developed at NASA GSFC, the HHT Data Processing System (HHT-DPS). As the HHT-DPS has been successfully used and commercialized, new applications post additional questions about the theoretical basis behind the HHT and EMD algorithms. Why is the fastest changing component of a composite signal being sifted out first in the EMD sifting process? Why does the EMD sifting process seemingly converge and why does it converge rapidly? Does an IMF have a distinctive structure? Why are the IMFs near orthogonal? We address these questions and develop the initial theoretical background for the HHT. This will contribute to the developments of new HHT processing options, such as real-time and 2-D processing using Field Programmable Array (FPGA) computational resources, enhanced HHT synthesis, and broaden the scope of HHT applications for signal processing.

Kizhner, Semion↗

On Certain Theoretical Developments Underlying the Hilbert-Huang Transform

One of the main traditional tools used in scientific and engineering data spectral analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). Both carry strong a-priori assumptions about the source data, such as being linear and stationary, and of satisfying the Dirichlet conditions. A recent development at the National Aeronautics and Space Administration (NASA) Goddard Space Flight Center (GSFC), known as the Hilbert-Huang Transform (HHT), proposes a novel approach to the solution for the nonlinear class of spectral analysis problems. Using a-posteriori data processing based on the Empirical Mode Decomposition (EMD) sifting process (algorithm), followed by the normalized Hilbert Transform of the decomposed data, the HHT allows spectral analysis of nonlinear and nonstationary data. The EMD sifting process results in a non-constrained decomposition of a source real-value data vector into a finite set of Intrinsic Mode Functions (IMF). These functions form a nearly orthogonal derived from the data (adaptive) basis. The IMFs can be further analyzed for spectrum content by using the classical Hilbert Transform. A new engineering spectral analysis tool using HHT has been developed at NASA GSFC, the HHT Data Processing System (HHT-DPS). As the HHT-DPS has been successfully used and commercialized, new applications pose additional questions about the theoretical basis behind the HHT and EMD algorithms. Why is the fastest changing component of a composite signal being sifted out first in the EMD sifting process? Why does the EMD sifting process seemingly converge and why does it converge rapidly? Does an IMF have a distinctive structure? Why are the IMFs nearly orthogonal? We address these questions and develop the initial theoretical background for the HHT. This will contribute to the development of new HHT processing options, such as real-time and 2-D processing using Field Programmable Gate Array (FPGA) computational resources,

Kizhner, Semion↗

The Different Wavelengths of Radio Science

Radio Science covers many different avenues. This summer I attempted to work in each of the different avenues to learn the full range of subjects covered by Radio Science. I began my summer by traveling to Greece for the 3rd International Planetary Probe Workshop (IPPW-3). I went as a co-author of the Doppler Wind Experiment (DWE) team paper. My first job when I returned from Greece was to update the Radio Science activities webpage. I then used Fast Fourier Transforms (FFT) to find radio signals in recorded Radio Science experimental data and determine frequencies and powers. I read about and ran Fortran code being used to determine wind measurements on Huygens. I formatted and revised the abstracts and data lengths for the DVD data sets. By performing these tasks, I also learned the Unix operating system as well as a small amount of shell programming.

Malecha, Jessica L.↗

Microwave Imaging and Holographic Diagnostic to Antennas in Cylindrical Near-Field Measurement

In this paper, the issues pertaining to microwave imaging and holographic diagnostic to antennas in cylindrical near-field measurements are addressed. The theoretical approach is based on expanding the work in [1] and [2] where a cylindrical wave expansion of the field on a cylindrical near-field surface is given. The sampling probe is modeled by its equivalent aperture current (idealized circular aperture) and incorporated into the near-field to far-field transformation. The method of steepest decent is applied to obtain the far-field. In its implementation, however, one could specify directly the angular spectrum at which the far-field is desired to be calculated without resorting to interpolation. The microwave imaging and holographic diagnostic is based on back projection where a plane wave expansion of the far-field is obtained. This approach necessitates the knowledge of the far-field at exact angular spectrum resulting from application of 2-D FFT. Hence, we were able to construct simply the near-field on a plane not necessarily on the aperture plane of the test antenna but also on planes perpendicular to the aperture plane [3]. And a 3-D high resolution and high precision antenna imaging of the test antenna is obtained from cylindrical near-field simulated measurements. In addition microwave holographic diagnostic of large NASA scatterometer radar antenna obtained from measured near-field on a cylindrical surface will be given if time permits.

Microwave Imaging Holographic↗

A Discussion of the Discrete Fourier Transform Execution on a Typical Desktop PC

This paper will discuss and compare the execution times of three examples of the Discrete Fourier Transform (DFT). The first two examples will demonstrate the direct implementation of the algorithm. In the first example, the Fourier coefficients are generated at the execution of the DFT. In the second example, the coefficients are generated prior to execution and the DFT coefficients are indexed at execution. The last example will demonstrate the Cooley- Tukey algorithm, better known as the Fast Fourier Transform. All examples were written in C executed on a PC using a Pentium 4 running at 1.7 Ghz. As a function of N, the total complex data size, the direct implementation DFT executes, as expected at order of N2 and the FFT executes at order of N log2 N. At N=16K, there is an increase in processing time beyond what is expected. This is not caused by implementation but is a consequence of the effect that machine architecture and memory hierarchy has on implementation. This paper will include a brief overview of digital signal processing, along with a discussion of contemporary work with discrete Fourier processing.

White, Michael J.↗

Whirl Motion of a Seal Test Rig with Squeeze-Film Dampers

This paper presents the experimental behavior and dynamic analysis of a high speed test rig with rolling element bearings mounted in squeeze film oil damper bearings. The test rotor is a double overhung configuration with rolling element ball bearings mounted in uncentered squeeze-film oil dampers. The damper design is similar to that employed with various high-speed aircraft HP gas turbines. The dynamic performance of the test rig with the originally installed dampers with an effective damper length of length 0.23-inch was unacceptable. The design speed of 40,000 RPM could not be safely achieved as nonsynchronous whirling at the overhung seal test disk and high amplitude critical speed response at the drive spline section occurred at 32,000 RPM. In addition to the self excited stability and critical speed problems, it was later seen from FFT data analysis, that a region of supersynchronous dead band whirling occurs between 10,000 to 15,000 RPM which can lead to bearing distress and wear. The system was analyzed using both linear and nonlinear techniques. The extended length damper design resulting from the analysis eliminated the rotor subsynchronous whirling, high amplitude critical speed, and the dead band whirling region allowing the system to achieve a speed of 45,000 RPM. However, nonlinear analysis shows that damper lockup could occur with high rotor unbalance at 33,000 RPM, even with the extended squeeze-film dampers. The control of damper lockup will be addressed in a future paper.

Proctor, Margaret P.↗

Plural-wavelength flame detector that discriminates between direct and reflected radiation

A flame detector employs a plurality of wavelength selective radiation detectors and a digital signal processor programmed to analyze each of the detector signals, and determine whether radiation is received directly from a small flame source that warrants generation of an alarm. The processor's algorithm employs a normalized cross-correlation analysis of the detector signals to discriminate between radiation received directly from a flame and radiation received from a reflection of a flame to insure that reflections will not trigger an alarm. In addition, the algorithm employs a Fast Fourier Transform (FFT) frequency spectrum analysis of one of the detector signals to discriminate between flames of different sizes. In a specific application, the detector incorporates two infrared (IR) detectors and one ultraviolet (UV) detector for discriminating between a directly sensed small hydrogen flame, and reflections from a large hydrogen flame. The signals generated by each of the detectors are sampled and digitized for analysis by the digital signal processor, preferably 250 times a second. A sliding time window of approximately 30 seconds of detector data is created using FIFO memories.

Hall, Gregory H.↗

Pre-Stall Behavior of a Transonic Axial Compressor Stage via Time-Accurate Numerical Simulation

CFD calculations using high-performance parallel computing were conducted to simulate the pre-stall flow of a transonic compressor stage, NASA compressor Stage 35. The simulations were run with a full-annulus grid that models the 3D, viscous, unsteady blade row interaction without the need for an artificial inlet distortion to induce stall. The simulation demonstrates the development of the rotating stall from the growth of instabilities. Pressure-rise performance and pressure traces are compared with published experimental data before the study of flow evolution prior to the rotating stall. Spatial FFT analysis of the flow indicates a rotating long-length disturbance of one rotor circumference, which is followed by a spike-type breakdown. The analysis also links the long-length wave disturbance with the initiation of the spike inception. The spike instabilities occur when the trajectory of the tip clearance flow becomes perpendicular to the axial direction. When approaching stall, the passage shock changes from a single oblique shock to a dual-shock, which distorts the perpendicular trajectory of the tip clearance vortex but shows no evidence of flow separation that may contribute to stall.

Chen, Jen-Ping↗

Aeroelastic-Acoustics Simulation of Flight Systems

This paper describes the details of a numerical finite element (FE) based analysis procedure and a resulting code for the simulation of the acoustics phenomenon arising from aeroelastic interactions. Both CFD and structural simulations are based on FE discretization employing unstructured grids. The sound pressure level (SPL) on structural surfaces is calculated from the root mean square (RMS) of the unsteady pressure and the acoustic wave frequencies are computed from a fast Fourier transform (FFT) of the unsteady pressure distribution as a function of time. The resulting tool proves to be unique as it is designed to analyze complex practical problems, involving large scale computations, in a routine fashion.

Gupta, kajal K.↗