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 433 records · Page 24

CNN-Based Phase Fault Classification in Real and Simulated Power Systems Data

This study proposes a convolutional neural network (CNN)–based two-step phase fault detection and identification method to classify anomalies in the power grid signal. Specifically, the first step checks the fault’s existence and determines the need for the second step. Subsequently, in the case of anomalies in the power grid signal, the second step identifies the type of fault, including line-to-line, single-line-to-ground, double-line-to-ground, and triple-line. Accordingly, the CNN architecture is both designed for the classification layers and trained with simulated data. To provide maximum prediction accuracy with minimum processing time, this study investigates the combinations of various feature extraction (FE) techniques, such as fast Fourier transform (FFT), amplitude and phase (AP), auto-correlation function, power spectral density, and wavelet transform (WT). Consequently, simulated and real-world results demonstrate that the proposed two-step method outperforms conventional one-step techniques, with the best performance obtained by using the combination of AP-AP, AP-WT, FFT-AP, and FFT-WT–based FE methods.

Alaca, Ozgur↗

Aspen: A Domain Specific Language for Performance Modeling

We present a new approach to analytical performance modeling using Aspen, a domain specific language. Aspen (Abstract Scalable Performance Engineering Notation) fills an important gap in existing performance modeling techniques and is designed to enable rapid exploration of new algorithms and architectures. It includes a formal specification of an application's performance behavior and an abstract machine model. We provide an overview of Aspen's features and demonstrate how it can be used to express a performance model for a three dimensional Fast Fourier Transform. We then demonstrate the composability and modularity of Aspen by importing and reusing the FFT model in a molecular dynamics model. We have also created a number of tools that allow scientists to balance application and system factors quickly and accurately.

Spafford, Kyle L↗

A Weakly Supervised Machine Learning Procedure for Magnet Quench Diagnostics

Voltage taps remain the standard and reliable diagnostic tool for detecting quenches in superconducting magnets. However, they identify a quench only at the time of voltage rise and do not provide information on earlier physical precursors. In this work, we investigate whether acoustic emission data can reveal precursor activity that occurs before conventional voltage detection using machine learning techniques. We introduce an event selection method and a weakly supervised machine learning procedure to learn data-driven criteria for identifying potential acoustic precursors to quenches. Two Convolutional Neural Network (CNN) architectures are trained: one on acoustic sensor events from our selection procedure and one on the Fast Fourier Transforms (FFTs) of these events. Both networks are trained iteratively using confidence-weighted loss functions to associate certain subsets of training data with a precursor label. We evaluate the performance of these models by examining the time distribution of events classified as potential precursors relative to the quench onset. Results indicate that the proposed approach can possibly distinguish acoustic emission events occurring closer to the quench from earlier acoustic activity during ramping, suggesting the potential for flagging quench precursors in acoustic data.

Khan, Maira [Fermilab] (ORCID:0009000891602387)↗

Multi-Scale Initial Conditions For Cosmological Simulations

We discuss a new algorithm to generate multi-scale initial conditions with multiple levels of refinements for cosmological 'zoom-in' simulations. The method uses an adaptive convolution of Gaussian white noise with a real-space transfer function kernel together with an adaptive multi-grid Poisson solver to generate displacements and velocities following first- (1LPT) or second-order Lagrangian perturbation theory (2LPT). The new algorithm achieves rms relative errors of the order of 10{sup -4} for displacements and velocities in the refinement region and thus improves in terms of errors by about two orders of magnitude over previous approaches. In addition, errors are localized at coarse-fine boundaries and do not suffer from Fourier-space-induced interference ringing. An optional hybrid multi-grid and Fast Fourier Transform (FFT) based scheme is introduced which has identical Fourier-space behaviour as traditional approaches. Using a suite of re-simulations of a galaxy cluster halo our real-space-based approach is found to reproduce correlation functions, density profiles, key halo properties and subhalo abundances with per cent level accuracy. Finally, we generalize our approach for two-component baryon and dark-matter simulations and demonstrate that the power spectrum evolution is in excellent agreement with linear perturbation theory. For initial baryon density fields, it is suggested to use the local Lagrangian approximation in order to generate a density field for mesh-based codes that is consistent with the Lagrangian perturbation theory instead of the current practice of using the Eulerian linearly scaled densities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Analysis of breathing cracks using vibrations

