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.
The application of various orthogonal transformations to communication was investigated, with particular emphasis placed on speech and visual signal processing. The fundamentals of the one- and two-dimensional orthogonal transforms and their application to speech and visual signals are treated in detail.
Orthogonal transforms and feature selection using pattern, Harr, Walsh, Fourier and Karhunen- Loeve spaces for providing efficient classification algorithms in pattern recognition
Rigid body rotational attitude control in three dimensions with linear transformation as output variable, noting advantages, applications and results
Discrete forms of the Fourier, Hadamard, and Karhunen-Loeve transforms are examined for their capacity to reduce the bit rate necessary to transmit speech signals. To rate their effectiveness in accomplishing this goal the quantizing error (or noise) resulting for each transformation method at various bit rates is computed and compared with that for conventional companded PCM processing. Based on this comparison, it is found that Karhunen-Loeve provides a reduction in bit rate of 13.5 kbits/s, Fourier 10 kbits/s, and Hadamard 7.5 kbits/s as compared with the bit rate required for companded PCM. These bit-rate reductions are shown to be somewhat independent of the transmission bit rate.
Square root information estimation, starting from its beginnings in least-squares parameter estimation, is considered. Special attention is devoted to discussions of sensitivity and perturbation matrices, computed solutions and their formal statistics, consider-parameters and consider-covariances, and the effects of a priori statistics. The constant-parameter model is extended to include time-varying parameters and process noise, and the error analysis capabilities are generalized. Efficient and elegant smoothing results are obtained as easy consequences of the filter formulation. The value of the techniques is demonstrated by the navigation results that were obtained for the Mariner Venus-Mercury (Mariner 10) multiple-planetary space probe and for the Viking Mars space mission.
A method for transfer function identification, including both model structure determination and parameter estimation, was developed and demonstrated. The approach uses orthogonal modeling functions generated from frequency domain data obtained by Fourier transformation of time series data. The method was applied to simulation data to identify continuous-time transfer function models and unsteady aerodynamic models. Model fit error, estimated model parameters, and the associated uncertainties were used to show the effectiveness of the method for identifying accurate transfer function models from noisy data.
A number of developments has recently led to a considerable interest in the decentralization of linear least squares estimators. The developments are partly related to the impending emergence of VLSI technology, the realization of parallel processing, and the need for algorithmic ways to speed the solution of dynamically decoupled, high dimensional estimation problems. A new method is presented for combining Square Root Information Filters (SRIF) estimates obtained from independent data sets. The new method involves an orthogonal transformation, and an information matrix filter 'homework' problem discussed by Schweppe (1973) is generalized. The employed SRIF orthogonal transformation methodology has been described by Bierman (1977).
The theoretical basis for the ASYSTD program is discussed in detail. In addition, the extensive bibliography given in this document illustrates some of the extensive work accomplished in the area of time domain simulation. Additions have been in the areas of modeling and language program enhancements, orthogonal transform modeling, error analysis, general filter models, BER measurements, etc. Several models have been developed which utilize the COMSAT generated orthogonal transform algorithms.
The authors prove that a linear second-order system with arbitrary damping cannot be reduced to Hessenberg-triangular form by means of orthogonal transformations, while this reduction is always possible for the modal damping commonly assumed for models of flexible structures. The type of canonical form obtainable by means of orthogonal transformations acting on a second-order system is heavily dependent on the type of damping considered. If the damping matrix is merely positive semi-definite symmetric, it is generally not possible to obtain a reduction to Hessenberg-triangular form, while this reduction is trivial for zero or Rayleigh damping. If damping is modal, however, as is commonly assumed in structural models, the reduction exists and is nontrivial. Furthermore, reduction to triangular second-order Schur form is always possible for such damping: this canonical form appears likely to have applications to second-order system theory.
Effective mechanical properties for large repetitive framelike structures are derived using combinations of strength of material and orthogonal transformation techniques. Symmetry considerations are used in order to identify independent property constants. The actual values of these constants are constructed according to a building block format which is carried out in the three consecutive steps: (1) all basic planar lattices are identified; (2) effective continuum properties are derived for each of these planar basic grids using matrix structural analysis methods; and (3) orthogonal transformations are used to determine the contribution of each basic set to the overall effective continuum properties of the structure.
In orthogonal transform coding of NTSC video signal, the data is processed in blocks. Processing a block of data that is maximally correlated leads to larger compression. This paper describes a new architecture for arranging the pixels in a block that yields higher correlation than the adjacent pixel blocks. The data is processed using adaptive, intrafield, discrete cosine transform, variable bit allocation coding. In subjective tests, the picture quality was good for an average of about 2 bits/pel for intrafield processing.
Several theorems related to the Householder transformation and separability criteria are proven. Orthogonal transformations, topology, divergence, mathematical matrices, and group theory are discussed.
Relations between the Haar and Walsh/Hadamard (W/H) transforms, which are proved, show that for some applications the Haar transform performs as well as, and faster than, the W/H transform. These relations yield a family of orthogonal transforms including the Haar and W/H transforms with a common fast algorithm.
Image compression algorithms based on the wavelet transform are an increasingly attractive and flexible alternative to other algorithms based on block orthogonal transforms. While the design of orthogonal wavelet filters has been studied in significant depth, the design of nonorthogonal wavelet filters, such as linear-phase (LP) filters, has not yet reached that point. Of particular interest are wavelet transforms with low complexity at the encoder. In this article, we present known and new parameterizations of the two families of LP perfect reconstruction (PR) filters. The first family is that of all PR LP filters with finite impulse response (FIR), with equal complexity at the encoder and decoder. The second family is one of LP PR filters, which are FIR at the encoder and infinite impulse response (IIR) at the decoder, i.e., with controllable encoder complexity. These parameterizations are used to optimize the subband/wavelet transform coding gain, as defined for nonorthogonal wavelet transforms. Optimal LP wavelet filters are given for low levels of encoder complexity, as well as their corresponding integer approximations, to allow for applications limited to using integer arithmetic. These optimal LP filters yield larger coding gains than orthogonal filters with an equivalent complexity. The parameterizations described in this article can be used for the optimization of any other appropriate objective function.
It is shown that a linear second-order system with arbitrary damping cannot be reduced to Hessenberg-triangular form by means of orthogonal transformations. However, it is also shown that such an orthogonal reduction is always possible for the modal damping commonly assumed for models of flexible structures. It is shown that modally damped models can be orthogonally reduced to a new triangular second-order Schur form.
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.
Linear and nonlinear optical processing techniques (Fourier transformation, convolution and correlation, arithmetic operations - addition and subtraction with gratings, generalized orthogonal transformations; theta modulation, half-tone screen process, optical feedback) for mathematical computations are reviewed. The use of gratings and computer holograms in addition, subtraction, differentiation, and application of generalized transformations is discussed. Use of nonlinear optical elements with or without optical coherent feedback in such nonlinear operations as taking logarithms and thresholding is described. Applications in hybrid systems incorporating digital computer and optical processor with real-time interface devices, or optical threshold and logic devices for parallel processing to apply digital techniques to optical information are considered.
A global algorithm for transforming rotation matrices to Euler parameters is presented. Although it has no apparent computational or numerical advantage over the known algorithms, it elucidates the relationship between the rotation matrix form and the Euler parameter form. It employs the singular-value decomposition, a numerically ideal algorithm involving orthogonal transformations. Attitude parameterization is reviewed and an analytical framework is provided.