Search NASA⌕ Search

SEARCH · Search NASA

Results for “Fourier transforms”

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 343 records · Page 19

Method for utilizing properties of the sinc(x) function for phase retrieval on nyquist-under-sampled data

Disclosed herein are systems, methods, and non-transitory computer-readable storage media for simulating propagation of an electromagnetic field, performing phase retrieval, or sampling a band-limited function. A system practicing the method generates transformed data using a discrete Fourier transform which samples a band-limited function f(x) without interpolating or modifying received data associated with the function f(x), wherein an interval between repeated copies in a periodic extension of the function f(x) obtained from the discrete Fourier transform is associated with a sampling ratio Q, defined as a ratio of a sampling frequency to a band-limited frequency, and wherein Q is assigned a value between 1 and 2 such that substantially no aliasing occurs in the transformed data, and retrieves a phase in the received data based on the transformed data, wherein the phase is used as feedback to an optical system.

Dean, Bruce H.↗

Algorithm for Wavefront Sensing Using an Extended Scene

A recently conceived algorithm for processing image data acquired by a Shack-Hartmann (SH) wavefront sensor is not subject to the restriction, previously applicable in SH wavefront sensing, that the image be formed from a distant star or other equivalent of a point light source. That is to say, the image could be of an extended scene. (One still has the option of using a point source.) The algorithm can be implemented in commercially available software on ordinary computers. The steps of the algorithm are the following: 1. Suppose that the image comprises M sub-images. Determine the x,y Cartesian coordinates of the centers of these sub-images and store them in a 2xM matrix. 2. Within each sub-image, choose an NxN-pixel cell centered at the coordinates determined in step 1. For the ith sub-image, let this cell be denoted as si(x,y). Let the cell of another subimage (preferably near the center of the whole extended-scene image) be designated a reference cell, denoted r(x,y). 3. Calculate the fast Fourier transforms of the sub-sub-images in the central NxN portions (where N < N and both are preferably powers of 2) of r(x,y) and si(x,y). 4. Multiply the two transforms to obtain a cross-correlation function Ci(u,v), in the Fourier domain. Then let the phase of Ci(u, v) constitute a phase function, phi(u,v). 5. Fit u and v slopes to phi (u,v) over a small u,v subdomain. 6. Compute the fast Fourier transform, Si(u,v) of the full NxN cell si(x,y). Multiply this transform by the u and phase slopes obtained in step 4. Then compute the inverse fast Fourier transform of the product. 7. Repeat steps 4 through 6 in an iteration loop, cumulating the u and slopes, until a maximum iteration number is reached or the change in image shift becomes smaller than a predetermined tolerance. 8. Repeat steps 4 through 7 for the cells of all other sub-images.

Sidick, Erkin↗

Multi-user satellite communications system using an innovative compressive receiver

There is a need for an onboard simultaneous multi-channel demodulation system for a satellite communications system. Studies indicate that Convolve Multiply Convolve (CMC) filtering with surface acoustic wave (SAW) dispersive delay lines will eliminate the necessity of onboard satellite channelized filters of complex fourier transform processors. The reason for choosing the CMC technique is its ability to perform Fourier transformations in a shorter time with less space and power consumption than digital Fourier transform processors. Each ground terminal in this multi-users communications system is remotely located and operates independently; hence, a method of synchronizing the transmission of these users is presented which utilizes the existing Global Positioning System (GPS) system. Each ground user is equipped with a low cost ground terminal that has a synchronization subsystem attached to it. The system design of an onboard Multi-channel Receiver and Demodulator utilizes Quadrature Phase Shift Keying (QPSK) as the modulation technique. This technique provides the best figure of merit, i.e., the lowest transmitter power requirement per communication channel.

Staples, Edward J.↗

Composition and persistence of soil organic matter along eroding and depositional transects in buried vs. modern soil layers: A case of the Brady paleosol at Wauneta, Nebraska