The influence of half-ellipse-shaped fatigue cracks and machined through-thickness cuts on the impact response of cantilever beam samples were analysed using the Finite Element Method and compared to experimental data for different crack depths. The effect of sample width was analysed for geometries with fatigue cracks (aspect ratio a/c = 0.45) and through-thickness cuts (rectangular cracks). The differences between both types of damage were analysed numerically and experimentally. The effect of sample width was studied and it was found that the behaviour of the cantilever with a fatigue-crack approaches that of the saw cut sample when the fatigue crack reaches the edges of the test piece. Acceleration data were analysed using the Fast Fourier Transform algorithm and Power Density Spectra (PSD) were obtained. For fatigue-cracked samples, harmonics of the frequencies of natural modes of oscillation were found. Analytical modelling was done using a mass-spring-damper system for studying the bilinear behaviour of the stiffness element. Harmonics found were assigned to the breathing behaviour of the crack. The detection threshold using frequency shifts inspection was twice as high as using spectral analysis. This would allow crack detection at half of the fatigue life of the specimen.

42 ENGINEERING↗

Capturing Pressure Oscillations in Numerical Simulations of Internal Combustion Engines

In an earlier publication, the authors compared numerical predictions of the mean cylinder pressure of diesel and dual-fuel combustion, to that of measured pressure data from a medium-speed, large-bore engine. In these earlier comparisons, measured data from a flush-mounted in-cylinder pressure transducer showed notable and repeatable pressure oscillations which were not evident in the mean cylinder pressure predictions from computational fluid dynamics (CFD). In this paper, the authors present a methodology for predicting and reporting the local cylinder pressure consistent with that of a measurement location. Such predictions for large-bore, medium-speed engine operation demonstrate pressure oscillations in accordance with those measured. The temporal occurrences of notable pressure oscillations were during the start of combustion and around the time of maximum cylinder pressure. With appropriate resolutions in time steps and mesh sizes, the local cell static pressure predicted for the transducer location showed oscillations in both diesel and dual-fuel combustion modes which agreed with those observed in the experimental data. Fast Fourier transform (FFT) analysis on both experimental and calculated pressure traces revealed that the CFD predictions successfully captured both the amplitude and frequency range of the oscillations. Furthermore, resolving propagating pressure waves with the smaller time steps and grid sizes necessary to achieve these results required a significant increase in computer resources.

33 ADVANCED PROPULSION SYSTEMS↗

Surge and Stall Detection Using Acoustic Analysis FOR GAS Turbine Hybrid Cycles

In this article compressor dynamics were studied in a gas turbine - fuel cell hybrid power system having a larger compressor volume than traditionally found in gas turbine systems. This larger compressor volume adversely affects the surge margin of the gas turbine. Industrial acoustic sensors were placed near the compressor to identify when the equipment was getting close to the surge line. Fast Fourier transform (FFT) mathematical analysis was used to obtain spectra representing the probability density across the frequency range (0 - 5000 Hz). Comparison between FFT spectra for nominal and transient operations revealed that higher amplitude spikes were observed during incipient stall at three different frequencies, 900, 1020, and 1800 Hz. These frequencies were compared to the natural frequencies of the equipment and the frequency for the rotating turbomachinery to identify more general nature of the acoustic signal typical of the onset of compressor surge. The primary goal of this acoustic analysis was to establish an online methodology to monitor compressor stability that can be anticipated and avoided.

42 ENGINEERING↗

Deposition of ultrathin AlN films for high frequency electroacoustic devices

