Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 343 records · Page 19

Procedures for dealing with certain types of noise and systematic errors common to many Hadamard transform optical systems

Sources of noise and error correcting procedures characteristic of Hadamard transform optical systems were investigated. Reduction of spectral noise due to noise spikes in the data, the effect of random errors, the relative performance of Fourier and Hadamard transform spectrometers operated under identical detector-noise-limited conditions, and systematic means for dealing with mask defects are among the topics discussed. The distortion in Hadamard transform optical instruments caused by moving Masks, incorrect mask alignment, missing measurements, and diffraction is analyzed and techniques for reducing or eliminating this distortion are described.

Harwit, M.↗

Numerical inverse Laplace transformation for determining the system response of linear systems in the time domain

An algorithm is described that is based on the method of breaking the Laplace transform down into partial fractions which are then inverse-transformed separately. The sum of the resulting partial functions is the wanted time function. Any problems caused by equation system forms are largely limited by appropriate normalization using an auxiliary parameter. The practical limits of program application are reached when the degree of the denominator of the Laplace transform is seven to eight.

Friedrich, R.↗

A fast computation of complex convolution using a hybrid transform

The cyclic convolution of complex values was obtained by a hybrid transform that is a combination of a Winograd transform and a fast complex integer transform. This new hybrid algorithm requires fewer multiplications than any previously known algorithm.

Reed, I. S.↗

The Maximum Likelihood Estimation of Signature Transformation /MLEST/ algorithm

The Maximum Likelihood Estimation of Signature Transformation (MLEST) algorithm is used to obtain maximum likelihood estimates (MLE) of affine transformation. The algorithm has been evaluated for three sets of data: simulated (training and recognition segment pairs), consecutive-day (data gathered from Landsat images), and geographical-extension (large-area crop inventory experiment) data sets. For each set, MLEST signature extension runs were made to determine MLE values and the affine-transformed training segment signatures were used to classify the recognition segments. The classification results were used to estimate wheat proportions at 0 and 1% threshold values.

Thadani, S. G.↗

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

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

Useful coordinate transformations for antenna applications

General coordinate transformations which are commonly encountered in many antenna applications are presented. Neither the feed coordinates nor the far-field pattern coordinates in general coincide with the antenna coordinates. Transformations discussed allow one to relate the spherical and cartesian components of one system to the spherical and cartesian components of the other system. In particular, attempts are made to use unified notations to assist in a straightforward application of the transformations.

Rahmat-Samii, Y.↗

A prescription of Winograd's discrete Fourier transform algorithm

A detailed and complete description of Winograd's discrete Fourier transform algorithm (DFT) is presented omitting all proofs and derivations. The algorithm begins with the transfer of data from the input vector array to the working array where the actual transformation takes place, otherwise known as input scrambling and output unscrambling. The third array holds constraints required in the transformation stage that are evaluated in the precomputation stage. The algorithm is made up of several FORTRAN subroutines which are not to be confused with practical software algorithmic implementation since they are designed for clarity and not for speed.

Zohar, S.↗

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

Inversion and approximation of Laplace transforms

A method of inverting Laplace transforms by using a set of orthonormal functions is reported. As a byproduct of the inversion, approximation of complicated Laplace transforms by a transform with a series of simple poles along the left half plane real axis is shown. The inversion and approximation process is simple enough to be put on a programmable hand calculator.

Lear, W. M.↗

Transform approach to electromagnetic scattering

In this paper, a comprehensive review of the Fourier transform technique as applied to the problem of high-frequency scattering is presented and the concepts of the spectral theory of diffraction (STD) are introduced. In contrast to the more commonly employed ray-optical method for high-frequency scattering, the STD approach interprets the scattered field as the spectrum, or the Fourier transform of the induced current on the scatterer. Such an interpretation offers several important advantages: uniform nature of representation, capacity to improve and extend the ray-optical formulas in a systematic manner, and convenient accuracy tests for the results. Methods for combining integral equation methods with the Galerkin procedure and asymptotic techniques in the transform domain are described, and representative examples illustrating the application of the spectral approach are included.

