SEARCH · Engineering Papers

Results for “fast Fourier transform (FFT)”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Fast Quasi-Static Time-Series Simulation for Accurate PV Inverter Semiconductor Fatigue Analysis with a Long-Term Solar Profile

Power system simulations with long-term data typically have large time steps varying from one second to a few minutes. However, for PV inverter semiconductors, the minimum thermal stress cycle occurs over the fundamental grid frequency (50 or 60 Hz). This requires the time step of the fatigue simulation to be around 100 µs. This small time step requires long computation times to process yearly power production profiles. This paper proposes a fast fatigue simulation for inverter semiconductors using the quasi-static time series (QSTS) simulation concept. The proposed simulation calculates the steady state of the semiconductor junction temperature by using a Fast Fourier Transform (FFT). The small thermal cycling during a switching period and even over the fundamental waveform is disregarded to further accelerate the simulation speed. The resulting time step of the fatigue simulation is 15 minutes, which is consistent with the solar dataset. The error of the proposed simulation is 0.16% compared to the fatigue simulation results using the complete thermal stress profile. A PV inverter that responds to a Transactive Energy System (TES) is simulated to demonstrate the use of the proposed fatigue simulation. The proposed simulation has the potential to co-simulate with system level simulation tools that also adopt the QSTS concept.

Liu, Yunting↗

DOE OSTI2021

Active Compensation of Radiation Effects on Optical Fibers for Sensing Applications

Neutron and gamma irradiation is known to compact silica, resulting in macroscopic changes in refractive index (RI) and geometric structure. The change in RI and linear compaction in a radiation environment is caused by three well-known mechanisms: (i) radiation-induced attenuation (RIA), (ii) radiation-induced compaction (RIC), and (iii) radiation-induced emission (RIE). These macroscopic changes induce errors in monitoring physical parameters such as temperature, pressure, and strain in optical fiber-based sensors, which limit their application in radiation environments. We present a cascaded Fabry–Perot interferometer (FPI) technique to measure macroscopic properties, such as radiation-induced change in RI and length compaction in real time to actively account for sensor drift. The proposed cascaded FPI consists of two cavities: the first cavity is an air cavity, and the second is a silica cavity. The length compaction from the air cavity is used to deduce the RI change within the silica cavity. We utilize fast Fourier transform (FFT) algorithm and two bandpass filters for the signal extraction of each cavity. Inclusion of such a simple cascaded FPI structure will enable accurate determination of physical parameters under the test.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2020

A Numerical Method for Determining the Elements of Circumbinary Orbits and Its Application to Circumbinary Planets and the Satellites of Pluto-Charon

Planets and satellites orbiting a binary system exist in the solar system and extrasolar planetary systems. Their orbits can be significantly different from Keplerian orbits, if they are close to the binary and the secondary-to-primary mass ratio is high. A proper description of a circumbinary orbit is in terms of the free eccentricity e {sub free} at the epicyclic frequency κ {sub 0}, forced eccentricity e {sub forced} at the mean motion n {sub 0}, and oscillations at higher frequencies forced by the non-axisymmetric components of the binary’s potential. We show that accurate numerical values for the amplitudes and frequencies of these terms can be extracted from numerical orbit integrations by applying fast Fourier transformation (FFT) to the cylindrical distance between the circumbinary object and the center of mass of the binary as a function of time. We apply this method to three Kepler circumbinary planets and the satellites of Pluto-Charon. For the satellite Styx of Pluto-Charon, the FFT results for κ {sub 0} and e {sub free} differ significantly from the first-order analytic value and the value reported by Showalter & Hamilton, respectively. We show that the deviation in κ {sub 0} is likely due to the effect of the 3:1 mean-motion resonance and discuss the implications of the lower value for e {sub free}.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1972

The k-space formulation of the n-dimensional scattering problem

The n-dimensional scattering problem is solved by means of a k-space formulation of the field equations, thereby replacing the conventional integral equation formulation by a set of two algebraic equations in two unknowns in two spaces (the constitutive equation being an algebraic equation in x-space). These equations are solved by an iterative method with the aid of the fast Fourier transform (FFT) algorithm connecting the two spaces, requiring very simple initial approximations. Since algebraic and FFT equations are used, the number of arithmetic multiple-add operations and storage allocations required for a numerical solution are reduced from the order of N sq (for solving the matrix equations resulting from the conventional integral equations) to the order of N(log base 2 of N) and N, respectively (where N is the number of data points required for the specification of the problem). The advantage gained in speed and storage is thus of the order of N/log base 2 of N and N, respectively. This method is thus considerably more efficient than the conventional matrix method, and permits exact numerical solutions for much larger problems. Arguments are presented toward the view that the field equations are more fundamental in k-space. The details and some numerical results of the application of this method to the three-dimensional electromagnetic scattering problems are presented as an example.