Paleosols form when soils are buried through deposition by aeolian, colluvial, alluvial or other processes. Burial of former topsoil isolates soil organic matter (SOM) from surface conditions, allowing carbon to accumulate and potentially remain stable for millennia. In this study, SOM composition, distribution, and persistence were analyzed in the Brady Soil of Nebraska, USA to compare SOM spatial variability in modern and buried soils, as well as the impact of erosional exposure on SOM stability. The Brady Soil, formed as a surface soil during the Pleistocene-Holocene transition and now a paleosol buried up to 6 m deep (or more) by loess deposition during the Holocene, was sampled along burial (up to 5.8 m depth) and erosional (up to 1.8 m depth) transects to compare SOM dynamics in different geomorphic settings. Fourier Transform Infrared Spectroscopy (FTIR) and Fourier Transform ion cyclotron resonance mass spectrometry (FTICR-MS) were used to analyze SOM composition, while δ 13 C isotope analyses identified SOM sources and radiocarbon values were used to estimate turnover rates. Results confirmed a vegetation shift from C3 to C4 plants after Brady Soil formation, reflecting warming climatic conditions. Increasing SOM age and decreasing δ 13 C and δ 15 N values with depth indicated slowing of decomposition rate in buried soils. Higher pH in the Brady Soil suggested greater base cation content, supporting SOM stabilization through organo-mineral associations and aggregate formation. However, exposure of the Brady Soil due to surface erosion caused faster SOM turnover. This result suggested susceptibility of buried SOM to losses via decomposition upon erosional exposure, possibly accelerated by priming in response to modern SOM inputs. These findings highlight the potential loss of carbon stocks in buried soils under future climate change, as shifts in soil physicochemical properties may destabilize long-preserved SOM.

Environmental sciences↗

Extensive analysis of reconstruction algorithms for DESI 2024 baryon acoustic oscillations

Reconstruction of the baryon acoustic oscillation (BAO) signal has been a standard procedure in BAO analyses over the past decade and has helped to improve the BAO parameter precision by a factor of ∼2 on average. The Dark Energy Spectroscopic Instrument (DESI) BAO analysis for the first year (DR1) data uses the “standard” reconstruction framework, in which the displacement field is estimated from the observed density field by solving the linearized continuity equation in redshift space, and galaxy and random positions are shifted in order to partially remove non-linearities. There are several approaches to solving for the displacement field in real survey data, including the multigrid (MG), iterative Fast Fourier Transform (iFFT), and iterative Fast Fourier Transform particle (iFFTP) algorithms. In this work, we analyze these algorithms and compare them with various metrics including two-point statistics and the displacement itself using realistic DESI mocks. We focus on three representative DESI samples, the emission line galaxies (ELG), quasars (QSO), and the bright galaxy sample (BGS), which cover the extreme redshifts and number densities, and potential wide-angle effects. We conclude that the MG and iFFT algorithms agree within 0.4% in post-reconstruction power spectrum on BAO scales with the RecSym convention, which does not remove large-scale redshift space distortions (RSDs), in all three tracers. The RecSym convention appears to be less sensitive to displacement errors than the RecIso convention, which attempts to remove large-scale RSDs. However, iFFTP deviates from the first two; thus, we recommend against using iFFTP without further development. In addition, we provide the optimal settings for reconstruction for five years of DESI observation. The analyses presented in this work pave the way for DESI DR1 analysis as well as future BAO analyses.

79 ASTRONOMY AND ASTROPHYSICS↗

Breadboard Signal Processor for Arraying DSN Antennas

A recently developed breadboard version of an advanced signal processor for arraying many antennas in NASA s Deep Space Network (DSN) can accept inputs in a 500-MHz-wide frequency band from six antennas. The next breadboard version is expected to accept inputs from 16 antennas, and a following developed version is expected to be designed according to an architecture that will be scalable to accept inputs from as many as 400 antennas. These and similar signal processors could also be used for combining multiple wide-band signals in non-DSN applications, including very-long-baseline interferometry and telecommunications. This signal processor performs functions of a wide-band FX correlator and a beam-forming signal combiner. [The term "FX" signifies that the digital samples of two given signals are fast Fourier transformed (F), then the fast Fourier transforms of the two signals are multiplied (X) prior to accumulation.] In this processor, the signals from the various antennas are broken up into channels in the frequency domain (see figure). In each frequency channel, the data from each antenna are correlated against the data from each other antenna; this is done for all antenna baselines (that is, for all antenna pairs). The results of the correlations are used to obtain calibration data to align the antenna signals in both phase and delay. Data from the various antenna frequency channels are also combined and calibration corrections are applied. The frequency-domain data thus combined are then synthesized back to the time domain for passing on to a telemetry receiver

Jongeling, Andre↗

Efficient Two-Dimensional-FFT Program