The authors investigate the microstructure, crystal orientation, and residual stress of reactively sputtered aluminum nitride (AlN) films having thicknesses as low as 200 down to 25 nm. A two-step deposition process by the dual cathode ac (40 kHz) powered S-gun magnetron enabling better conditions for AlN nucleation on the surface of the molybdenum (Mo) bottom electrode was developed to enhance crystallinity of ultrathin AlN films. Using the two-step process, the residual in-plane stress as well as the stress gradient through the film thickness can be effectively controlled. X-ray rocking curve measurements have shown that ultrathin films grown on Mo using this technology are highly c-axis oriented with full widths at half maximum of 1.8 deg. and 3.1 deg. for 200- and 25-nm-thick films, respectively, which are equal to or even better than the results previously reported for relatively thick AlN films. High-resolution transmission electron microscopy and fast Fourier transform analyses have confirmed strong grain orientation in 25-100-nm-thick films. A fine columnar texture and a continuous lattice microstructure within a single grain from the interface with the Mo substrate through to the AlN surface have been elicited even in the 25-nm-thick film.

36 MATERIALS SCIENCE↗

Perfect crystal propagator for physical optics simulations with Synchrotron Radiation Workshop

Until now, a treatment of dynamical diffraction from perfect crystals has been missing in the "Synchrotron Radiation Workshop" (SRW) wavefront propagation computer code despite the widespread use of crystals on X-ray synchrotron beamlines. Now a special propagator" module for calculating dynamical diffraction from a perfect crystal in the Bragg case has been written in C++, integrated into the SRW C/C++ library and made available for simulations using the Python interface of SRW. The propagator performs local processing of the frequency-domain electric field in the angular representation. A 2-D Fast Fourier Transform is used for changing the field representation from/to the coordinate representation before and after applying the crystal propagator. This ensures seamless integration of the new propagator with the existing functionalities of the SRW package, allows compatibility with existing propagators for other optical elements, and enables the simulation of complex beamlines transporting partially coherent X-rays. The code has been benchmarked by comparison with predictions made by plane-wave and spherical-wave dynamical diffraction theory. Test simulations for a selection of X-ray synchrotron beamlines are also shown.

47 OTHER INSTRUMENTATION↗

A fully 3D approach for metal artifact reduction in computed tomography

Purpose: In computed tomography imaging metal objects in the region of interest introduce inconsistencies during data acquisition. Reconstructing these data leads to an image in spatial domain including star-shaped or stripe-like artifacts. In order to enhance the quality of the resulting image the influence of the metal objects can be reduced. Here, a metal artifact reduction (MAR) approach is proposed that is based on a recomputation of the inconsistent projection data using a fully three-dimensional Fourier-based interpolation. The success of the projection space restoration depends sensitively on a sensible continuation of neighboring structures into the recomputed area. Fortunately, structural information of the entire data is inherently included in the Fourier space of the data. This can be used for a reasonable recomputation of the inconsistent projection data. Methods: The key step of the proposed MAR strategy is the recomputation of the inconsistent projection data based on an interpolation using nonequispaced fast Fourier transforms (NFFT). The NFFT interpolation can be applied in arbitrary dimension. The approach overcomes the problem of adequate neighborhood definitions on irregular grids, since this is inherently given through the usage of higher dimensional Fourier transforms. Here, applications up to the third interpolation dimension are presented and validated. Furthermore, prior knowledge may be included by an appropriate damping of the transform during the interpolation step. This MAR method is applicable on each angular view of a detector row, on two-dimensional projection data as well as on three-dimensional projection data, e.g., a set of sequential acquisitions at different spatial positions, projection data of a spiral acquisition, or cone-beam projection data. Results: Results of the novel MAR scheme based on one-, two-, and three-dimensional NFFT interpolations are presented. All results are compared in projection data space and spatial domain with the well-known one-dimensional linear interpolation strategy. Conclusions: In conclusion, it is recommended to include as much spatial information into the recomputation step as possible. This is realized by increasing the dimension of the NFFT. The resulting image quality can be enhanced considerably.

60 APPLIED LIFE SCIENCES↗

SU-D-BRF-03: Improvement of TomoTherapy Megavoltage Topogram Image Quality for Automatic Registration During Patient Localization