Bojarski, N. N.↗

NASA NTRS1973

Digital processing of radiographic images

Some techniques are presented and the software documentation for the digital enhancement of radiographs. Both image handling and image processing operations are considered. The image handling operations dealt with are: (1) conversion of format of data from packed to unpacked and vice versa; (2) automatic extraction of image data arrays; (3) transposition and 90 deg rotations of large data arrays; (4) translation of data arrays for registration; and (5) reduction of the dimensions of data arrays by integral factors. Both the frequency and the spatial domain approaches are presented for the design and implementation of the image processing operation. It is shown that spatial domain recursive implementation of filters is much faster than nonrecursive implementations using fast fourier transforms (FFT) for the cases of interest in this work. The recursive implementation of a class of matched filters for enhancing image signal to noise ratio is described. Test patterns are used to illustrate the filtering operations. The application of the techniques to radiographic images of metallic structures is demonstrated through several examples.

Bond, A. D.↗

NASA NTRS1976

Computation of scalar far-field patterns of large-aperture antennas

In computer programs used for evaluating the performance of high-gain antennas, efficient numerical methods for calculating the far-field patterns must be used since the majority of computer time and storage requirements may be attributed to this phase of the program. The numerical method most frequently used is the Fast Fourier Transform (FFT), which computes the far field as the Fourier transform of the field distribution in the antenna aperture. A new numerical method that in many applications is superior to the FFT in terms of reducing computer time and storage requirements is described.

Omalley, T. A.↗

NASA NTRS1975

Application of Fourier transforms for microwave radiometric inversions

Existing microwave radiometer technology now provides a suitable method for remote determination of the ocean surface's absolute brightness temperature. To extract the brightness temperature of the water from the antenna temperature, an unstable Fredholm integral equation of the first kind is solved. Fourier transform techniques are used to invert the integral after it is placed into a cross correlation form. Application and verification of the methods to a two-dimensional modeling of a laboratory wave tank system are included. The instability of the ill-posed Fredholm equation is examined and a restoration procedure is included which smooths the resulting oscillations. With the recent availability and advances of fast Fourier transform (FFT) techniques, the method presented becomes very attractive in the evaluation of large quantities of data.

Holmes, J. J.↗

NASA NTRS1976

The fast decoding of Reed-Solomon codes using number theoretic transforms

It is shown that Reed-Solomon (RS) codes can be encoded and decoded by using a fast Fourier transform (FFT) algorithm over finite fields. The arithmetic utilized to perform these transforms requires only integer additions, circular shifts and a minimum number of integer multiplications. The computing time of this transform encoder-decoder for RS codes is less than the time of the standard method for RS codes. More generally, the field GF(q) is also considered, where q is a prime of the form K x 2 to the nth power + 1 and K and n are integers. GF(q) can be used to decode very long RS codes by an efficient FFT algorithm with an improvement in the number of symbols. It is shown that a radix-8 FFT algorithm over GF(q squared) can be utilized to encode and decode very long RS codes with a large number of symbols. For eight symbols in GF(q squared), this transform over GF(q squared) can be made simpler than any other known number theoretic transform with a similar capability. Of special interest is the decoding of a 16-tuple RS code with four errors.

Reed, I. S.↗

NASA NTRS1976

The fast decoding of Reed-Solomon codes using high-radix fermat theoretic transforms

Fourier-like transforms over GF(F sub n), where F sub n = 2(2n) + 1 is a Fermat prime, are applied in decoding Reed-Solomon codes. It is shown that such transforms can be computed using high-radix fast Fourier transform (FFT) algorithms requiring considerably fewer multiplications than the more usual radix 2 FFT algorithm. A special 256-symbol, 16-symbol-error-correcting, Reed-Solomon (RS) code for space communication-link applications can be encoded and decoded using this high-radix FFT algorithm over GF(F sub 3).

Liu, K. Y.↗

NASA NTRS1976

A digital system to produce imagery from SAR data

This paper describes a digital processing algorithm and its associated system design for producing images from Synthetic Aperture Radar (SAR) data. The proposed system uses the Fast Fourier Transform (FFT) approach to perform the two-dimensional correlation process. The range migration problem, which is often a major obstacle to efficient processing, can be alleviated by approximating the locus of echoes from a point target by several linear segments. SAR data corresponding to each segment is correlated separately, and the results are coherently summed to produce full-resolution images. This processing approach exhibits greatly improved computation efficiency relative to conventional digital processing methods.

Wu, C.↗

NASA NTRS1976

Dynamic analysis of a class of mixed lumped-distributed parameter systems via numerical techniques

