SEARCH · Search NASA
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.
Technical memorandum includes transformer area product numbers, which are used to summarize dimensional and electrical properties of C-cores, pot cores, lamination, powder cores, and tape-wound cores. To aid in core selection, comparison of five common core materials is presented to indicate their influence on overall transformer efficiency and weight.
The problem considered is that of rectilinear motion with variable velocity. The paper gives, by an elementary construction, a system of coordinates which is conformal in a restricted region near the axis of the motion. In such coordinates the velocity of light remains invariant even for observers moving with variable velocity. By a particular choice of the scale relation the restricted conformal transformations can be made to reduce to the Lorentz transformation everywhere in the case of constant velocity and locally in the case of variable velocity.
The fast KL transform algorithm was applied for data compression of a set of four ERTS multispectral images and its performance was compared with other techniques previously studied on the same image data. The performance criteria used here are mean square error and signal to noise ratio. The results obtained show a superior performance of the fast KL transform coding algorithm on the data set used with respect to the above stated perfomance criteria. A summary of the results is given in Chapter I and details of comparisons and discussion on conclusions are given in Chapter IV.
The Wigner-Eisenbud R matrix method has been combined with the frame transformation theory to study electron scattering from molecular systems. The R matrix, calculated at the boundary point of the molecular core radius, has been transformed to the space frame in order to continue the solution of the scattering equations in the outer region where rotational motion of the nuclei is taken into account. This procedure has been applied to a model calculation of thermal energy electron scattering from CO.
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.
An exact analytical transformation is presented for the remote sensing of atmospheric temperature profiles in the presence of clouds. The transformation permits direct retrieval of clear-column temperature profiles without the need to predetermine the corresponding clear-column radiances. A numerical illustration is given for simulated observations in the 15 micron CO2 band in the terrestrial atmosphere. The resulting method is numerically very fast and is especially suitable for handling the massive amount of data needed for numerical weather prediction.
It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform 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.
The theoretical and some experimental results of a study aimed at applying CCD filter and transform techniques to the problem of interference excision within communications channels were presented. Adaptive noise (interference) suppression was achieved by the modification of received signals such that they were orthogonal to the recently measured noise field. CCD techniques were examined to develop real-time noise excision processing. They were recursive filters, circulating filter banks, transversal filter banks, an optical implementation of the chirp Z transform, and a CCD analog FFT.
It is shown that all combinations of symmetrical input distributions with difference distortion measures give a bit assignment rule identical to the well-known rule for a Gaussian input distribution with mean-square error. Published work is examined to show that the bit assignment rule is useful for transforms of full pictures, but subjective bit assignments for transform picture coding using small block sizes are significantly different from the theoretical bit assignment rule. An intuitive explanation is based on subjective design experience, and a subjectively obtained bit assignment rule is given.
The mathematical properties of Hadamard matrices and their application to spectroscopy are discussed. A comparison is made between Fourier and Hadamard transform encoding in spectrometry. The spectrometer is described and its laboratory performance evaluated. The algorithm and programming of inverse transform are given. A minicomputer is used to recover the spectrum.
This semi-tutorial paper describes the process of using orthogonal transforms for the purposes of encoding TV picture data. Results pertaining to a 6:1 data compression experiment using the Walsh-Hadamard transform are included.
An encoding figure of merit is established for a detector-noise limited Fourier transform spectrometer (FTS) and compared to the comparable figure for a Hadamard transform spectrometer (HTS). The limitation of the Fourier system is partly that it does not truly Fourier analyze the radiation. Instead a cosine squared modulation is imposed on the different spectral frequencies. An additional difficulty is that neither the cosine nor the cosine squared functions form an orthonormal set. This makes the Fellgett's advantage (root-mean-squared figure of merit) for a single detector Michelson interferometer a factor of the square root of (N/8) greater than for a conventional grating instrument - rather than the square root of (N/2). The theoretical limit would be the square root of N.
A high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
A self-stabilizing voltage regulator is described. Direct current voltage regulation employing a series transistor rendered conductive during various portions of a cycle is controlled by saturation of an autotransformer. The constant volt-second capacity of the transformer provides conduction time inverse to the input voltage whereby average output voltage is maintained constant. Conduction commenced in response to short gate signals, and resistor feedback for degenerative turn-off of the transistor was after transformer saturation. Standard output filters are also included.
Properties of a transformation method, which was developed for solving fluid dynamic problems on general two dimensional regions, are discussed. These include construction error of the transformation and applications to mesh generation. An error and stability analysis for the numerical solution of a model parabolic problem is also presented.
An algorithm for computing a Fourier-like transform over GF(2 to the (second power) to the n power), where n = 1,2,3,4,5, was developed to encode and decode and Reed-Solomon (RS) codes of length 2 to the (second power) to the n power. Such as RS detector is considerably faster than a decoder that uses the conventional fast transform over GF(2 to the (second power) to the n power).
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.
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.