Purpose: To improve the quality of mega-voltage orthogonal scout images (MV topograms) for a fast and low-dose alternative technique for patient localization on the TomoTherapy HiART system. Methods: Digitally reconstructed radiographs (DRR) of anthropomorphic head and pelvis phantoms were synthesized from kVCT under TomoTherapy geometry (kV-DRR). Lateral (LAT) and anterior-posterior (AP) aligned topograms were acquired with couch speeds of 1cm/s, 2cm/s, and 3cm/s. The phantoms were rigidly translated in all spatial directions with known offsets in increments of 5mm, 10mm, and 15mm to simulate daily positioning errors. The contrast of the MV topograms was automatically adjusted based on the image intensity characteristics. A low-pass fast Fourier transform filter removed high-frequency noise and a Weiner filter reduced stochastic noise caused by scattered radiation to the detector array. An intensity-based image registration algorithm was used to register the MV topograms to a corresponding kV-DRR by minimizing the mean square error between corresponding pixel intensities. The registration accuracy was assessed by comparing the normalized cross correlation coefficients (NCC) between the registered topograms and the kV-DRR. The applied phantom offsets were determined by registering the MV topograms with the kV-DRR and recovering the spatial translation of the MV topograms. Results: The automatic registration technique provided millimeter accuracy and was robust for the deformed MV topograms for three tested couch speeds. The lowest average NCC for all AP and LAT MV topograms was 0.96 for the head phantom and 0.93 for the pelvis phantom. The offsets were recovered to within 1.6mm and 6.5mm for the processed and the original MV topograms respectively. Conclusion: Automatic registration of the processed MV topograms to a corresponding kV-DRR recovered simulated daily positioning errors that were accurate to the order of a millimeter. These results suggest the clinical use of MV topograms as a promising alternative to MVCT patient alignment.

60 APPLIED LIFE SCIENCES↗

SU-E-I-41: Non-Cartesian MR Image Reconstruction with Integrated Gradient Non-Linearity Correction

Purpose: Nonlinearities in the spatial encoding gradients of MRI systems cause geometric distortion in images. Typically, this is retrospectively corrected via image-domain interpolation (a.k.a., “gradwarp”) albeit with a loss of spatial resolution. For non-Cartesian MRI, the latter problem is exaggerated by noise and undersampling artifact. In this study, we describe a novel correction strategy that accounts for gradient nonlinearities during — rather than after — non-Cartesian MRI reconstruction, and demonstrate that this approach mitigates the resolution loss that can occur with standard methods. Methods: To test the proposed method, the American College of Radiology (ACR) quality control phantom was scanned on at 1.5 T (General Electric, v16.0, “zoom” gradient) using a 1.6x undersampled 3D non- Cartesian Shells trajectory (GRE, FOV=24 cm3, 120 shells, 16552 shots, 512 readout, matrix=2403). Image reconstruction was first performed via standard k-space density-compensated gridding and retrospectively corrected via cubic spline interpolation. Image reconstruction was then separately performed using a k-space and image-domain densitycompensated type-3 non-uniform fast Fourier transform (NUFFT), which provides a direct mapping between non-Cartesian k-space samples and warped image space voxel locations. Thus, no separate distortion correction procedure is needed for the proposed approach. The gradient distortion field was determined using vendor provided calibration data. Results: Phantom scan results show that both processing approaches successfully correct geometric distortion. However, visual inspection of the ACR phantom spatial resolution inserts shows that the proposed strategy preserves the resolution of the nominal (uncorrected) reconstruction while “gradwarp” imparts marked spatial blurring (especially for the 1.0 and 1.1 mm inserts) and thus resolution loss. Conclusion: We've presented a novel reconstruction strategy for non-Cartesian MRI that corrects for gradient nonlinearities during — rather than after — reconstruction, and thus better preserves image resolution than traditional interpolation-based methods. This approach is expected to be especially advantageous when imaging with non-standard magnet geometries. NIH RR018898; NIH EB10065.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Efficient scatter distribution estimation and correction in CBCT using concurrent Monte Carlo fitting

