Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discrete 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

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↗

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↗

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↗

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↗

Second Order System Study

During my education in mathematics, engineering and physics, I learned transform pairs and their usage mechanics but I never remember seeing the derivations of the solutions to second order ordinary differential equations (ODE) and difference equations. A solution to a question posed in a potential funder meeting put me on a path to solving second order systems using the five principal Fourier based methods: Fourier transform (FT), Z-transform (ZT), discrete time Fourier transform (DTFT), discrete Fourier transform (DFT) and Laplace transform (LT).

42 ENGINEERING↗

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↗

Evaluating Methods for Measuring Grid Frequency in Low-Inertia Power Systems: Preprint

Accurate measurement of grid frequency is a critical component of reliable grid control. Traditionally, methods such as phase locked loops (PLLs) and discrete Fourier transforms (DFTs) have been used in inverters and phasor measurement units (PMUs) to measure frequency. However, as the percentage of inverter-based resources (IBRs) such as solar and wind has increased, these conventional frequency measurement methods are proving unable to guarantee reliable control in some cases. One challenge is measuring frequency during transient events, where there is a disruption in the steady state sinusoidal voltage. During these events, the underlying frequency of the grid may barely change, but measurement methods report a large spike in frequency due to the disrupted waveform. New methods must balance between suppressing spikes in frequency during faults, and providing fast, accurate, measurements in all other grid operation conditions, especially during events with high rate-of-change-of frequency (ROCOF), which are more prevalent in high-IBR power systems. This paper first surveys frequency measurement methods that have been proposed to reduce measurement errors during transient events. Then, both conventional and more novel frequency measurement methods are tested against an IEEE standard and industry recommendations, and their performance is evaluated for events simulated in PSCAD. Results quantify the trade-offs in performance during different grid conditions and lead to suggestions for the most appropriate frequency and ROCOF measurement methods for low inertia grids.

frequency↗

Alignment Method for Synchronized Phase Angle Measurement With Presence of Practical Time Shift

Synchronized Phase Angle Measurements (SPAMs) are widely used in power systems in the applications of situational awareness. However, the practical time shifts can lead to unexpected angle differences among Phasor Measurement Units (PMUs) manufactured from various vendors. Moreover, since most of PMUs calculate phase angle via Discrete Fourier Transform based approaches, this issue becomes even worse under the off-nominal frequency condition. To mitigate the impact of practical timing shift, this letter presents a fast method to rectify the SPAM for appropriate alignment. To verify the performance of the proposed method, laboratory and field tests have been conducted by implementing the method in PMUs and phasor data concentrators, respectively. The results demonstrate that the standard deviations of the phase angle differences have significantly decreased to 0.1$^{\circ }$ order with the adoption of the proposed method.

42 ENGINEERING↗

Direct measurement of storage and loss behavior in AFM force–distance experiments using the modified Fourier transformation

Force–distance curve experiments are commonly performed in atomic force microscopy (AFM) to obtain the viscoelastic characteristics of materials, such as the storage and loss moduli or compliances. The classic methods used to obtain these characteristics consist of fitting a viscoelastic material model to the experimentally obtained AFM data. Here, we demonstrate a new method that utilizes the modified discrete Fourier transform to approximate the storage and loss behavior of a material directly from the data, without the need for a fit. Additionally, one may still fit a model to the resulting storage and loss behavior if a parameterized description of the material is desired. In contrast to fitting the data to a model chosen a priori, departing from a model-free description of the material's frequency behavior guides the selection of the model, such that the user may choose the one that is most appropriate for the particular material under study. To this end, we also include modified Fourier domain descriptions of commonly used viscoelastic models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A FFT-based mesoscale continuum dislocation mechanics with defect energy: Applications to composites and polycrystals

