Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Fourier”

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

Programs for high-speed Fourier, Mellin and Fourier-Bessel transforms

Several FORTRAN program modules for performing one-dimensional and two-dimensional discrete Fourier transforms, Mellin, and Fourier-Bessel transforms are described along with programs that realize the algebra of high speed Fourier transforms on a computer. The programs can perform numerical harmonic analysis of functions, synthesize complex optical filters on a computer, and model holographic image processing methods.

Ikhabisimov, D. K.↗

A numerical method based on the Fourier-Fourier transform approach for modeling 1-D electron plasma evolution

A numerical method is presented for studying one-dimensional electron plasma evolution under typical interplanetary conditions. The method applies the Fourier-Fourier transform approach to a plasma model that is a generalization of the electrostatic Vlasov-Poisson system of equations. Conservation laws that are modified to include the plasma model generalization and also the boundary effects of nonperiodic solutions are given. A new conservation law for entropy in the transformed space is then introduced. These conservation laws are used to verify the numerical solutions. A discretization error analysis is presented. Two numerical instabilities and the methods used for their suppression are treated. It is shown that in interplanetary plasma conditions, the bump-on-tail instability produces significant excitation of plasma oscillations at the Bohm-Gross frequency and its second harmonic. An explanation of the second harmonic excitation is given in terms of wave-wave coupling during the growth phase of the instability.

Klimas, A. J.↗

Causal Correlation Functions and Fourier Transforms: Application in Calculating Pressure Induced Shifts

By adopting a concept from signal processing, instead of starting from the correlation functions which are even, one considers the causal correlation functions whose Fourier transforms become complex. Their real and imaginary parts multiplied by 2 are the Fourier transforms of the original correlations and the subsequent Hilbert transforms, respectively. Thus, by taking this step one can complete the two previously needed transforms. However, to obviate performing the Cauchy principal integrations required in the Hilbert transforms is the greatest advantage. Meanwhile, because the causal correlations are well-bounded within the time domain and band limited in the frequency domain, one can replace their Fourier transforms by the discrete Fourier transforms and the latter can be carried out with the FFT algorithm. This replacement is justified by sampling theory because the Fourier transforms can be derived from the discrete Fourier transforms with the Nyquis rate without any distortions. We apply this method in calculating pressure induced shifts of H2O lines and obtain more reliable values. By comparing the calculated shifts with those in HITRAN 2008 and by screening both of them with the pair identity and the smooth variation rules, one can conclude many of shift values in HITRAN are not correct.

correlation function↗

The application of an optical Fourier spectrum analyzer on detecting defects in mass-produced satellite photographs

Various defects in mass-produced pictures transmitted to earth from a satellite are investigated. It is found that the following defects are readily detectable via Fourier spectrum analysis: (1) bit slip, (2) breakup causing loss of image, and (3) disabled track at the top of the imagery. The scratches made on the film during mass production, which are difficult to detect by visual observation, also show themselves readily in Fourier spectrum analysis. A relation is established between the number of scratches, their width and depth and the intensity of their Fourier spectra. Other defects that are found to be equally suitable for Fourier spectrum analysis or visual (image analysis) detection are synchronous loss without blurring of image, and density variation in gray scale. However, the Fourier spectrum analysis is found to be unsuitable for detection of such defects as pin holes, annotation error, synchronous loss with blurring of images, and missing image in the beginning of the work order. The design of an automated, real time system, which will reject defective films, is treated.

Athale, R.↗

Fourier analysis and signal processing by use of the Moebius inversion formula

A novel Fourier technique for digital signal processing is developed. This approach to Fourier analysis is based on the number-theoretic method of the Moebius inversion of series. The Fourier transform method developed is shown also to yield the convolution of two signals. A computer simulation shows that this method for finding Fourier coefficients is quite suitable for digital signal processing. It competes with the classical FFT (fast Fourier transform) approach in terms of accuracy, complexity, and speed.

Reed, Irving S.↗

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

Rational trigonometric approximations using Fourier series partial sums

A class of approximations (S(sub N,M)) to a periodic function f which uses the ideas of Pade, or rational function, approximations based on the Fourier series representation of f, rather than on the Taylor series representation of f, is introduced and studied. Each approximation S(sub N,M) is the quotient of a trigonometric polynomial of degree N and a trigonometric polynomial of degree M. The coefficients in these polynomials are determined by requiring that an appropriate number of the Fourier coefficients of S(sub N,M) agree with those of f. Explicit expressions are derived for these coefficients in terms of the Fourier coefficients of f. It is proven that these 'Fourier-Pade' approximations converge point-wise to (f(x(exp +))+f(x(exp -)))/2 more rapidly (in some cases by a factor of 1/k(exp 2M)) than the Fourier series partial sums on which they are based. The approximations are illustrated by several examples and an application to the solution of an initial, boundary value problem for the simple heat equation is presented.