Purpose: X-ray scatter is a significant impediment to image quality improvements in cone-beam CT (CBCT). The authors present and demonstrate a novel scatter correction algorithm using a scatter estimation method that simultaneously combines multiple Monte Carlo (MC) CBCT simulations through the use of a concurrently evaluated fitting function, referred to as concurrent MC fitting (CMCF). Methods: The CMCF method uses concurrently run MC CBCT scatter projection simulations that are a subset of the projection angles used in the projection set, P, to be corrected. The scattered photons reaching the detector in each MC simulation are simultaneously aggregated by an algorithm which computes the scatter detector response, S{sub MC}. S{sub MC} is fit to a function, S{sub F}, and if the fit of S{sub F} is within a specified goodness of fit (GOF), the simulations are terminated. The fit, S{sub F}, is then used to interpolate the scatter distribution over all pixel locations for every projection angle in the set P. The CMCF algorithm was tested using a frequency limited sum of sines and cosines as the fitting function on both simulated and measured data. The simulated data consisted of an anthropomorphic head and a pelvis phantom created from CT data, simulated with and without the use of a compensator. The measured data were a pelvis scan of a phantom and patient taken on an Elekta Synergy platform. The simulated data were used to evaluate various GOF metrics as well as determine a suitable fitness value. The simulated data were also used to quantitatively evaluate the image quality improvements provided by the CMCF method. A qualitative analysis was performed on the measured data by comparing the CMCF scatter corrected reconstruction to the original uncorrected and corrected by a constant scatter correction reconstruction, as well as a reconstruction created using a set of projections taken with a small cone angle. Results: Pearson’s correlation, r, proved to be a suitable GOF metric with strong correlation with the actual error of the scatter fit, S{sub F}. Fitting the scatter distribution to a limited sum of sine and cosine functions using a low-pass filtered fast Fourier transform provided a computationally efficient and accurate fit. The CMCF algorithm reduces the number of photon histories required by over four orders of magnitude. The simulated experiments showed that using a compensator reduced the computational time by a factor between 1.5 and 1.75. The scatter estimates for the simulated and measured data were computed between 35–93 s and 114–122 s, respectively, using 16 Intel Xeon cores (3.0 GHz). The CMCF scatter correction improved the contrast-to-noise ratio by 10%–50% and reduced the reconstruction error to under 3% for the simulated phantoms. Conclusions: The novel CMCF algorithm significantly reduces the computation time required to estimate the scatter distribution by reducing the statistical noise in the MC scatter estimate and limiting the number of projection angles that must be simulated. Using the scatter estimate provided by the CMCF algorithm to correct both simulated and real projection data showed improved reconstruction image quality.

60 APPLIED LIFE SCIENCES↗

High-resolution transmission electron microscopy for crystallographic study of nanomaterials

The potential of high-resolution transmission electron microscopy (including the quantitative computer processing of images and computer simulation) in a local analysis of nanomaterials is discussed. A number of examples of the application of fast Fourier transform and simulated high-resolution electronmicroscopy images in the identification of nanophases and the crystallographic study of nanocrystals and nanoparticles are considered. The role that B.K. Vainshtein played in the development of a unified approach for determination of the structure of materials using short-wave diffraction is indicated.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Theoretical modeling of the dynamics of a semiconductor laser subject to double-reflector optical feedback

We theoretically model the dynamics of semiconductor lasers subject to the double-reflector feedback. The proposed model is a new modification of the time-delay rate equations of semiconductor lasers under the optical feedback to account for this type of the double-reflector feedback. We examine the influence of adding the second reflector to dynamical states induced by the single-reflector feedback: periodic oscillations, period doubling, and chaos. Regimes of both short and long external cavities are considered. The present analyses are done using the bifurcation diagram, temporal trajectory, phase portrait, and fast Fourier transform of the laser intensity. We show that adding the second reflector attracts the periodic and perioddoubling oscillations, and chaos induced by the first reflector to a route-to-continuous-wave operation. During this operation, the periodic-oscillation frequency increases with strengthening the optical feedback. We show that the chaos induced by the double-reflector feedback is more irregular than that induced by the single-reflector feedback. The power spectrum of this chaos state does not reflect information on the geometry of the optical system, which then has potential for use in chaotic (secure) optical data encryption.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