A crystal plasticity elastoviscoplastic FFT (fast Fourier transform) formulation with a mesoscale continuum field dislocation mechanics model is presented, which incorporates a defect energy density that depends on GND densities and an associated material length scale. This allows to thermodynamically derive internal length scale dependent intra-crystalline backstress and Peach–Koehler force acting on GND densities. The model considers GND density evolution through a filtered numerical spectral approach, which is coupled with stress equilibrium through the elastoviscoplastic FFT algorithm. The discrete Fourier transform (DFT) method together with finite difference (FD) schemes is applied to solve both the backstress tensor and the Fourier–Green operator. Numerical results are first reported for two-phase laminate composites with plastic single crystal channels and elastic precipitates for shear loadings. Channel size effects are simulated and analyzed on the overall and local hardening behaviors during monotonous loadings. In addition, the evolutions of GND densities and the role of their associated backstress on size effects are examined during reversible shear loading. In a second part, the role of the defect energy internal length scale on polycrystal’s hardening during tension–compression is discussed. The results are compared to those obtained using FFT-based continuum field dislocation mechanics without defect energy.

36 MATERIALS SCIENCE↗

Experimental and theoretical analysis of carbon driven detonation waves in a heterogeneously premixed Rotating Detonation Engine

Coal dust explosions can be hazardous; however, they can also generate a significant rise in stagnation pressure if adequately harnessed. Rotating detonation combustors seek to take advantage of the stagnation pressure rise phenomenon in a more sustained and controlled manner via confinement to a physical annulus, leading to increased overall thermodynamic efficiency. Here this investigation presents an analysis of detonations fueled by Carbon Black, a solid particulate consisting of virtually pure carbon molecules and lean Hydrogen-Air mixtures. It is realized that with the addition of Carbon Black, an increase of lean mixture detonability and detonation velocities extending the operating limit over that of a pure hydrogen-air mixture is experienced. For all testing conditions, the total equivalence ratio is held at φ = 1, while the fuel mixture's carbon mass fraction is increased from 0 to 0.7 while the hydrogen is decreased. Detonation wave velocities are extracted from high-speed imaging through applying a Discrete Fourier Transform algorithm to determine changes to the wave speed as Carbon Black particles are introduced. As a result, due to the addition of Carbon Black as an auxiliary fuel source, detonations were formed instead of deflagrations in operating conditions where one would expect deflagrations at the same hydrogen-air equivalence ratios without Carbon Black addition. The detonation formation provides evidence that the coal particles are reacting within the detonation wave in a large enough capacity to support a detonation wave within the annulus. Furthermore, the wave speed is shown to increase with the additional of carbon particles. At a constant global equivalence ratio, the detonation wave velocities were found to decrease with hydrogen's incremental replacement with coal particles. Whereby, through a theoretical comparison of the heat of combustion as computed from the experimentally derived detonation wave velocities, a linear relationship of the two was shown to exist. Therefore, the heat of combustion has the potential to describe an operational limit to sustaining a detonation wave.

42 ENGINEERING↗

Multi-Dimensional Scaling on Groups

Leveraging the intrinsic symmetries in data for clear and efficient analysis is an important theme in signal processing and other data-driven sciences. A basic example of this is the ubiquity of the discrete Fourier transform which arises from translational symmetry (i.e. time-delay/phase-shift). Particularly important in this area is understanding how symmetries inform the algorithms that we apply to our data. In this paper we explore the behavior of the dimensionality reduction algorithm multi-dimensional scaling (MDS) in the presence of symmetry. We show that understanding the properties of the underlying symmetry group allows us to make strong statements about the output of MDS even before applying the algorithm itself. In analogy to Fourier theory, we show that in some cases only a handful of fundamental ``frequencies'' (irreducible representations derived from the corresponding group) contribute information for the MDS Euclidean embedding.

Dimensionality reduction, Representation theory, D↗

A Nonlinear Least Squares Phasor Estimation Algorithm with a Trust Metric

The paper presents a separable nonlinear least squares (NLLS)-based approach for estimation of fundamental-frequency phasors from sampled point-on-wave measurements. An analytical connection is established between the NLLS cost function and the discrete Fourier transform (DFT)-based periodogram of the input signal. This periodogram-based interpretation of the cost function offers an intuitive and easy-to-implement solution for the frequency estimate. Using the residual error of the NLLS-fit, the paper also presents an insightful measure for ascertaining the quality of the phasor estimates and their validity, especially for data windows containing signal transients.

Chatterjee, Kaustav↗

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗

Paradigm for universal quantum information processing with integrated acousto-optic frequency beamsplitters

