Search NASA⌕ Search

SEARCH · Search NASA

Results for “Fast Fourier transform”

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 235 records · Page 13

Thermal Stability of Quasi-1D NbS 3 Nanoribbons and Their Transformation to 2D NbS 2 : Insights from in Situ Electron Microscopy and Spectroscopy

Here in situ electron microscopy imaging and spectroscopy enabled us to study the evolution of quasi-1D NbS 3 -IV nanoribbons with respect to morphology and chemical structure at temperatures between room temperature and 1000 °C. Scanning transmission electron microscopy (STEM) experiments included imaging in the secondary electron, (transmitted) bright field, and high-angle annular dark-field modes while operating in the low kV regime. The results showed that NbS 3 -IV samples transform dramatically from smooth nanoribbons into highly textured configurations featuring polyhedral divots and steps. Similar in situ heating experiments conducted with aberration-corrected STEM revealed that bilayers of NbS 3 -IV chains convert topotactically into aligned 2H-NbS 2 sheets upon loss of sulfur. Atomic resolution imaging, fast Fourier transform analysis, and electron energy loss spectroscopy confirmed these chemical changes, from which we propose an atomistic mechanism for the NbS 3 -IV → 2H-NbS 2 conversion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Rapid data comparison technique development for N-ray/X-ray analysis

An operational N-ray/X-ray computer analysis system for nondestructive testing problems was realized by developing: (1) more efficient data transfer routines for use in existing image processing systems; (2) the capability to store and analyze multiple N-ray/X-ray images; (3) an efficient 2-D Fast Fourier Transform; and (4) transfer functions compensation capability to correct for distortions and nonlinearities of N-rays/X-rays. Applications of the technique are summarized for the following: thermal protection system tile with hydraulic fluid; thermal protection system tile with corrosion; thermal protection system tile debonding; stainless steel tubing corrosion; defective electrical devices; fast film restoration and deblur; corrosion tracking over time; reduction of source vignetting, and identification of materials (0 rings, Teflon parts, soft goods) via table look up.

Butterfield, R. L.↗

Rotational Millimeter-Wave Shoe Scanner Using the Discrete Fourier Transform for Backprojection-Based Image Reconstruction

An active 3D microwave / millimeter-wave shoe scanner was previously developed at the Pacific Northwest National Laboratory (PNNL) using two linear arrays scanned over a rectilinear aperture. The radar system chirps a frequency sweep from 10-40 GHz. These frequencies allow imaging through optically opaque material such as leather, rubber, plastics, and other dielectrics. The system was designed to detect concealed items in the soles of shoes while allowing people to leave their shoes on through a security checkpoint. To shrink the footprint of the system, a new iteration of the design has been developed that scans the two linear arrays over a circular aperture. This new footprint opens the possibility of it being installed in the floor of a cylindrical millimeter-wave body scanner. The backprojection-based multilayer dielectric image reconstruction developed at PNNL can easily handle arbitrary spatial sampling, accommodating the new rotational shoe scanner design. Commonly, the fast Fourier transform (FFT) is used to efficiently compute the range response from the data collected by the system as a preprocessing step to the backprojection algorithm. It was found that converting to range using the discrete Fourier transform (DFT) directly has some advantages over the FFT. For example, nonlinear and non-uniform frequency sweeps can easily be compensated for during the computation of the DFT and only the range bins of interest need to be computed and their spacing can be chosen arbitrarily. Because the range conversion step of the image reconstruction is the fastest part of the process there is very little speed penalty for using the DFT over the FFT and it can even increase the speed of image reconstruction when the ranges of interest are fewer than the total span that is calculated in the FFT.

Millimeter-wave imaging, microwave imaging, shoe s↗

A Linear-Complexity Tensor Butterfly Algorithm for Compressing High-Dimensional Oscillatory Integral Operators

This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.

Kielstra, P Michael↗

NASA Tech Briefs, April 2011