Mittra, R.↗

A transformation of the boundary layer equations for free convection past a vertical flat plate with arbitrary blowing and wall temperature variations

A transformation of the laminar boundary layer equations, similar to the transformation of Kao et al. (1977), is presented which allows arbitrary distributions of both wall temperature and blowing. The procedure yields constant boundary conditions, but variable coefficients appear in the differential equations. The proposed transformation is applicable to the problem of downward burning of vertical pieces of condensed-phase combustibles.

Vedhanayagam, M.↗

Heat storage in alloy transformations

The theory of eutectic transformation was examined to find guidelines to the best material combinations to examine. The heats of transformation were measured calorimetrically, and the volume changes of expanding solid mixtures and homogeneous liquid solutions, especially during the transformation between the two states at fixed temperature, were measured by changes in X-ray absorption. Heat flow models appropriate to storage in phase change materials were developed along with efficient calculating procedures so that the relative importance of the problems associated with energy storage density, heat conduction, and similar properties could be assessed.

Birchenall, C. E.↗

A decoding failure test for the transform decoder of Reed-Solomon code

Using a finite field transform, a transform decoding algorithm is able to correct erasures as well as errors of any (n,k,d) Reed-Solomon code over the finite field GF(q). A pitfall of transform decoding and how to avoid it are discussed. A simple test is given so that the decoder fails to decode instead of introducing additional errors, whenever the received word contains too many errors and erasures.

Miller, R. L.↗

Heat storage in alloy transformations

The feasibility of using metal alloys as thermal energy storage media was determined. The following major elements were studied: (1) identification of congruently transforming alloys and thermochemical property measurements; (2) development of a precise and convenient method for measuring volume change during phase transformation and thermal expansion coefficients; (3) development of a numerical modeling routine for calculating heat flow in cylindrical heat exchangers containing phase change materials; and (4) identification of materials that could be used to contain the metal alloys. Several eutectic alloys and ternary intermetallic phases were determined. A method employing X-ray absorption techniques was developed to determine the coefficients of thermal expansion of both the solid and liquid phases and the volume change during phase transformation from data obtained during one continuous experimental test. The method and apparatus are discussed and the experimental results are presented. The development of the numerical modeling method is presented and results are discussed for both salt and metal alloy phase change media.

Birchenall, C. E.↗

A parallel-pipeline architecture of the fast polynomial transform for computing a two-dimensional cyclic convolution

It is pointed out that the two-dimensional cyclic convolution is a useful tool for many two-dimensional digital signal processing applications. Two important applications are related to spaceborne high-resolution synthetic aperture radar (SAR) processing and image processing. Nussbaumer and Quandalle (1978) showed that a radix-2 polynomial transform analogous to the conventional radix-2 FFT algorithm can be used to compute a two-dimensional cyclic convolution. On the basis of results reported by Arambepola and Rayner (1979), a radix-2 polynomial transform can be defined to compute a multidimensional cyclic convolution. Truong et al. (1981) used the considered ideas together with the Chinese Theorem to further reduce the complexity of the radix-2 fast polynomial transform (FPT). Reed et al. (1981) demonstrated that such a new FPT algorithm is significantly faster than the FFT algorithm for computing a two-dimensional convolution. In the present investigation, a parallel-pipeline architecture is considered for implementing the FPT developed by Truong et al.

Truong, T. K.↗

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

Optimal Landsat transforms for forest applications

Eleven transformations of data from four Landsat MSS channels were investigated to find if any of the transforms accentuated the separability of natural vegetation classes in regions of varying topographical relief. Attention was given to the divergence analysis and classification accuracy of information content of the eleven transforms and four channels. A useful scaling function was observed with the second eigenvector being the denominator in the divergence values obtained. The second eigenvector was found to reduce the effects of shadowing and differential illumination of vegetation signatures, thereby enhancing the divergence values. The highest accuracies in crop identification were provided by the averages of channels 4, 6, and 7 divided by the second eigenvector.

Logan, T. L.↗