Search NASA⌕ Search

SEARCH · Search NASA

Results for “transform”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

Transformation of apparent ocean wave spectra observed from an aircraft sensor platform

The problem considered was transformation of a unidirectional apparent ocean wave spectrum observed from an aircraft sensor platform into the true spectrum that would be observed from a stationary platform. Spectral transformation equations were developed in terms of the linear wave dispersion relationship and the wave group speed. An iterative solution to the equations was outlined and used to transform reference theoretical apparent spectra for several assumed values of average water depth. Results show that changing the average water depth leads to a redistribution of energy density among the various frequency bands of the transformed spectrum. This redistribution is most severe when much of the energy density is expected, a priori, to reside at relatively low true frequencies.

Poole, L. R.↗
NASA NTRS1975

Computation of transform domain covariance matrices

It is often of interest in applications to compute the covariance matrix of a random process transformed by a fast unitary transform. Here, the recursive definition of fast unitary transforms is used to derive recursive relations for the covariance matrices of the transformed process. These relations lead to fast methods of computation of covariance matrices and to substantial reductions of the number of arithmetic operations required.

Fino, B. J.↗
NASA NTRS1976

Phase transformation and stabilization of a high strength austenite

An investigation of the phase transformation and the austenite stabilization in a high strength austenite has been made. An Fe-29Ni-4.3Ti austenite age-hardened by gamma-prime (Ni3Ti) precipitates showed a further increase of strength after martensitic and reverse martensitic phase transformations. The stability of ausaged austenite as well as ausaged and transformation-strengthened austenite was improved significantly through an isothermal treatment at 500 C. The Ms temperature of the strengthened austenite was restored to nearly that of annealed austenite while the austenite was hardened to R(C) 41 through precipitation and phase transformations. The observed austenite stabilization is attributed to the formation of GP zones or short-range order of less than about 10A in size.

Jin, S.↗
NASA NTRS1976

An algorithm to compute the sequency ordered Walsh transform

A fast sequency-ordered Walsh transform algorithm is presented; this sequency-ordered fast transform is complementary to the sequency-ordered fast Walsh transform introduced by Manz (1972) and eliminating gray code reordering through a modification of the basic fast Hadamard transform structure. The new algorithm retains the advantages of its complement (it is in place and is its own inverse), while differing in having a decimation-in time structure, accepting data in normal order, and returning the coefficients in bit-reversed sequency order. Applications include estimation of Walsh power spectra for a random process, sequency filtering and computing logical autocorrelations, and selective bit reversing.

Larsen, H.↗
NASA NTRS1976

A fast Karhunen-Loeve transform for a class of random processes

It is shown that for a class of finite first-order Markov signals, the Karhunen-Loeve (KL) transform for data compression is a set of periodic sine functions if the boundary values of the signal are fixed or known. These sine functions are shown to be related to the Fourier transform so that a fast Fourier transform algorithm can be used to implement the KL transform. Extension to two dimensions with reference to images with separable contravariance function is shown.

Jain, A. K.↗
NASA NTRS1977

Transformer design tradeoffs

In space, power system transformer components are frequently the heaviest and bulkiest items in the power conversion circuit. They also have a significant effect upon the overall performance and efficiency of the system. Accordingly, the design of such transformers has an important effect on overall system weight, power-inversion efficiency, and cost. Relationships were between the parameters used by transformer designers that can be used as new tools to standardize and simplify transformer design. They can be used to optimize the design either for small size and weight or efficiency. The metric system of units, rather than the familiar English units, is used; however, material is presented to assist the reader in the transition from one system to the other.

Mclyman, W. T.↗
NASA NTRS1977

Euler angles, quaternions, and transformation matrices for space shuttle analysis

Relationships between the Euler angles and the transformation matrix, the quaternion and the transformation matrix, and the Euler angles and the quaternion are analyzed, and equations developed are applied directly to current space shuttle problems. The twelve three-axis Euler transformation matrices as functions of the Euler angles, the equations for the quaternion as a function of the Euler angles, and the Euler angles as a function of the transformation matrix elements are included along with a group of utility subroutines to accomplish the Euler matrix, quaternion matrix, and Euler quaternion relationships.

Henderson, D. M.↗
NASA NTRS1977

Shuttle Program. Euler angles, quaternions, and transformation matrices working relationships

A brief mathematical development of the relationship between the Euler angles and the transformation matrix, the quaternion and the transformation matrix, and the Euler angles and the quaternion is presented. The analysis and equations presented apply directly to current space shuttle problems. The twelve three-axis Euler transformation matrices are given as functions of the Euler angles, the equations for the quaternion as a funtion of the Euler angles, and the Euler angles as a function of the transformation matrix elements.

Henderson, D. M.↗
NASA NTRS1978

A fast DFT algorithm using complex integer transforms

Winograd's algorithm for computing the discrete Fourier transform is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields. This algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithms.

Reed, I. S.↗
NASA NTRS1978