Geer, James F.↗

Reduction and coding of synthetic aperture radar data with Fourier transforms

Recently, aboard the Space Radar Laboratory (SRL), the two roles of Fourier Transforms for ocean image synthesis and surface wave analysis have been implemented with a dedicated radar processor to significantly reduce Synthetic Aperture Radar (SAR) ocean data before transmission to the ground. The object was to archive the SAR image spectrum, rather than the SAR image itself, to reduce data volume and capture the essential descriptors of the surface wave field. SAR signal data are usually sampled and coded in the time domain for transmission to the ground where Fourier Transforms are applied both to individual radar pulses and to long sequences of radar pulses to form two-dimensional images. High resolution images of the ocean often contain no striking features and subtle image modulations by wind generated surface waves are only apparent when large ocean regions are studied, with Fourier transforms, to reveal periodic patterns created by wind stress over the surface wave field. Major ocean currents and atmospheric instability in coastal environments are apparent as large scale modulations of SAR imagery. This paper explores the possibility of computing complex Fourier spectrum codes representing SAR images, transmitting the coded spectra to Earth for data archives and creating scenes of surface wave signatures and air-sea interactions via inverse Fourier transformations with ground station processors.

Tilley, David G.↗

Electro-Optical Imaging Fourier-Transform Spectrometer

An electro-optical (E-O) imaging Fourier-transform spectrometer (IFTS), now under development, is a prototype of improved imaging spectrometers to be used for hyperspectral imaging, especially in the infrared spectral region. Unlike both imaging and non-imaging traditional Fourier-transform spectrometers, the E-O IFTS does not contain any moving parts. Elimination of the moving parts and the associated actuator mechanisms and supporting structures would increase reliability while enabling reductions in size and mass, relative to traditional Fourier-transform spectrometers that offer equivalent capabilities. Elimination of moving parts would also eliminate the vibrations caused by the motions of those parts. Figure 1 schematically depicts a traditional Fourier-transform spectrometer, wherein a critical time delay is varied by translating one the mirrors of a Michelson interferometer. The time-dependent optical output is a periodic representation of the input spectrum. Data characterizing the input spectrum are generated through fast-Fourier-transform (FFT) post-processing of the output in conjunction with the varying time delay.

Chao, Tien-Hsin↗

Two Dimensional Symmetric Correlation Functions of the S Operator and Two Dimensional Fourier Transforms: Considering the Line Coupling for P and R Lines of Linear Molecules

The refinement of the Robert-Bonamy (RB) formalism by considering the line coupling for isotropic Raman Q lines of linear molecules developed in our previous study [Q. Ma, C. Boulet, and R. H. Tipping, J. Chem. Phys. 139, 034305 (2013)] has been extended to infrared P and R lines. In these calculations, the main task is to derive diagonal and off-diagonal matrix elements of the Liouville operator iS1 − S2 introduced in the formalism. When one considers the line coupling for isotropic Raman Q lines where their initial and final rotational quantum numbers are identical, the derivations of off-diagonal elements do not require extra correlation functions of the ^S operator and their Fourier transforms except for those used in deriving diagonal elements. In contrast, the derivations for infrared P and R lines become more difficult because they require a lot of new correlation functions and their Fourier transforms. By introducing two dimensional correlation functions labeled by two tensor ranks and making variable changes to become even functions, the derivations only require the latters' two dimensional Fourier transforms evaluated at two modulation frequencies characterizing the averaged energy gap and the frequency detuning between the two coupled transitions. With the coordinate representation, it is easy to accurately derive these two dimensional correlation functions. Meanwhile, by using the sampling theory one is able to effectively evaluate their two dimensional Fourier transforms. Thus, the obstacles in considering the line coupling for P and R lines have been overcome. Numerical calculations have been carried out for the half-widths of both the isotropic Raman Q lines and the infrared P and R lines of C2H2 broadened by N2. In comparison with values derived from the RB formalism, new calculated values are significantly reduced and become closer to measurements.

infrared radiation↗

Fourier removal of stripe artifacts in IRAS images

By working in the Fourier plane, approximate removal of stripe artifacts in IRAS images can be effected. The image of interest is smoothed and subtracted from the original, giving the high-spatial-frequency part. This 'filtered' image is then clipped to remove point sources and then Fourier transformed. Subtracting the Fourier components contributing to the stripes in this image from the Fourier transform of the original and transforming back to the image plane yields substantial removal of the stripes.

Van Buren, Dave↗

Resolution properties of the Fourier method for discontinuous waves

