Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Integrated Silicon Fourier Transform Spectrometer with Broad Bandwidth and Ultra‐High Resolution

An ultra-high resolution Fourier transform spectrometer (FTS) realized in silicon photonic platform that can operate with broad band, narrow band as well as a combination of broad band and narrow band signals is reported. The ultra-high resolution of the spectrometer is achieved by exploiting multiple techniques: a Michelson interferometer (MI) structure to increase the optical path delay (OPD), a hybrid waveguide design to reduce insertion loss, an optimized heater and air trenches to achieve higher thermal efficiency. Here, to further increase the OPD of the spectrometer to increase its resolution, a novel multiple interferometers approach is employed which combines balanced MI with N statically imbalanced MIs, thereby increasing the OPD of a single MI by factor of N + 1. An FTS spectrometer consisting of N = 2 such MIs is fabricated and experimentally characterized using unknown broad bandwidth input signal spectra of about 180 nm centered around 1550 nm, a narrow line laser input signal, and a combination of broad and narrow band signals demonstrating spectral resolution of about 0.16 nm.

Li, Ang↗
DOE OSTI2021

Maskless Fourier transform holography

Fourier transform holography is a lensless imaging technique that retrieves an object's exit-wave function with high fidelity. It has been used to study nanoscale phenomena and spatio-temporal dynamics in solids, with sensitivity to the phase component of electronic and magnetic textures. However, the method requires an invasive and labor-intensive nanopatterning of a holography mask directly onto the sample, which can alter the sample properties, forces a fixed field-of-view, and leads to a low signal-to-noise ratio at high resolution. In this work, we propose using wavefront-shaping diffractive optics to create a structured probe with full control of its phase at the sample plane, circumventing the need for a mask. We demonstrate in silico that the method can image nanostructures and magnetic textures and validate our approach with a visible light-based experiment. The method enables investigation of a plethora of phenomena at the nanoscale including magnetic and electronic phase coexistence in solids, with further uses in soft and biological matter research.

Keskinbora, Kahraman↗
DOE OSTI2020

Quantum Fourier transform revisited

Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.

Camps, Daan↗
DOE OSTI2024

Highly-efficient quantum Fourier transformations for certain non-Abelian groups

Quantum Fourier transformations are an essential component of many quantum algorithms, from prime factoring to quantum simulation. While the standard Abelian QFrT is well studied, important variants corresponding to non-Abelian groups of interest have seen less development. In particular, fast non-Abelian Fourier transformations are important components for both quantum simulations of field theories as well as approaches to the non-Abelian hidden subgroup problem. In this work, we present fast quantum Fourier transformations for a number of non-Abelian groups of interest for high energy physics, B T , B O , 6 Δ ( 27 ) , Δ ( 54 ) , and Σ ( 36 × 3 ) . For each group, we derive explicit quantum circuits and estimate resource scaling for fault-tolerant implementations. Our work shows that the development of a fast Fourier transformation can substantively reduce simulation costs by an up to three orders of magnitude for the finite groups that we have investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Multiplexing and Demultiplexing Signals for Radiography Application Using the Discrete Fourier Transform

