Search NASA⌕ Search

SEARCH · Search NASA

Results for “Transformers”

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

Continuous Fourier transform method and apparatus

An input analog signal to be frequency analyzed is separated into N number of simultaneous analog signal components each identical to the original but delayed relative to the original by a successively larger time delay. The separated and delayed analog components are combined together in a suitable number of adders and attenuators in accordance with at least one component product of the continuous Fourier transform and analog signal matrices to separate the analog input signal into at least one of its continuous analog frequency components of bandwidth 1/N times the bandwidth of the original input signal. The original analog input signal can be reconstituted by combining the separate analog frequency components in accordance with the component products of the continuous Fourier transform and analog frequency component matrices. The continuous Fourier transformation is useful for spectrum analysis, filtering, transfer function synthesis, and communications.

Munoz, R. M.↗

Error analysis of householder transformations as applied to the standard and generalized eigenvalue problems

Backward error analyses of the application of Householder transformations to both the standard and the generalized eigenvalue problems are presented. The analysis for the standard eigenvalue problem determines the error from the application of an exact similarity transformation, and the analysis for the generalized eigenvalue problem determines the error from the application of an exact equivalence transformation. Bounds for the norms of the resulting perturbation matrices are presented and compared with existing bounds when known.

Ward, R. C.↗

On the variational equations for Householder transformations in feature selection

Results that suggest the possibility of using a sequential monotone process for solving the feature selection problem using Householder transformations are applied to the divergence separability criterion and an expression for the gradient of the divergence with respect to the generator of a single Householder transformation will be developed. This expression for the gradient is used in any number of differential correction schemes (iterators) that attempt to extremize the divergence. Data sets provided by the Earth Observations Division-JSC are used to demonstrate selecting the Householder transformations that generate the kxn matrix defining the best (in the sense of extremizing the divergence) k linear combinations of features. The tests allow initial comparisons to be made with results. In particular, this technique does not appear to require initial guesses for the iterator to be generated without replacement, exhaustive search, or other similar schemes.

Decell, H. P., Jr.↗

The non-uniform transformation strain problem for an anisotropic ellipsoidal inclusion

The problem of an anisotropic ellipsoidal inclusion which undergoes a stress-free transformation strain (in the sense of J. D. Eshelby) is considered, and the following theorem is proved: if an ellipsoidal region in an infinite anisotropic linear elastic medium undergoes, in the absence of its surroundings, a stress-free transformation strain which is a polynomial of degree M in given position coordinates, then the final stress and strain state in the transformed inclusion, when constrained by its surroundings, is also a polynomial of degree M in those position coordinates.

Asaro, R. J.↗

Canonical analysis and transformation of Skylab multispectral scanner data

The author has identified the following significant results. The original transformation matrix, C, had sixteen axes. However, the first three axes contained 98.83% of the variance contained within the transformation. The values for axes one, two, and three were 83.61%, 14.49%, and 0.72%, respectively. The result was an 81.25% reduction in data bulk. It is expected that using transformed data for classification will result in significant reductions in computer cost.

Mcmurtry, G. J.↗

Transformer design tradeoffs

Material was presented to assist transformer designers in the transition from long-used English units to the less familiar metric equivalents. A coordination between the area product numbers ap (product of window and core cross-section areas) and current density J was developed for a given regulation and temperature rise. Straight-line relationships for Ap and Volume, Ap and surface area At and, Ap and weight were developed. These relationships can now be used as new tools to simplify and standardize the process of transformer design. They also made it possible to design transformers of small bulk and volume or to optimize efficiency.

Mclyman, W. T.↗

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↗

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

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

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

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

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

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