Topics covered include: Amperometric Solid Electrolyte Oxygen Microsensors with Easy Batch Fabrication; Two-Axis Direct Fluid Shear Stress Sensor for Aerodynamic Applications; Target Assembly to Check Boresight Alignment of Active Sensors; Virtual Sensor Test Instrumentation; Evaluation of the Reflection Coefficient of Microstrip Elements for Reflectarray Antennas; Miniaturized Ka-Band Dual-Channel Radar; Continuous-Integration Laser Energy Lidar Monitor; Miniaturized Airborne Imaging Central Server System; Radiation-Tolerant, SpaceWire-Compatible Switching Fabric; Small Microprocessor for ASIC or FPGA Implementation; Source-Coupled, N-Channel, JFET-Based Digital Logic Gate Structure Using Resistive Level Shifters; High-Voltage-Input Level Translator Using Standard CMOS; Monitoring Digital Closed-Loop Feedback Systems; MASCOT - MATLAB Stability and Control Toolbox; MIRO Continuum Calibration for Asteroid Mode; GOATS Image Projection Component; Coded Modulation in C and MATLAB; Low-Dead-Volume Inlet for Vacuum Chamber; Thermal Control Method for High-Current Wire Bundles by Injecting a Thermally Conductive Filler; Method for Selective Cleaning of Mold Release from Composite Honeycomb Surfaces; Infrared-Bolometer Arrays with Reflective Backshorts; Commercialization of LARC (trade mark) -SI Polyimide Technology; Novel Low-Density Ablators Containing Hyperbranched Poly(azomethine)s; Carbon Nanotubes on Titanium Substrates for Stray Light Suppression; Monolithic, High-Speed Fiber-Optic Switching Array for Lidar; Grid-Tied Photovoltaic Power System; Spectroelectrochemical Instrument Measures TOC; A Miniaturized Video System for Monitoring Drosophila Behavior; Hydrofocusing Bioreactor Produces Anti-Cancer Alkaloids; Creep Measurement Video Extensometer; Radius of Curvature Measurement of Large Optics Using Interferometry and Laser Tracker n-B-pi-p Superlattice Infrared Detector; Safe Onboard Guidance and Control Under Probabilistic Uncertainty; General Tool for Evaluating High-Contrast Coronagraphic Telescope Performance Error Budgets; Hidden Statistics of Schroedinger Equation; Optimal Padding for the Two-Dimensional Fast Fourier Transform; Spatial Query for Planetary Data; Higher Order Mode Coupling in Feed Waveguide of a Planar Slot Array Antenna; Evolutionary Computational Methods for Identifying Emergent Behavior in Autonomous Systems; Sampling Theorem in Terms of the Bandwidth and Sampling Interval; Meteoroid/Orbital Debris Shield Engineering Development Practice and Procedure; Self-Balancing, Optical-Center-Pivot, Fast-Steering Mirror; Wireless Orbiter Hang-Angle Inclinometer System; and Internal Electrostatic Discharge Monitor - IESDM.

Source record↗

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 FAST POTENTIAL AND SELF-GRAVITY SOLVER FOR NONAXISYMMETRIC DISKS

Disk self-gravity could play an important role in the dynamic evolution of interaction between disks and embedded protoplanets. We have developed a fast and accurate solver to calculate the disk potential and disk self-gravity forces for disk systems on a uniform polar grid. Our method closely follows the method given by Chan et al., in which a fast Fourier transform in the azimuthal direction is performed and a direct integral approach in the frequency domain in the radial direction is implemented on a uniform polar grid. This method can be very effective for disks with vertical structures that depend only on the disk radius, achieving the same computational efficiency as for zero-thickness disks. We describe how to parallelize the solver efficiently on distributed parallel computers. We propose a mode-cutoff procedure to reduce the parallel communication cost and achieve nearly linear scalability for a large number of processors. For comparison, we have also developed a particle-based fast tree code to calculate the self-gravity of the disk system with a vertical structure. The numerical results show that our direct integral method is at least two orders of magnitude faster than our optimized tree-code approach.

79 ASTRONOMY AND ASTROPHYSICS↗

Rapid, high-order accurate calculation of flows due to free source or vortex distributions

Fast Fourier transform (FFT) techniques are applied to the problem of finding the flow due to source or vortex distributions in the field outside an airfoil or other two-dimensional body. Either the complex potential or the complex velocity may be obtained to a high order of accuracy, with computational effort similar to that required by second-order fast Poisson solvers. These techniques are applicable to general flow problems with compressibility and rotation. An example is given of their use for inviscid compressible flow.

Halsey, D.↗

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

On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution

A fast algorithm is developed to compute two dimensional convolutions of an array of d sub 1 X d sub 2 complex number points, where d sub 2 = 2(M) and d sub 1 = 2(m-r+) for some 1 or = r or = m. This algorithm requires fewer multiplications and about the same number of additions as the conventional fast fourier transform method for computing the two dimensional convolution. It also has the advantage that the operation of transposing the matrix of data can be avoided.

Truong, T. K.↗

NEW LIMITS ON RADIO EMISSION FROM X-RAY DIM ISOLATED NEUTRON STARS