Our goal is to develop an X-ray phase-contrast imaging system that can provide excellent soft tissue contrast of phase, attenuation, and small-angle scatter. We propose to replace the common system of G0, G1, and G2 gradings with a biprism array to replace the G1 grading and introduce a novel X-ray tube designed to replace the motion of the phase stepping grading G2. The proposed X-ray tube uses temporal multiplexing to provide simultaneous virtual “electronic phase stepping.” In this work the discrete Fourier transform is used to separate from the composite measurement individual X-ray phase contrast measurements sampled at different frequencies. The method performs a discrete Fourier transform of a composite refence sequence to obtain using the frequency amplitudes calibration factors needed to extract the X-ray phase contrast measurement amplitudes from the composite image. The composite reference sequence is the sum of the individual sequences, at different frequencies, with amplitudes of one. The method takes the discrete Fourier transform of this composite reference sequence; whereby, the amplitude of each frequency component is compared with the total sum of its stand-alone sequence amplitude. A calibration factor is determined so that the amplitude of this composite reference frequency times the calibration factor must equal the total sum of the sequence amplitude—the zero-frequency amplitude of the discrete Fourier transform of its stand-alone sequence. To demultiplex the composite measured signal these calibration factors are multiplied by the amplitudes of the frequency components of the discrete Fourier transform of the composite X-phase-contrast measurement to obtain the amplitude of each frequency encoded measurement. Using these calibration factors, we demonstrate with the discrete Fourier transform in Mathematica the extraction of individual images from a composite image that one would expect obtaining from our proposed new X-ray phase contrast imaging system. We then demonstrate as an example how using images from X-ray phase contrast data one can calculate phase, attenuation and the dark field images using grading phase step data supplied to use from Microworks, GmbH in Karlsruhe, Germany.

42 ENGINEERING↗
DOE OSTI2021

Improved motional Stark effect signal processing using fast Fourier transform spectral analysis

A Fast Fourier Transform (FFT) based method has been developed, which improves the frequency response of the Motional Stark Effect (MSE) system by about a factor of 10 over the conventional analog lock-in method. The method uses fits to rigorously derived analytic expressions for the FFT spectral components of the MSE signal to accurately obtain the amplitudes and phases of the 2f1 and 2f2 photo-elastic modulator (PEM) frequencies that encode the polarization angle. Since no frequency filtering is used in the FFT method, the frequency response is limited by fundamental measurement properties: the frequency response of the detector, photon statistics, sample rate, and the ability to resolve the spectral components. In contrast, the frequency response of the analog lock-in is limited by a low pass filter with a cutoff of around 500 Hz. In the case of the DIII-D MSE system, the output of the photo-multiplier tube detector was sampled at 500 kHz and FFTs with as few as 100 points were used to obtain the amplitudes of the 2f1 and 2f2 PEM frequency components. This corresponds to a frequency response of 5 kHz, about ten times faster than the analog lock-in amplifier system. Details of the FFT method will be presented and compared to those of the analog lock-in system.

Makowski, M. A.↗
DOE OSTI2024

Broadband rapid-scanning phase-modulated Fourier transform electronic spectroscopy

We present a phase-modulated approach for ultrabroadband Fourier transform electronic spectroscopy. To overcome the bandwidth limitations and spatial chirp introduced by acousto-optic modulators (AOMs), pulses from a 1 µm laser are modulated using AOMs prior to continuum generation. This phase modulation is transferred to the continuum generated in a yttrium aluminum garnet crystal. Separately generated phase-modulated continua in two arms of a Mach-Zehnder interferometer interfere with the difference of their modulation frequencies, enabling physical under-sampling of the signal and the suppression of low-frequency noise. By interferometrically tracking the relative time delay of the continua, we perform continuous, rapid-scanning Fourier transform electronic spectroscopy with a high signal-to-noise ratio and spectral resolution. As proof of principle, we measure the linear absorption and fluorescence excitation spectra of a laser dye and various biological samples.

Javed, Ariba↗
DOE OSTI2024

Physics-constrained machine learning for electrodynamics without gauge ambiguity based on Fourier transformed Maxwell’s equations