In this paper we discuss the wave-resolution properties of the Fourier approximations of a wave function with discontinuities. It is well known that a minimum of two points per wave is needed to resolve a periodic wave function using Fourier expansions. For Chebyshev approximations of a wave function, a minimum of pi points per wave is needed. Here we obtain an estimate for the minimum number of points per wave to resolve a discontinuous wave based on its Fourier coefficients. In our recent work on overcoming the Gibbs phenomenon, we have shown that the Fourier coefficients of a discontinuous function contain enough information to reconstruct with exponential accuracy the coefficient of a rapidly converging Gegenbauer expansion. We therefore study the resolution properties of a Gegenbauer expansion where both the number of terms and the order increase.

Gottlieb, David↗

Exponential Approximations Using Fourier Series Partial Sums

The problem of accurately reconstructing a piece-wise smooth, 2(pi)-periodic function f and its first few derivatives, given only a truncated Fourier series representation of f, is studied and solved. The reconstruction process is divided into two steps. In the first step, the first 2N + 1 Fourier coefficients of f are used to approximate the locations and magnitudes of the discontinuities in f and its first M derivatives. This is accomplished by first finding initial estimates of these quantities based on certain properties of Gibbs phenomenon, and then refining these estimates by fitting the asymptotic form of the Fourier coefficients to the given coefficients using a least-squares approach. It is conjectured that the locations of the singularities are approximated to within O(N(sup -M-2), and the associated jump of the k(sup th) derivative of f is approximated to within O(N(sup -M-l+k), as N approaches infinity, and the method is robust. These estimates are then used with a class of singular basis functions, which have certain 'built-in' singularities, to construct a new sequence of approximations to f. Each of these new approximations is the sum of a piecewise smooth function and a new Fourier series partial sum. When N is proportional to M, it is shown that these new approximations, and their derivatives, converge exponentially in the maximum norm to f, and its corresponding derivatives, except in the union of a finite number of small open intervals containing the points of singularity of f. The total measure of these intervals decreases exponentially to zero as M approaches infinity. The technique is illustrated with several examples.

Banerjee, Nana S.↗

Mathematical Investigation of Gamma Ray and Neutron Absorption Grid Patterns for Homeland Defense Related Fourier Imaging Systems

Terrorist suitcase nuclear devices typically using converted Soviet tactical nuclear warheads contain several kilograms of plutonium. This quantity of plutonium emits a significant number of gamma rays and neutrons as it undergoes radioactive decay. These gamma rays and neutrons normally penetrate ordinary matter to a significant distance. Unfortunately this penetrating quality of the radiation makes imaging with classical optics impractical. However, this radiation signature emitted by the nuclear source may be sufficient to be imaged from low-flying aerial platforms carrying Fourier imaging systems. The Fourier imaging system uses a pair of co-aligned absorption grids to measure a selected range of spatial frequencies from an object. These grids typically measure the spatial frequency in only one direction at a time. A grid pair that looks in all directions simultaneously would be an improvement over existing technology. A number of grid pairs governed by various parameters were investigated to solve this problem. By examining numerous configurations, it became apparent that an appropriate spiral pattern could be made to work. A set of equations was found to describe a grid pattern that produces straight fringes. Straight fringes represent a Fourier transform of a point source at infinity. An inverse Fourier transform of this fringe pattern would provide an accurate image (location and intensity) of a point source.

Boccio, Dona↗

A Discussion of the Discrete Fourier Transform Execution on a Typical Desktop PC

This paper will discuss and compare the execution times of three examples of the Discrete Fourier Transform (DFT). The first two examples will demonstrate the direct implementation of the algorithm. In the first example, the Fourier coefficients are generated at the execution of the DFT. In the second example, the coefficients are generated prior to execution and the DFT coefficients are indexed at execution. The last example will demonstrate the Cooley- Tukey algorithm, better known as the Fast Fourier Transform. All examples were written in C executed on a PC using a Pentium 4 running at 1.7 Ghz. As a function of N, the total complex data size, the direct implementation DFT executes, as expected at order of N2 and the FFT executes at order of N log2 N. At N=16K, there is an increase in processing time beyond what is expected. This is not caused by implementation but is a consequence of the effect that machine architecture and memory hierarchy has on implementation. This paper will include a brief overview of digital signal processing, along with a discussion of contemporary work with discrete Fourier processing.

White, Michael J.↗

Rotational-translational fourier imaging system requiring only one grid pair

The sky contains many active sources that emit X-rays, gamma rays, and neutrons. Unfortunately hard X-rays, gamma rays, and neutrons cannot be imaged by conventional optics. This obstacle led to the development of Fourier imaging systems. In early approaches, multiple grid pairs were necessary in order to create rudimentary Fourier imaging systems. At least one set of grid pairs was required to provide multiple real components of a Fourier derived image, and another set was required to provide multiple imaginary components of the image. It has long been recognized that the expense associated with the physical production of the numerous grid pairs required for Fourier imaging was a drawback. Herein one grid pair (two grids), with accompanying rotation and translation, can be used if one grid has one more slit than the other grid, and if the detector is modified.

Campbell, Jonathan W.↗