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
NASA NTRS1999

CF2 Detection in Radio-Frequency Ar/CHF3 Plasmas by Fourier Transform Infrared Spectroscopy

CFx radicals, in particular CF2, are instrumental in anisotropic etching of SiO2. In order to optimize the CFx radical population in a given process environment, it is imperative that we understand their production mechanism. Towards this goal, we have conducted a series of quantitative measurements of CF2 radicals in low pressure RF plasmas similar to those used in SiO2 etching. In this study, we present preliminary results for Ar/CHF3 plasmas operating at pressures ranging from 10-50 mTorr and powers ranging from 100-500 W in the GEC reference cell, modified for inductive (transformer) coupling. Fourier transform infrared (FTIR) spectroscop) is used to observe the absorption features of the CF2 radical in the 1114 cm-1 and 1096 cm-1 spectral regions. The FTIR spectrometer is equipped with a high-sensitivity mercury cadmium telluride (MCT) detector and has afixed resolution of 0.125 cm- 1. The CF2 concentrations are measured for a range of operating pressures and discharge power levels, and are compared to measurements of the relative CF2 concentrations made by mass spectrometry using the method of appearance potential for radical selectivity.

Kim, J. S.↗
NASA NTRS1995

An algorithm for the basis of the finite Fourier transform

The Finite Fourier Transformation matrix (F.F.T.) plays a central role in the formulation of quantum mechanics in a finite dimensional space studied by the author over the past couple of decades. An outstanding problem which still remains open is to find a complete basis for F.F.T. In this paper we suggest a simple algorithm to find the eigenvectors of F.T.T.

Santhanam, Thalanayar S.↗
NASA NTRS1975

A study to analyze six band multispectral images and fabricate a Fourier transform detector

An automatic Fourier transform diffraction pattern sampling system, used to investigate techniques for forestry classification of six band multispectral aerial photography is presented. Photographs and diagrams of the design, development and fabrication of a hybrid optical-digital Fourier transform detector are shown. The detector was designed around a concentric ring fiber optic array. This array was formed from many optical fibers which were sorted into concentric rings about a single fiber. All the fibers in each ring were collected into a bundle and terminated into a single photodetector. An optical/digital interface unit consisting of a high level multiplexer, and an analog-to-digital amplifier was also constructed and is described.

Shackelford, R. G.↗
NASA NTRS1991

The fractional Fourier transform and applications

This paper describes the 'fractional Fourier transform', which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e exp -2(pi)i/n, the fractional Fourier transform is based on fractional roots of unity e exp -2(pi)i(alpha), where alpha is arbitrary. The fractional Fourier transform and the corresponding fast algorithm are useful for such applications as computing DFTs of sequences with prime lengths, computing DFTs of sparse sequences, analyzing sequences with noninteger periodicities, performing high-resolution trigonometric interpolation, detecting lines in noisy images, and detecting signals with linearly drifting frequencies. In many cases, the resulting algorithms are faster by arbitrarily large factors than conventional techniques.

Bailey, David H.↗
NASA NTRS2012

The Geostationary Fourier Transform Spectrometer

The Geostationary Fourier Transform Spectrometer (GeoFTS) is an imaging spectrometer designed for a geostationary orbit (GEO) earth science mission to measure key atmospheric trace gases and process tracers related to climate change and human activity. GEO allows GeoFTS to continuously stare at a region of the earth for frequent sampling to capture the variability of biogenic fluxes and anthropogenic emissions from city to continental spatial scales and temporal scales from diurnal, synoptic, seasonal to interannual. The measurement strategy provides a process based understanding of the carbon cycle from contiguous maps of carbon dioxide (CO2), methane (CH4), carbon monoxide (CO), and chlorophyll fluorescence (CF) collected many times per day at high spatial resolution (~2.7kmx2.7km at nadir). The CO2/CH4/CO/CF measurement suite in the near infrared spectral region provides the information needed to disentangle natural and anthropogenic contributions to atmospheric carbon concentrations and to minimize uncertainties in the flow of carbon between the atmosphere and surface. The half meter cube size GeoFTS instrument is based on a Michelson interferometer design that uses all high TRL components in a modular configuration to reduce complexity and cost. It is self-contained and as independent of the spacecraft as possible with simple spacecraft interfaces, making it ideal to be a "hosted" payload on a commercial communications satellite mission. The hosted payload approach for measuring the major carbon-containing gases in the atmosphere from the geostationary vantage point will affordably advance the scientific understating of carbon cycle processes and climate change.

atmospheric trace gases↗
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↗
NASA NTRS1992

A VLSI architecture for simplified arithmetic Fourier transform algorithm

The arithmetic Fourier transform (AFT) is a number-theoretic approach to Fourier analysis which has been shown to perform competitively with the classical FFT in terms of accuracy, complexity, and speed. Theorems developed in a previous paper for the AFT algorithm are used here to derive the original AFT algorithm which Bruns found in 1903. This is shown to yield an algorithm of less complexity and of improved performance over certain recent AFT algorithms. A VLSI architecture is suggested for this simplified AFT algorithm. This architecture uses a butterfly structure which reduces the number of additions by 25 percent of that used in the direct method.

Reed, Irving S.↗