We utilize a Fourier transformation-based representation of Maxwell’s equations to develop physics-constrained neural networks for electrodynamics without gauge ambiguity, which we label the Fourier–Helmholtz–Maxwell neural operator method. In this approach, both of Gauss’s laws and Faraday’s law are built in as hard constraints, as well as the longitudinal component of Ampère–Maxwell in Fourier space, assuming the continuity equation. An encoder–decoder network acts as a solution operator for the transverse components of the Fourier transformed vector potential, $\hat{A}_⟂(k,t)$, whose two degrees of freedom are used to predict the electromagnetic fields. This method was tested on two electron beam simulations. Among the models investigated, it was found that a U-Net architecture exhibited the best performance as it trained quicker, was more accurate and generalized better than the other architectures examined. We demonstrate that our approach is useful for solving Maxwell’s equations for the electromagnetic fields generated by intense relativistic charged particle beams and that it generalizes well to unseen test data, while being orders of magnitude quicker than conventional simulations. We show that the model can be re-trained to make highly accurate predictions in as few as 20 epochs on a previously unseen data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A generalizable machine learning-assisted fast Fourier transform algorithm to simulate the large strain phenomena in polycrystalline materials

Machine learning methods have shown initial promise in constitutive modeling for single crystals or homogenized polycrystals, delivering notable computational efficiency. However, existing machine learning-based constitutive models often lack generalizability, limiting their application across diverse boundary value problems. This study introduces a thermodynamics-informed artificial neural network model to accelerate rate-tangent crystal plasticity fast Fourier transform simulations for cross-scale deformation behaviors of polycrystals under complex loading. Our model integrates microstructural variability and local interactions effectively. To address local effects in each grain, we employ K-means clustering to group Gauss points within the microstructure into clusters assumed to be in similar mechanical states. This approach, based on self-clustering analysis, extends model scope from macroscopic stress response to the granular level, capturing mechanical responses and orientation evolution across grains. This reduces the number of nonlinear problems to solve, with cluster responses propagated throughout each group. The thermodynamics-based artificial neural network-extracted features are further processed using local material state clusters to account for history-dependent deformation and evolving microstructures. Additionally, representative volume element simulations with rate-tangent crystal plasticity fast Fourier transform provide reliable datasets for model training. The proposed model demonstrates high efficiency, accuracy, self-consistency, and enhanced generalizability in predicting strain–stress responses and orientation evolution at both individual grain and aggregate scales under complex loading conditions, such as biaxial tension and arbitrary loading scenarios.

36 MATERIALS SCIENCE↗
DOE OSTI2024

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↗
DOE OSTI2022

High-dimensional discrete Fourier transform gates with a quantum frequency processor

The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms such as frequency bins. In this article, we show that d -point frequency-bin DFTs can be realized with a fixed three-component quantum frequency processor (QFP), simply by adding to the electro-optic modulation signals one radio-frequency harmonic per each incremental increase in d . We verify gate fidelity F W > 0.9997 and success probability P W > 0.965 up to d = 10 in numerical simulations, and experimentally implement the solution for d = 3, utilizing measurements with parallel DFTs to quantify entanglement and perform tomography of multiple two-photon frequency-bin states. Our results furnish new opportunities for high-dimensional frequency-bin protocols in quantum communications and networking.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Theoretical framework for soft X-ray Fourier transform spectroscopy using the Wigner function

This work presents a theoretical framework for the propagation of partially coherent Gaussian radiation in a modified Mach–Zehnder interferometer designed for Fourier transform spectroscopy (FTS) applications. Using the Wigner function formalism, we analytically propagate the radiation through the system and benchmark our approach by comparing the resulting interference pattern and interferogram with previous works in the diffraction limit. Our analysis reveals that the transverse coherence length requirement of the incident light field for detectable modulation is less stringent than previously assumed. Additionally, we provide theoretical demonstrations of FTS performance across various wavelengths using the proposed setup. These findings underscore the potential of this interferometer to achieve high-resolution FTS in the soft X-ray regime.

Fourier transform spectroscopy↗
DOE OSTI2024

Detection and Signal Processing for Near-Field Nanoscale Fourier Transform Infrared Spectroscopy