We have carried out a search for radio emission at 820 MHz from six X-ray dim isolated neutron stars (XDINSs) with the Robert C. Byrd Green Bank Radio Telescope. No transient or pulsed emission was found using fast folding, fast Fourier transform, and single-pulse searches. The corresponding flux limits are about 0.01 mJy for pulsed emission, depending on the integration time for the particular source and assuming a duty cycle of 2%, and 20 mJy for single dispersed pulses. These are the most sensitive limits to date on radio emission from XDINSs. There is no evidence for isolated radio pulses, as seen in a class of neutron stars known as rotating radio transients. Our results imply that either the radio luminosities of these objects are lower than those of any known radio pulsars, or they could simply be long-period nearby radio pulsars with high magnetic fields beaming away from the Earth. To test the latter possibility, we would need around 40 similar sources to provide a 1{sigma} probability of at least one of them beaming toward us. We also give a detailed description of our implementation of the Fast Folding Algorithm.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-E-T-91: Accuracy of Dose Calculation Algorithms for Patients Undergoing Stereotactic Ablative Radiotherapy

Purpose: The purpose of this study was to investigate and quantify the variation in dose distributions in small field lung cancer radiotherapy using seven different dose calculation algorithms. Methods: The study was performed in 21 lung cancer patients who underwent Stereotactic Ablative Body Radiotherapy (SABR). Two different methods (i) Same dose coverage to the target volume (named as same dose method) (ii) Same monitor units in all algorithms (named as same monitor units) were used for studying the performance of seven different dose calculation algorithms in XiO and Eclipse treatment planning systems. The seven dose calculation algorithms include Superposition, Fast superposition, Fast Fourier Transform ( FFT) Convolution, Clarkson, Anisotropic Analytic Algorithm (AAA), Acurous XB and pencil beam (PB) algorithms. Prior to this, a phantom study was performed to assess the accuracy of these algorithms. Superposition algorithm was used as a reference algorithm in this study. The treatment plans were compared using different dosimetric parameters including conformity, heterogeneity and dose fall off index. In addition to this, the dose to critical structures like lungs, heart, oesophagus and spinal cord were also studied. Statistical analysis was performed using Prism software. Results: The mean±stdev with conformity index for Superposition, Fast superposition, Clarkson and FFT convolution algorithms were 1.29±0.13, 1.31±0.16, 2.2±0.7 and 2.17±0.59 respectively whereas for AAA, pencil beam and Acurous XB were 1.4±0.27, 1.66±0.27 and 1.35±0.24 respectively. Conclusion: Our study showed significant variations among the seven different algorithms. Superposition and AcurosXB algorithms showed similar values for most of the dosimetric parameters. Clarkson, FFT convolution and pencil beam algorithms showed large differences as compared to superposition algorithms. Based on our study, we recommend Superposition and AcurosXB algorithms as the first choice of algorithms in lung cancer radiotherapy involving small fields. However, further investigation by Monte Carlo simulation is required to confirm our results.

60 APPLIED LIFE SCIENCES↗

The crystal structure, orientation relationships and interfaces of the nanoscale oxides in nanostructured ferritic alloys

The capability of nanostructured ferritic alloys (NFAs) to manage high levels of transmutation product helium will help resolve one of the grand challenges to transforming the promise of C-free fusion energy into a reality. NFAs are dispersion strengthened by an ultrahigh density of Y-Ti-O nano-oxides (NOs), which result in both high strength and temperature limits, as well as unique irradiation tolerance. We used aberration-corrected high-resolution transmission electron microscopy to characterize the NOs in four NFA conditions, including following severe deformation and extreme neutron radiation exposure. Fast Fourier Transform analysis of focal series images revealed the NO crystal structure, including the smallest at < 2 nm in diameter, to be Y 2 Ti 2 O 7 pyrochlore in all cases, consistent with both exit wave analysis and scanning transmission Z-contrast imaging of the atomic columns in a larger feature. The faceted NOs exhibit a quasi-epitaxial orientation relationship with the ferrite matrix: [110] YTO ||[100] Fe and [001] YTO ||[010] Fe , forming a 5 × 7 near coincidence site interface. Also, the NOs exhibit size-dependent strains in both the oxide and matrix ferrite phases.

36 MATERIALS SCIENCE↗

Removal of Stationary Sinusoidal Noise from Random Vibration Signals

In random vibration environments, sinusoidal line noise may appear in the vibration signal and can affect analysis of the resulting data. We studied two methods which remove stationary sine tones from random noise: a matrix inversion algorithm and a chirp-z transform algorithm. In addition, we developed new methods to determine the frequency of the tonal noise. The results show that both of the removal methods can eliminate sine tones in prefabricated random vibration data when the sine-to-random ratio is at least 0.25. For smaller ratios down to 0.02 only the matrix inversion technique can remove the tones, but the metrics to evaluate its effectiveness also degrade. We also found that using fast Fourier transforms best identified the tonal noise, and determined that band-pass-filtering the signals prior to the process improved sine removal. When applied to actual vibration test data, the methods were not as effective at removing harmonic tones, which we believe to be a result of mixed-phase sinusoidal noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerated Cartesian expansion (ACE) based framework for the rapid evaluation of diffusion, lossy wave, and Klein-Gordon potentials