Program computes 64 X 64-point fast Fourier transform in less than 17 microseconds. Optimized 64 X 64 Point Two-Dimensional Fast Fourier Transform combines performance of real- and complex-valued one-dimensional fast Fourier transforms (FFT's) to execute two-dimensional FFT and coefficients of power spectrum. Coefficients used in many applications, including analyzing spectra, convolution, digital filtering, processing images, and compressing data. Source code written in C, 8086 Assembly, and Texas Instruments TMS320C30 Assembly languages.

Miko, J.↗

A fast DFT algorithm using complex integer transforms

Winograd's algorithm for computing the discrete Fourier transform is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields. This algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithms.

Reed, I. S.↗

Transfer Functions Via Laplace- And Fourier-Borel Transforms

Approach to solution of nonlinear ordinary differential equations involves transfer functions based on recently-introduced Laplace-Borel and Fourier-Borel transforms. Main theorem gives transform of response of nonlinear system as Cauchy product of transfer function and transform of input function of system, together with memory effects. Used to determine responses of electrical circuits containing variable inductances or resistances. Also possibility of doing all noncommutative algebra on computers in such symbolic programming languages as Macsyma, Reduce, PL1, or Lisp. Process of solution organized and possibly simplified by algebraic manipulations reducing integrals in solutions to known or tabulated forms.

Can, Sumer↗

A Discrete Hankel Transform Approach to Nuclear Data Processing for Fusion Applications

This study introduces advancements to the numerical solutions employed in the processing of nuclear data for fusion applications. It leverages the convolution theorem and Fourier transform techniques to enhance computational efficiency and broaden applicability. Building upon a previously reported discrete Hankel transform approach for Doppler broadening, this work refines the solution of convolution integrals central to these applications. The methodology provides a general and unified framework for evaluating any convolution operation, regardless of whether the underlying problem involves temperature effects in nuclear reactions. The applicability to the nuclear data processing for fusion is demonstrated by deriving the convolution integrals for some of the fusion-related quantities. As before, the convolution operation utilizes a Gaussian-based kernel; however, the discrete Hankel transform of order $𝛼$ = $\frac{1}{2}$ is now applied to the forward Fourier transform of the nonkernel argument, rather than the inverse Fourier transform. This modification eliminates the need for the integration of the nonkernel, cross section–based function, which is a step that posed challenges for certain pointwise cross-section representations. It also removes the requirement for cross-section linearization. Optimized for graphics processing unit architectures, the approach significantly improves computational performance. These advancements are currently under evaluation as the foundation for the next-generation thermonuclear data file processing codes being developed at Lawrence Livermore National Laboratory.

Nuclear science and engineering↗

Experimental image alignment system

A microcomputer-based instrument for image alignment with respect to a reference image is described which uses the DEFT sensor (Direct Electronic Fourier Transform) for image sensing and preprocessing. The instrument alignment algorithm which uses the two-dimensional Fourier transform as input is also described. It generates signals used to steer the stage carrying the test image into the correct orientation. This algorithm has computational advantages over algorithms which use image intensity data as input and is suitable for a microcomputer-based instrument since the two-dimensional Fourier transform is provided by the DEFT sensor.

Moyer, A. L.↗

Time and space integrating acousto-optic folded spectrum processing for SETI

Time and space integrating folded spectrum techniques utilizing acousto-optic devices (AOD) as 1-D input transducers are investigated for a potential application as wideband, high resolution, large processing gain spectrum analyzers in the search for extra-terrestrial intelligence (SETI) program. The space integrating Fourier transform performed by a lens channels the coarse spectral components diffracted from an AOD onto an array of time integrating narrowband fine resolution spectrum analyzers. The pulsing action of a laser diode samples the interferometrically detected output, aliasing the fine resolution components to baseband, as required for the subsequent charge coupled devices (CCD) processing. The raster scan mechanism incorporated into the readout of the CCD detector array is used to unfold the 2-D transform, reproducing the desired high resolution Fourier transform of the input signal.

Wagner, K.↗

Wavelet Filter Banks for Super-Resolution SAR Imaging

This paper discusses Innovative wavelet-based filter banks designed to enhance the analysis of super resolution Synthetic Aperture Radar (SAR) images using parametric spectral methods and signal classification algorithms, SAR finds applications In many of NASA's earth science fields such as deformation, ecosystem structure, and dynamics of Ice, snow and cold land processes, and surface water and ocean topography. Traditionally, standard methods such as Fast-Fourier Transform (FFT) and Inverse Fast-Fourier Transform (IFFT) have been used to extract Images from SAR radar data, Due to non-parametric features of these methods and their resolution limitations and observation time dependence, use of spectral estimation and signal pre- and post-processing techniques based on wavelets to process SAR radar data has been proposed. Multi-resolution wavelet transforms and advanced spectral estimation techniques have proven to offer efficient solutions to this problem.

Sheybani, Ehsan O.↗

The application of digital signal processing techniques to a teleoperator radar system

A digital signal processing system was studied for the determination of the spectral frequency distribution of echo signals from a teleoperator radar system. The system consisted of a sample and hold circuit, an analog to digital converter, a digital filter, and a Fast Fourier Transform. The system is interfaced to a 16 bit microprocessor. The microprocessor is programmed to control the complete digital signal processing. The digital filtering and Fast Fourier Transform functions are implemented by a S2815 digital filter/utility peripheral chip and a S2814A Fast Fourier Transform chip. The S2815 initially simulates a low-pass Butterworth filter with later expansion to complete filter circuit (bandpass and highpass) synthesizing.

Pujol, A.↗

Calculation of power spectrums from digital time series with missing data points

Two algorithms are developed for calculating power spectrums from the autocorrelation function when there are missing data points in the time series. Both methods use an average sampling interval to compute lagged products. One method, the correlation function power spectrum, takes the discrete Fourier transform of the lagged products directly to obtain the spectrum, while the other, the modified Blackman-Tukey power spectrum, takes the Fourier transform of the mean lagged products. Both techniques require fewer calculations than other procedures since only 50% to 80% of the maximum lags need be calculated. The algorithms are compared with the Fourier transform power spectrum and two least squares procedures (all for an arbitrary data spacing). Examples are given showing recovery of frequency components from simulated periodic data where portions of the time series are missing and random noise has been added to both the time points and to values of the function. In addition the methods are compared using real data. All procedures performed equally well in detecting periodicities in the data.

Murray, C. W., Jr.↗

Robust Automatic EXAFS First-Shell Fits

Extended X-ray absorption fine structure (EXAFS) is a widely used technique for atomic structure determination. Fourier transformation connects EXAFS in k space and R space. However, determining the appropriate k-range for the transformation can be challenging, but critical for the first-shell fit. In this study, we present an automatic method to determine the k-range using the Larch package and a Python program. The first step is to estimate spectral noise across a series of k-ranges with a fixed minimum value and identify the optimal maximum value in the k-range (k max ). The k max is determined by an empirical noise threshold that marks the point where the noise level in the Fourier transformed spectrum changes dramatically. Using the obtained k max value, the first shell is modeled to determine the minimum k value (k min ) by optimizing the background function through alignment of the spectrum with theory. The optimal k min corresponds to the point of the minimum R-factor, which quantifies the difference between the experimental and fitted spectrum. Our method was tested on various typical datasets and yielded suitable k-ranges for Fourier transformation and accurate first-shell fits. This approach helps avoid unreliable, irreproducible data analysis, especially for noisy data from diluted samples, and enables robust automatic first-shell EXAFS fitting.

EXAFS analysis↗

High-resolution frequency determination of discrete signal components

An important problem in many applications involves the determination of the frequency of a limited set of sinusoidal components in a time domain signal. The Fourier transform is used as the fundamental tool for conversion to the frequency domain. In the present investigation, an analysis is conducted of the errors inherent in the use of the Fourier transform without time domain windowing, and an algorithm is developed which makes it possible to obtain the frequency of the component signals with high accuracy. This algorithm combines the advantages of the Gaussian window with the computational efficiency of the Fast Fourier Transform (FFT).

Walton, E. K.↗

Surface diagnosis of large reflector antennas using microwave holographic metrology - An iterative approach

The radiation pattern of an antenna can be significantly affected by reflector surface errors. A minimization of losses due to surface inaccuracies is, therefore, required. A suitable procedure for the determination of the deviations of the surface from its ideal geometry is based on the microwave holographic technique. In this procedure, the complex pattern of the antenna is measured, and the Fourier transform relationship, existing between the radiation pattern and the function related to the current distribution on the reflector surface, is applied. It is naturally desirable to limit the amount of measured data. The present investigation is concerned with the concept of the Fourier transform relationship between the induced current and the far field. It is demonstrated that the relationship, in general, can be interpreted as a summation of many Fourier transforms. An iterative scheme is employed to continue the far-field pattern outside the measurement window.

Rahmat-Samii, Y.↗