The modeling via transfer matrices of mixed lumped-distributed parameter systems with feedback control is discussed and novel methods of obtaining information on the controlled system's dynamic response via numerical methods is presented. These methods utilize numerical searches in the complex plane for the roots of the transcendental characteristic equation to determine the closed loop system eigenvalues. The fast Fourier transform (FFT) algorithm is utilized but in the inverse fashion (from frequency domain to time domain). The information obtained is identical to that contained in a model in modal coordinates, and can be used to construct such a model. An interactive computer program to do the required calculation is described, as well as its application to a manipulator arm design problem.

Book, W. J.↗

NASA NTRS1978

JPL 2-to-the-20th-power channel 300 MHz bandwidth digital spectrum analyzer

A million (two to the 20th power) channel, 300 MHz bandwidth, digital spectrum analyzer was considered. The design, fabrication, and maintenance philosophy of the modular, pipelined, fast fourier transform (FFT) hardware are described. The spectrum analyzer will be used to examine the region from 1.4 GHz to 26 GHz for radio frequency interference which may be harmful to present and future tracking missions of the Deep Space Network. The design has application to the search for extraterrestrial intelligence signals and radio science phenomena.

Morris, G. A., Jr.↗

NASA NTRS1977

High-radix transforms for Reed-Solomon codes over Fermat primes

A method is proposed to streamline the transform decoding algorithm for Reed-Solomon (RS) codes of length equal to 2 raised to the power 2n. It is shown that a high-radix fast Fourier transform (FFT) type algorithm with generator equal to 3 on GF(F sub n), where F sub n is a Fermat prime, can be used to decode RS codes of this length. For a 256-symbol RS code, a radix 4 and radix 16 FFT over GF(F sub 3) require, respectively, 30 and 70% fewer modulo F sub n multiplications than the usual radix 2 FFT.

Liu, K. Y.↗

NASA NTRS1978

The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions

It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fields GF(F sub n), where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.

Reed, I. S.↗

NASA NTRS1978

Experimental clean combustor program: Phase 3: Turbulence measurement addendum

Airflow turbulence parameters were measured in the high pressure, high temperature flow stream leaving the compressor of an operating gas turbine engine. A water cooled hot film turbulence probe was used to determine the turbulence intensity and length scale in the compressor exit flow stream of the CF6-50 engine. Data were obtained only at idle operating conditions. At engine power levels above idle conditions, durability problems and erratic data readings were encountered with the turbulence measurement probes. Turbulence measurements were made at three radial immersions at a point 15.5 cm downstream of the compressor outlet guide vanes in the compressor exit diffuser. The passage height at this point is 5.54 cm. Data reduction was accomplished with a time-data fast Fourier transform (FFT) system. This system finds the power spectral density distribution (PSD) of a large number of data samples using a direct Fourier transform algorithm and finds the autocorrelation parameter for these data by doing an FFT analysis of the PSD curves for a series of time delay intervals.

Taylor, J. R.↗

NASA NTRS1978

Fixed-point error analysis of Winograd Fourier transform algorithms

The quantization error introduced by the Winograd Fourier transform algorithm (WFTA) when implemented in fixed-point arithmetic is studied and compared with that of the fast Fourier transform (FFT). The effect of ordering the computational modules and the relative contributions of data quantization error and coefficient quantization error are determined. In addition, the quantization error introduced by the Good-Winograd (GW) algorithm, which uses Good's prime-factor decomposition for the discrete Fourier transform (DFT) together with Winograd's short length DFT algorithms, is studied. Error introduced by the WFTA is, in all cases, worse than that of the FFT. In general, the WFTA requires one or two more bits for data representation to give an error similar to that of the FFT. Error introduced by the GW algorithm is approximately the same as that of the FFT.

Patterson, R. W.↗

NASA NTRS1979

A new hybrid algorithm for computing a fast discrete Fourier transform

In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, with the Mersenne prime number-theoretic transform developed originally by Rader. This new algorithm requires fewer multiplications than either the standard fast Fourier transform (FFT) or Winograd's more conventional algorithm. However, more additions are required.

Reed, I. S.↗

NASA NTRS1979

Alternative signal processing techniques for a pulsed laser Doppler velocimeter system

The laser Doppler velocimeter system (LDV) being tested at NASA MSFC, Alabama, relies on a bank of classical filters for processing the returned lidar signal. Due to the complexity of this conventional filter system, alternative signal processing methods have been proposed for obtaining the Doppler spectrum. The fast Fourier transform (FFT) and the pulse-pair estimator are two techniques which appear to offer some advantages over the existing system. The work reported employs digital computer simulation to compare and evaluate these two processing methods for determining the first and second moments of the LDV velocity spectrum.

Calhoun, M. D.↗