Diffusion, lossy wave, and Klein–Gordon equations find numerous applications in practical problems across a range of diverse disciplines. The temporal dependence of all three Green’s functions are characterized by an infinite tail. This implies that the cost complexity of the spatio-temporal convolutions, associated with evaluating the potentials, scales as O(N s 2 N t 2 ), where N s and N t are the number of spatial and temporal degrees of freedom, respectively. In this paper, we discuss two new methods to rapidly evaluate these spatio-temporal convolutions by exploiting their block-Toeplitz nature within the framework of accelerated Cartesian expansions (ACE). The first scheme identifies a convolution relation in time amongst ACE harmonics and the fast Fourier transform (FFT) is used for efficient evaluation of these convolutions. The second method exploits the rank deficiency of the ACE translation operators with respect to time and develops a recursive numerical compression scheme for the efficient representation and evaluation of temporal convolutions. It is shown that the cost of both methods scales as O(N s N t log 2 N t ). Furthermore, several numerical results are presented for the diffusion equation to validate the accuracy and efficacy of the fast algorithms developed here.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Faster Processing for Inverting GPS Occultation Data

A document outlines a computational method that can be incorporated into two prior methods used to invert Global Positioning System (GPS) occultation data [signal data acquired by a low-Earth-orbiting satellite as either this or the GPS satellite rises above or falls below the horizon] to obtain information on altitude-dependent properties of the atmosphere. The two prior inversion methods, known as back propagation and canonical transform, are computationally expensive because for each occultation, they involve numerical evaluation of a large number of diffraction-like spatial integrals. The present method involves an angular-spectrum-based phase-extrapolation approximation in which each data point is associated with a plane-wave component that propagates in a unique direction from the orbit of the receiving satellite to intersect a straight line tangent to the orbit at a nearby point. This approximation enables the use of fast Fourier transforms (FFTs), which apply only to data collected along a straight-line trajectory. The computation of the diffraction-like integrals in the angular-spectrum domain by use of FFTs takes only seconds, whereas previously, it took minutes.

Ao, Chi↗

A spherical harmonic transform approach to the indexing of electron back-scattered diffraction patterns

A new approach is proposed for the indexing of electron back-scattered diffraction (EBSD) patterns. The algorithm employs a spherical master EBSD pattern and computes its cross-correlation with a back-projected experimental pattern using the spherical harmonic transform (SHT). This approach is significantly faster than the recent dictionary indexing algorithm, but shares the latter’s robustness against noise. The underlying theory is presented, followed by example applications, one on a series of Ni EBSD data sets recorded with decreasing signal-to-noise ratio, the other on a large shot-peened Al data set. The dependence of indexing speed and memory usage on the SHT bandwidth is explored. The speed gains of the new algorithm are achieved by executing real-valued Fast Fourier Transforms, explicitly incorporating crystallographic symmetry in the cross-correlation computation, and using efficient loop ordering to improve the caching behavior. The algorithm produces a cross-correlation array in the zyz Euler space; an orientation refinement procedure is proposed based on analytical derivatives of the Wigner d functions. As a result, the new approach can be applied to any diffraction modality for which the scattered intensity can be represented on a spherical surface.

36 MATERIALS SCIENCE↗

Tracking of Ice Edges and Ice Floes by Wavelet Analysis of SAR Images

This paper demonstrates the use of wavelet transforms in the tracking of sequential ice features in the ERS-1 synthetic aperture radar (SAR) imagery, especially in situations where feature correlation techniques fail to yield reasonable results. Examples include the evolution of the St. Lawrence polynya and summer sea ice change in the Beaufort Sea. For the polynya, the evolution of the region of young ice growth surrounding a polynya can be easily tracked by wavelet analysis due to the large backscatter difference between the young and old ice. Also within the polynya, a 2D fast Fourier transform (FFT) is used to identify the extent of the Langmuir circulation region, which is coincident with the wave-agitated frazil ice growth region, where the sea ice experiences its fastest growth. Therefore, the combination of wavelet and FFT analysis of SAR images provides for the large-scale monitoring of different polynya features. For summer ice, previous work shows that this is the most difficult period for ice trackers due to the lack of features on the sea ice cover. The multiscale wavelet analysis shows that this method delineates the detailed floe shapes during this period, so that between consecutive images, the floe translation and rotation can be estimated.

Liu, Antony K.↗