Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 73 records · Page 4

P3DFFT: A Framework for Parallel Computations of Fourier Transforms in Three Dimensions

Fourier and related transforms are a family of algorithms widely employed in diverse areas of computational science, notoriously difficult to scale on high-performance parallel computers with a large number of processing elements (cores). This paper introduces a popular software package called P3DFFT which implements fast Fourier transforms (FFTs) in three dimensions in a highly efficient and scalable way. It overcomes a well-known scalability bottleneck of three-dimensional (3D) FFT implementations by using two-dimensional domain decomposition. Designed for portable performance, P3DFFT achieves excellent timings for a number of systems and problem sizes. On a Cray XT5 system P3DFFT attains 45% efficiency in weak scaling from 128 to 65,536 computational cores. Library features include Fourier and Chebyshev transforms, Fortran and C interfaces, in- and out-of-place transforms, uneven data grids, and single and double precision. P3DFFT is available as open source at http://code.google.com/p/p3dfft/. This paper discusses P3DFFT implementation and performance in a way that helps guide the user in making optimal choices for parameters of their runs. Read More: https://epubs.siam.org/doi/10.1137/11082748X

Mathematics↗

Fast Fourier Transform algorithm design and tradeoffs

The Fast Fourier Transform (FFT) is a mainstay of certain numerical techniques for solving fluid dynamics problems. The Connection Machine CM-2 is the target for an investigation into the design of multidimensional Single Instruction Stream/Multiple Data (SIMD) parallel FFT algorithms for high performance. Critical algorithm design issues are discussed, necessary machine performance measurements are identified and made, and the performance of the developed FFT programs are measured. Fast Fourier Transform programs are compared to the currently best Cray-2 FFT program.

Kamin, Ray A., III↗

On Eigenfunctions of the Fourier Transform

A nontrivial example of an eigenfunction in the sense of the theory of distributions for the planar Fourier transform was described by the authors in their previous work. In this paper, a method for obtaining other eigenfunctions is proposed. Positive homogeneous distributions in ℝ{sup n} of order −n/2 are considered, and it is shown that F(ω)|x|{sup −n/2}, |ω| = 1, is an eigenfunction in the sense of the theory of distributions of the Fourier transform if and only if F(ω) is an eigenfunction of a certain singular integral operator on the unit sphere of ℝ{sup n}. Since Y{sub m,n}{sup (k)}(ω)|x|{sup −n/2}, where Y{sub m,n}{sup (k)} denote the spherical functions of order m in ℝ{sup n}, are eigenfunctions of the Fourier transform, it follows that Y{sub m,n}{sup (k)} are eigenfunctions of the above-mentioned singular integral operator. In the planar case, all eigenfunctions of the Fourier transform of the form F(ω)|x|{sup −1} are described by means of the Fourier coefficients of F(ω).

97 MATHEMATICS AND COMPUTING↗

Integrated optics in an electrically scanned imaging Fourier transform spectrometer

An efficient, lightweight and stable, Fourier transform spectrometer was developed. The mechanical slide mechanism needed to create a path difference was eliminated by the use of retro-reflecting mirrors in a monolithic interferometer assembly in which the mirrors are not at 90 degrees to the propagation vector of the radiation, but rather at a small angle. The resulting plane wave fronts create a double-sided inteferogram of the source irradiance distribution which is detected by a charge-coupled device image sensor array. The position of each CCD pixel in the array is an indication of the path difference between the two retro-reflecting mirrors in the monolithic optical structure. The Fourier transform of the signals generated by the image sensor provide the spectral irradiance distribution of the source. For imaging, the interferometer assembly scans the source of irradiation by moving the entire instrument, such as would occur if it was fixedly mounted to a moving platform, i.e., a spacecraft. During scanning, the entrace slot to the monolithic optical structure sends different pixels to corresponding interferograms detected by adjacent columns of pixels of the image sensor.

Breckinridge, James B.↗

Far-field radiation patterns of aperture antennas by the Winograd Fourier transform algorithm

A more time-efficient algorithm for computing the discrete Fourier transform, the Winograd Fourier transform (WFT), is described. The WFT algorithm is compared with other transform algorithms. Results indicate that the WFT algorithm in antenna analysis appears to be a very successful application. Significant savings in cpu time will improve the computer turn around time and circumvent the need to resort to weekend runs.

Heisler, R.↗

Geometric interpretations of the Discrete Fourier Transform (DFT)

One, two, and three dimensional Discrete Fourier Transforms (DFT) and geometric interpretations of their periodicities are presented. These operators are examined for their relationship with the two sided, continuous Fourier transform. Discrete or continuous transforms of real functions have certain symmetry properties. The symmetries are examined for the one, two, and three dimensional cases. Extension to higher dimension is straight forward.

Campbell, C. W.↗

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↗

Entanglement of periodic states, the quantum Fourier transform, and Shor's factoring algorithm

The preprocessing stage of Shor's algorithm generates a class of quantum states referred to as periodic states, on which the quantum Fourier transform is applied. Such states also play an important role in other quantum algorithms that rely on the quantum Fourier transform. Since entanglement is believed to be a necessary resource for quantum computational speedup, we analyze the entanglement of periodic states and the way it is affected by the quantum Fourier transform. To this end, we derive a formula that evaluates the Groverian entanglement measure for periodic states. Using this formula, we explain the surprising result that the Groverian entanglement of the periodic states built up during the preprocessing stage is only slightly affected by the quantum Fourier transform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