A new hybrid algorithm for computing a fast discrete Fourier transform

For certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, with the Mersenne-prime number theoretic transform. This new algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithm.

Reed, I. S.↗
NASA NTRS1978

On decoding of Reed-Solomon codes over GF/32/ and GF/64/ using the transform techniques of Winograd

An algorithm based on the Winograd (1976) method is developed to compute a Fourier-like transform over Galois field GF(2 exp n) for n equal to 5 and 6. It is shown that this transform algorithm requires fewer multiplications than the more conventional fast transform algorithm described by Gentleman (1968). Such a transform can be used to encode and decode Reed-Solomon codes of length (2 exp n) -1.

Reed, I. S.↗
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 NTRS1980

A new coordinate transformation for turbulent boundary layer flows

The transformation permits a uniform mesh to be used in the computational coordinate which extends across the layer. This coordinate transformation uses the local value of the skin friction coefficient to scale the thickness of the wall layer region, and the local maximum value of turbulent viscosity to scale the boundary-layer thickness. Results are presented for two dimensional boundary layers in both positive and negative pressure gradients and comparisons are made with experimental data and conventional variable-grid results for low speed turbulent boundary-layers. The cases chosen illustrate the capability of this new transformation to capture the boundary layer growth over the full extent of laminar, transitional, and turbulent flow with no grid adjustment as well as its ability to consistently enlarge the wall layer region for accurate shear stress representation. Results of mesh refinement studies using the new coordinate transformation are presented.

Carter, J. E.↗
NASA NTRS1981

Addendum to 'A new hybrid algorithm for computing a fast discrete Fourier transform'

The reported investigation represents a continuation of a study conducted by Reed and Truong (1979), who proposed a hybrid algorithm for computing the discrete Fourier transform (DFT). The proposed technique employs a Winograd-type algorithm in conjunction with the Mersenne prime-number theoretic transform to perform a DFT. The implementation of the technique involves a considerable number of additions. The new investigation shows an approach which can reduce the number of additions significantly. It is proposed to use Winograd's algorithm for computing the Mersenne prime-number theoretic transform in the transform portion of the hybrid algorithm.

Reed, I. S.↗
NASA NTRS1981

Three methods for performing Hankel transforms

Three methods for performing Hankel transforms with optical or digital processors are described. The first method is applicable when the input data is available in Cartesian (x-y) format and uses the close connection between generalized Hankel transform and the two dimensional Fourier transform in Cartesian coordinates. The second method is useful when the input data is in polar (r - theta) format and uses change of variables to perform the nth order Hankel transform as a correlation integral. The third method utilizes the von Neumann addition theorem for Bessel functions to extract the Hankel coefficients from a correlation between the radial part of the input and a Bessel function. Initial experimental results obtained for optical implementation of the first two methods are presented.

Athale, R. A.↗
NASA NTRS1982

Stellar luminosity functions in the R, I, J, and K bands obtained by transformation from the visual band

The stellar luminosity function that has been measured in the visual band into the R, I, J, and K bands, where it has not yet been obtained directly, is transformed. The transformation is effected by subdividing the total visual function, which includes all stars, into subluminosity functions for each luminosity class (supergiants through white dwarfs), applying the known (V - D) color, D = R, I, J, K for each spectral type, and then summing the resultant transformed subluminosity functions into a total luminosity function for the band D. Simple analytic forms that accurately fit the transformed luminosity functions are given. Consideration is also given to the possibility of a systematic error resulting from the existence of a very red stellar population not accounted for in the visual band luminosity function

Mamon, G. A.↗
NASA NTRS1983

Transformations of the perturbed two-body problem to unperturbed harmonic oscillators

Singular, nonlinear, and Liapunov unstable equations are made regular and linear through transformations that change the perturbed planar problem of two bodies into unperturbed and undamped harmonic oscillators with constant coefficients, so that the stable solution may be immediately written in terms of the new variables. The use of arbitrary and special functions for the transformations allows the systematic discussion of previously introduced and novel anomalies. For the case of the unperturbed two-body problem, it is proved that if transformations are power functions of the radial variable, only the eccentric and the true anomalies (with the corresponding transformations of the radial variable) will result in harmonic oscillators. The present method significantly reduces computation requirements in autonomous space operations.

Szebehely, V.↗
NASA NTRS1983

Application of the one-dimensional Fourier transform for tracking moving objects in noisy environments

In Riddle and Rajala (1981), an algorithm was presented which operates on an image sequence to identify all sets of pixels having the same velocity. The algorithm operates by performing a transformation in which all pixels with the same two-dimensional velocity map to a peak in a transform space. The transform can be decomposed into applications of the one-dimensional Fourier transform and therefore can gain from the computational advantages of the FFT. The aim of this paper is the concern with the fundamental limitations of that algorithm, particularly as relates to its sensitivity to image-disturbing parameters as noise, jitter, and clutter. A modification to the algorithm is then proposed which increases its robustness in the presence of these disturbances.

Rajala, S. A.↗