Researchers from a broad spectrum of scientific and engineering disciplines are increasingly using scattering-type near-field infrared spectroscopic techniques to characterize materials non-destructively with nanoscale spatial resolution. However, a sub-optimal understanding of a technique's implementation can complicate data interpretation and act as a barrier to entering the field. Here the key detection and processing steps involved in producing scattering-type near-field nanoscale Fourier transform infrared spectra (nano-FTIR) are outlined. The self-contained mathematical and experimental work derives and explains: i) how normalized complex-valued nano-FTIR spectra are generated, ii) why the real and imaginary components of spectra qualitatively relate to dispersion and absorption respectively, iii) a new and generally valid equation for spectra which can be used as a springboard for additional modeling of the scattering processes, and iv) an algebraic expression that can be used to extract an approximation to the sample's local extinction coefficient from nano-FTIR. The algebraic model for weak oscillators is validated with nano-FTIR and attenuated total reflectance Fourier transform infrared (ATR-FTIR) spectra on samples of polystyrene and Kapton and further provides a pedagogical pathway to cementing some of the technique's key qualitative attributes.

36 MATERIALS SCIENCE↗
DOE OSTI2024

FREDA: A Web Application for the Processing, Analysis, and Visualization of Fourier‐Transform Mass Spectrometry Data

The high-resolution measurement capability of Fourier-transform mass spectrometry (FT-MS) has made it a necessity for exploring the molecular composition of complex organic mixtures, like soil, plant, aquatic, and petroleum samples. This demand has driven a need for informatics tools to explore and analyze FT-MS data in a robust and reproducible manner. FREDA is an interactive web application developed to enable spectrometrists to format, process, and explore their FT-MS data without the need for statistical programming expertise. FREDA was built to explore outputs from a molecular identification tool, like CoreMS, and provide a suite of methods to filter data, compute chemical properties of peaks, statistically compare samples and groups of samples, conduct exploratory data analysis, and download the results with a report detailing all steps conducted. To demonstrate the utility of FREDA, an example analysis was conducted using FT-MS data from a soil microbiology study of samples collected in two different soil depths at the Sphagnum bog forest north of Grand Rapids, Minnesota. Differences between the two depths are observed using Kendrick, Gibbs free energy, and van Krevelen plots. G-tests are used to quantify a significant difference between the groups. All analyses and plotting are conducted using only the FREDA application. FREDA is an open-source and readily available web application that allows users to explore and make statistically valid conclusions about their FT-MS data. The application is available online (https://map.emsl.pnnl.gov/app/freda) with a tutorial web series (https://youtu.be/k5HLE2kNSBY?si=yB6sGoyvzxrFf5MP) and freely accessible code on Github (https://github.com/EMSL-Computing/FREDA).

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Recursive Use of the Short-Time Fast Fourier Transform for Signature Analysis in Continuous Processes

Although a nuclear reactor is a hostile environment for sensing and electrical communications, the reactor core is amenable to acoustic communication. An acoustic measurement infrastructure (AMI) has been installed in the Advanced Test Reactor (ATR) to record acoustic signals that can capture its different operating regimes. AMI uses coolant pumps as continuous signal sources, coolant and structural components as transmission lines, and accelerometers to capture system motion. A recursive signal processing technique based on the short-time fast Fourier transform (STFFT) for continuous processes provides unique signatures for diagnostic and prognostic analyses from the system motion data. Here this article presents a recursive STFFT methodology that processes acoustic signals from continuous industrial processes. The article first discusses the initial STFFT use with simulated data to elucidate the basic principles necessary to understand and interpret the STFFT results from actual pump vibration data. Each repetitive use of the STFFT on pump vibration data using the results from the prior STFFT processing will generate additional complimentary time-frequency-based signatures. These signatures are generated by the coolant pumps operating under different process conditions. After each use of the STFFT, the resulting signatures provide exemplary examples of the diversity and intuitive nature of recursively using the STFFT. This article focuses on recursively using the STFFT to provide numerous complimentary and diverse signatures that will ultimately be inputs for machine learning algorithms that provide predictive data analytics. The intuitive nature of the information and signatures from recursive STFFT processing will also bring intuitive interpretation capabilities to machine learning and predictive data analytic techniques.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