IR spectroscopic characteristics of cell cycle and cell death probed by synchrotron radiation based Fourier transform IR spectromicroscopy

Synchrotron radiation based Fourier transform IR (SR-FTIR) spectromicroscopy allows the study of individual living cells with a high signal to noise ratio. Here we report the use of the SR-FTIR technique to investigate changes in IR spectral features from individual human lung fibroblast (IMR-90) cells in vitro at different points in their cell cycle. Clear changes are observed in the spectral regions corresponding to proteins, DNA, and RNA as a cell changes from the G(1)-phase to the S-phase and finally into mitosis. These spectral changes include markers for the changing secondary structure of proteins in the cell, as well as variations in DNA/RNA content and packing as the cell cycle progresses. We also observe spectral features that indicate that occasional cells are undergoing various steps in the process of cell death. The dying or dead cell has a shift in the protein amide I and II bands corresponding to changing protein morphologies, and a significant increase in the intensity of an ester carbonyl C===O peak at 1743 cm(-1) is observed. Copyright John Wiley & Sons, Inc. Biopolymers (Biospectroscopy) 57: 329-335, 2000.

Non-NASA Center↗

Alternative path to the boundary: The CFT as the Fourier transform in AdS space

In this paper we shed new light on the AdS/CFT duality by interpreting the CFT as the Fourier transform in AdS space. We make use of well-known integral geometry techniques to derive the Fourier transformation of a function defined on the AdS hyperboloid. We show that the Fourier transformation of a function on the hyperboloid is a function defined on the boundary. We find that the Green's functions from the literature are actually the Fourier weights (i.e. plane wave solutions) of the transformation and that the boundary values of fields appearing in the correspondence are the Fourier components of the transformation. One is thus left to interpret the CFT as the quantized version of a classical theory in AdS and the dual operator as the Fourier coefficients. Group theoretic considerations are discussed in relation to the transformation and its potential use in constructing QCD-like theories. In addition, we consider possible implications involving understanding the dual of AdS black holes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Structure in the 3D Galaxy Distribution. III. Fourier Transforming the Universe: Phase and Power Spectra

We demonstrate the effectiveness of a relatively straightforward analysis of the complex 3D Fourier transform of galaxy coordinates derived from redshift surveys. Numerical demonstrations of this approach are carried out on a volume-limited sample of the Sloan Digital Sky Survey redshift survey. The direct unbinned transform yields a complex 3D data cube quite similar to that from the Fast Fourier Transform of finely binned galaxy positions. In both cases, deconvolution of the sampling window function yields estimates of the true transform. Simple power spectrum estimates from these transforms are roughly consistent with those using more elaborate methods. The complex Fourier transform characterizes spatial distributional properties beyond the power spectrum in a manner different from (and we argue is more easily interpreted than) the conventional multipoint hierarchy. We identify some threads of modern large-scale inference methodology that will presumably yield detections in new wider and deeper surveys.

Galaxies↗

Structure in the 3D Galaxy Distribution. III. Fourier Transforming the Universe: Phase and Power Spectra

We demonstrate the effectiveness of a relatively straightforward analysis of the complex 3D Fourier transform of galaxy coordinates derived from redshift surveys. Numerical demonstrations of this approach are carried out on a volume-limited sample of the Sloan Digital Sky Survey redshift survey. The direct unbinned transform yields a complex 3D data cube quite similar to that from the Fast Fourier Transform of finely binned galaxy positions. In both cases, deconvolution of the sampling window function yields estimates of the true transform. Simple power spectrum estimates from these transforms are roughly consistent with those using more elaborate methods. The complex Fourier transform characterizes spatial distributional properties beyond the power spectrum in a manner different from (and we argue is more easily interpreted than) the conventional multipoint hierarchy. We identify some threads of modern large-scale inference methodology that will presumably yield detections in new wider and deeper surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

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.↗

Fast Fourier Transform Spectral Analysis Program

Fast Fourier Transform Spectral Analysis Program is used in frequency spectrum analysis of postflight, space vehicle telemetered trajectory data. This computer program with a digital algorithm can calculate power spectrum rms amplitudes and cross spectrum of sampled parameters at even time increments.

Daniel, J. A., Jr.↗

Predicting the thermal/structural performance of the atmospheric trace molecules spectroscopy /ATMOS/ Fourier transform spectrometer

ATMOS is a Fourier transform spectrometer to measure atmospheric trace molecules over a spectral range of 2-16 microns. Assessment of the system performance of ATMOS includes evaluations of optical system errors induced by thermal and structural effects. In order to assess the optical system errors induced from thermal and structural effects, error budgets are assembled during system engineering tasks and line of sight and wavefront deformations predictions (using operational thermal and vibration environments and computer models) are subsequently compared to the error budgets. This paper discusses the thermal/structural error budgets, modelling and analysis methods used to predict thermal/structural induced errors and the comparisons that show that predictions are within the error budgets.

Miller, J. M.↗

Optimal Padding for the Two-Dimensional Fast Fourier Transform

One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that can benefit from this algorithm, including optics, image-processing, signal-processing, and engineering applications.

Dean, Bruce H.↗