Frequency-bin encoding offers tremendous potential in quantum photonic information processing, in which a single waveguide can support hundreds of lightpaths in a naturally phase-stable fashion. This stability, however, comes at a cost: arbitrary unitary operations can be realized by cascaded electro-optic phase modulators and pulse shapers, but require nontrivial numerical optimization for design and have thus far been limited to discrete tabletop components. In this article, we propose, formalize, and computationally evaluate a new paradigm for universal frequency-bin quantum information processing using acousto-optic scattering processes between distinct transverse modes. We show that controllable phase matching in intermodal processes enables 2 × 2 frequency beamsplitters and transverse-mode-dependent phase shifters, which together comprise cascadable FRequency-transverse-mODe Operations (FRODOs) that can synthesize any unitary via analytical decomposition procedures. Modeling the performance of both random gates and discrete Fourier transforms, we demonstrate the feasibility of high-fidelity quantum operations with existing integrated photonics technology, highlighting prospects of parallelizable operations achieving 100% bandwidth utilization. Our approach is realizable with CMOS technology, opening the door to scalable on-chip quantum information processing in the frequency domain.

Lukens, Joseph M. [Purdue Univ., West Lafayette, I↗

Open Source Fault-tolerant Grid Frequency Measurement for Solar Inverters

The Discrete Fourier transform (DFT) based measurement algorithms are one of the most common measurement algorithms for grid parameter estimation such as rms, phase angle, frequency. Over the past few years, many DFT based algorithms have been developed to enhance its measurement accuracy under steady-state and/or dynamic grid conditions. For example, an adaptive band-pass filter utilizing exponential modulation filter has been proposed to reduce measurement errors at the presence of large frequency deviations. Measurement accuracy of different algorithms including FIR filter, extended Kalman filtering (EKF), and enhanced DFT method have been compared in detail under different grid conditions. Two artificial signals that have 90-degree phase difference were constructed by the Clarke transformation to address the frequency spectrum leakage of DFT. A multi-module approach was developed to enhance both steady-state and dynamic measurement accuracies, in which each module was developed to eliminate some specific errors. Besides DFT-based measurement algorithms, some signal model-based algorithms have been developed to further improve the accuracy under dynamic conditions. However, a key drawback of the state-of-the-art algorithms is that they cannot perform measurements accurately during system transient faults. In the Blue Cut Fire event, there was a phase angle jump of about 26 degrees in the voltage waveform during the transient fault. The phase angle jump fault will cause waveform discontinuity, and these algorithms will fail to provide reliable measurements during this period because they typically assume the waveform to be measured is continuous, no matter what method (DFT, PLL, EKF, FIR, or Taylor WLS) is used for estimation. In fact, the measurement errors during the system transient faults like phase-jump is not required in the IEEE Standard. As a result, although a measurement instrument can pass the strict IEEE Standard, it could still be the source of the problem in the future if we have similar system transient faults, which could happen again. Therefore, developing the fault-tolerant measurement technology is the key to solve the problem.

14 SOLAR ENERGY↗

Determining the Axes of a Range-Doppler Image

Synthetic aperture radar (SAR) images formed with dechirp-on-receive data collection and rectangular format processing algorithm are the result of a two-dimensional discrete Fourier transform (DFT) applied to sampled data. There are several steps required to compute the range and Doppler values associated with each pixel in a SAR range-Doppler image. This memo walks readers through the process.

47 OTHER INSTRUMENTATION↗

Modeling and Simulation of Inrush Currents in Harmonic Domain

Modeling and simulation capabilities are critical to the stability analysis and evaluation of power distribution systems, with respect to the emphasis on resiliency, microgrids, and distributed energy resources. In this paper, a computational method in the harmonic domain is proposed for the periodic steady-state analysis of the nonlinear inrush current phenomenon. The efficient inrush calculation facilitates the predictions of current amplitudes for the power system operation and control. To demonstrate the accuracy and efficiency, simulation results in the harmonic domain are compared with results from PSCAD in an electromagnetic timescale, as well as the authors’ previous works in the frequency-domain. Impacts of the settings of both offset flux and interested harmonic order are discussed. In addition, within the proposed harmonic-domain method, a general approach that utilizes the discrete Fourier transform to obtain the response of a nonlinear device from a stimulus represented in the frequency-domain is utilized. This method can also be extended to perform the transient analysis in future, using trapezoidal rule for the integration.

Xie, Jing↗