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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1975

On Similarity Transformation and Geodetic Network Distortions Based on Doppler Satellite Observations

Models used in geodesy to transform two sets of coordinates are studied and distortions in geodetic networks are investigated. Commonly used transformation models are first reviewed and most of them are interpreted. Differences between various models are discussed. Pitfalls in partial solutions are then considered. It is shown that only as many chords and/or directional elements can be used in the computation as are needed to completely determine the size or shape of the polyhedron implied in the set of Cartesian coordinates. Each additional element causes the normal matrix to be singular provided that all correlations between the chords are used. A number of tables and maps indicating distortions in the NAD 27, Precise Traverse M-R '72, AUS, and SAD 69 geodetic datums are also included. The residuals of the coordinates are scanned for systematic patterns after transforming each geodetic system to the NWL9D Doppler system. Also, an attempt is made to show scale distortions in the NAD 27.

Leick, Alfred↗
NASA NTRS1975

Coordinate transformation and truncation for rotating spacecraft with flexible appendages

The analytical structures of alternative coordinate transformations for the variables that characterize the deformations of finite element models of flexible appendages on rotating spacecraft are examined. Particular emphasis is given to the truncation operations that are essential for efficient numerical simulations of flexible spacecraft, due to the necessarily large number of coordinates employed in a finite element description. A theorem is developed which establishes necessary conditions for the commutativity of the required truncation and inversion operations. The recommended alternative for the rotating elastic appendage is a complex transformation with previously published orthogonality properties, which permit the derivation in this paper of a relatively simple explicit set of transformed and truncated equations of modal vibration in real variables.

Likins, P.↗
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

Transformation from proper time on earth to coordinate time in solar system barycentric space-time frame of reference

An expression was derived for the time transformation t - tau, where t is coordinate time in the solar system barycentric space-time frame of reference and tau is proper time obtained from a fixed atomic clock on earth. This transformation is suitable for use in the computation of high-precision earth-based range and Doppler observables of a spacecraft or celestial body located anywhere in the solar system; it can also be used in obtaining computed values of very long baseline interferometry data types. The formulation for computing range and Doppler observables, which is an explicit function of the transformation t - tau, is described briefly.

Moyer, T. D.↗
NASA NTRS1977

Spacecraft transformer and inductor design

The conversion process in spacecraft power electronics requires the use of magnetic components which frequently are the heaviest and bulkiest items in the conversion circuit. This handbook pertains to magnetic material selection, transformer and inductor design tradeoffs, transformer design, iron core dc inductor design, toroidal power core inductor design, window utilization factors, regulation, and temperature rise. Relationships are given which simplify and standardize the design of transformers and the analysis of the circuits in which they are used. The interactions of the various design parameters are also presented in simplified form so that tradeoffs and optimizations may easily be made.

Mclyman, W. T.↗
NASA NTRS1977

Computations and applications of linear hypergeometric transformations

Linear transformations are well-known in the theory of hypergeometric functions. In this note, it is indicated, both by analyses and by supporting numerical experiments, how these transformations can be applied to the computation of Legendre's functions, the incomplete Beta function, and the variance-ratio probability distribution function. It is shown that a simple transformation can in many cases cause dramatic improvement in computation.

Ng, E. W.↗
NASA NTRS1977

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

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

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

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

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

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

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

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

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

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

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