Search NASA⌕ Search

SEARCH · Search NASA

Results for “Recursion”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS1984

A Very Efficient Transfer Function Bounding Technique on Bit Error Rate for Viterbi Decoded, Rate 1/N Convolutional Codes

For rate 1/N convolutional codes, a recursive algorithm for finding the transfer function bound on bit error rate (BER) at the output of a Viterbi decoder is described. This technique is very fast and requires very little storage since all the unnecessary operations are eliminated. Using this technique, we find and plot bounds on the BER performance of known codes of rate 1/2 with K 18, rate 1/3 with K 14. When more than one reported code with the same parameter is known, we select the code that minimizes the required signal to noise ratio for a desired bit error rate of 0.000001. This criterion of determining goodness of a code had previously been found to be more useful than the maximum free distance criterion and was used in the code search procedures of very short constraint length codes. This very efficient technique can also be used for searches of longer constraint length codes.

Lee, P. J.↗
NASA NTRS1985

Accelerated viscoelastic characterization of T300-5208 graphite-epoxy laminates

A viscoelastic response scheme for the accelerated characterization of polymer-based composite laminates in applied to T300/5208 graphite/epoxy. The response of uni-directional specimens is modeled. The transient component of the viscoelastic creep compliance is assumed to follow a power law approximation. A recursive relationship is developed, based upon the Schapery single-integral equation, which allows approximation of a continuous time-varying uniaxial load using discrete steps in stress. The viscoelastic response of T300/5208 to transverse normal and shear stresses is determined unsing 90 deg and 10 deg off-axis tensile specimens. In each case the seven viscoelastic material parameters required in the analysis are determined experimentally using short-term creep and creep recovery tests. It is shown that an accurate measure of the power law exponent is crucial for accurate long-term prediction. A short term test cycle selection procedure is proposed, which should provide useful guidelines for the evaluation of other viscoelastic materials.

Tuttle, M. E.↗
NASA NTRS1985

Convex-profile Inversion of Asteroid Lightcurves

A lightcurve inversion method that yields a two-dimensional convex profile is introduced. The number of parameters that characterize the profile is limited only by the number of Fourier harmonics used to represent the parent lightcurve. The implementation of the method is outlined by a recursive quadratic programming algorithm, and its application to photoelectric lightcurves and radar measurements is discussed. Special properties of the lightcurves of geometrically scattering ellipsoids are pointed out, and those properties are used to test the inversion method and obtained a criterion for judging whether any lightcurve could actually be due to such an object. Convex profiles for several asteroids are shown, and the method's validity is discussed from a physical as well as purely statistical point of view.

Ostro, S. J.↗
NASA NTRS1984

Kalman filter modeling

The formulation of appropriate state-space models for Kalman filtering applications is studied. The so-called model is completely specified by four matrix parameters and the initial conditions of the recursive equations. Once these are determined, the die is cast, and the way in which the measurements are weighted is determined foreverafter. Thus, finding a model that fits the physical situation at hand is all important. Also, it is often the most difficult aspect of designing a Kalman filter. Formulation of discrete state models from the spectral density and ARMA random process descriptions is discussed. Finally, it is pointed out that many common processes encountered in applied work (such as band-limited white noise) simply do not lend themselves very well to Kalman filter modeling.

Brown, R. G.↗
NASA NTRS1985

Optimization of Controlled Structures

A formulation is presented for the coupled optimal design of a structural system and its control by defining a composite objective function as a linear combination of two components: a structural objective and a control objective. For the case when the structural objective is a function of the structural design variables only, and when the control objective is represented by the quadratic functional of the response and control energy, one can analytically express the optimal control in terms of any set of admissible structural design variables. The expression for the optimal control is used recursively in an iterative Newton-Raphson search scheme, the goal of which is to determine a corresponding optimal set of structural design variables that minimize the composite objective function. A numerical example is given to illustrate the computational procedure.

Salama, M.↗
NASA NTRS1985

Method of and apparatus for generating an interstitial point in a data stream having an even number of data points

Apparatus for doubling the data density rate of an analog to digital converter or doubling the data density storage capacity of a memory deviced is discussed. An interstitial data point midway between adjacent data points in a data stream having an even number of equal interval data points is generated by applying a set of predetermined one-dimensional convolute integer coefficients which can include a set of multiplier coefficients and a normalizer coefficient. Interpolator means apply the coefficients to the data points by weighting equally on each side of the center of the even number of equal interval data points to obtain an interstital point value at the center of the data points. A one-dimensional output data set, which is twice as dense as a one-dimensional equal interval input data set, can be generated where the output data set includes interstitial points interdigitated between adjacent data points in the input data set. The method for generating the set of interstital points is a weighted, nearest-neighbor, non-recursive, moving, smoothing averaging technique, equivalent to applying a polynomial regression calculation to the data set.

Edwards, T. R.↗
NASA NTRS1984

A fundamental model and efficient inference for SAR ocean imagery

Employing a synthetic aperture radar (SAR) imaging model based on fundamental models of nonlinear hydrodynamics, electromagnetic scattering from a two-scale surface, and SAR imaging of a time-variant scene, the optimal (minimum mean-square error) estimates of the parameters of a sinusoidal, long gravity wave, and the short gravity wave ensemble are found in an efficient recursive form and their performance evaluated, generally by numerical simulation, in a one-dimensional stationary version. An application is made to Seasat-SAR complex imagery.

Harger, R. O.↗
NASA NTRS1983

A function space approach to state and model error estimation for elliptic systems

An approach is advanced for the concurrent estimation of the state and of the model errors of a system described by elliptic equations. The estimates are obtained by a deterministic least-squares approach that seeks to minimize a quadratic functional of the model errors, or equivalently, to find the vector of smallest norm subject to linear constraints in a suitably defined function space. The minimum norm solution can be obtained by solving either a Fredholm integral equation of the second kind for the case with continuously distributed data or a related matrix equation for the problem with discretely located measurements. Solution of either one of these equations is obtained in a batch-processing mode in which all of the data is processed simultaneously or, in certain restricted geometries, in a spatially scanning mode in which the data is processed recursively. After the methods for computation of the optimal esimates are developed, an analysis of the second-order statistics of the estimates and of the corresponding estimation error is conducted. Based on this analysis, explicit expressions for the mean-square estimation error associated with both the state and model error estimates are then developed. While this paper focuses on theoretical developments, applications arising in the area of large structure static shape determination are contained in a closely related paper (Rodriguez and Scheid, 1982).

Rodriguez, G.↗
NASA NTRS1983

Closed-form solutions for a class of optimal quadratic tracking problems

Closed-form solutions are derived for a class of tracking problems including a linear optimal regulator and a prefilter for a time-invariant plant. The solutions for the prefilter equation and state trajectory coupled by the Riccati equation are exponentially related to the stability matrix of the plant. A computational procedure is presented in recursive form when the desired output state dynamics is assumed linear and time-invariant. Several examples are given for illustration.

Turner, J. D.↗
NASA NTRS1985

Progress in adaptive control of flexible spacecraft using lattice filters

This paper reviews the use of the least square lattice filter in adaptive control systems. Lattice filters have been used primarily in speech and signal processing, but they have utility in adaptive control because of their order-recursive nature. They are especially useful in dealing with structural dynamics systems wherein the order of a controller required to damp a vibration is variable depending on the number of modes significantly excited. Applications are presented for adaptive control of a flexible beam. Also, difficulties in the practical implementation of the lattice filter in adaptive control are discussed.

Sundararajan, N.↗
NASA NTRS1985

The VLSI design of error-trellis syndrome decoding for convolutional codes

A recursive algorithm using the error-trellis decoding technique is developed to decode convolutional codes (CCs). An example, illustrating the very large scale integration (VLSI) architecture of such a decode, is given for a dual-K CC. It is demonstrated that such a decoder can be realized readily on a single chip with metal-nitride-oxide-semiconductor technology.

Reed, I. S.↗
NASA NTRS1985

Real-time flutter identification

The techniques and a FORTRAN 77 MOdal Parameter IDentification (MOPID) computer program developed for identification of the frequencies and damping ratios of multiple flutter modes in real time are documented. Physically meaningful model parameterization was combined with state of the art recursive identification techniques and applied to the problem of real time flutter mode monitoring. The performance of the algorithm in terms of convergence speed and parameter estimation error is demonstrated for several simulated data cases, and the results of actual flight data analysis from two different vehicles are presented. It is indicated that the algorithm is capable of real time monitoring of aircraft flutter characteristics with a high degree of reliability.

Roy, R.↗
NASA NTRS1985

Comprehensive solar cell modeling and correlation studies

Modeling and correlation studies of solar cells was discussed. Recursive relationships were used to generate solutions at a number of mesh points within the emitter region. Photoexcited hole concentration and built-in electric field were calculated as a function of position. Simulated and experimentally determined I-V curves were shown to have good fit.

Lamorte, M. L.↗
NASA NTRS1986

On some equivalent configurations of systolic arrays

A systematic approach is presented for designing systolic arrays and their equivalent configurations for certain general classes of recursively formulated algorithms. A new method is also introduced to reduce the input bandwidth and storage requirements of the systolic arrays through the study of dependence among the input data. Many well known systolic arrays can be rederived and also many new systolic arrays can be discovered by this approach.

Chang, C. Y.↗
NASA NTRS1986

On realizations of least-squares estimation and Kalman filtering by systolic arrays

Least-squares (LS) estimation is a basic operation in many signal processing problems. Given y = Ax + v, where A is a m x n coefficient matrix, y is a m x 1 observation vector, and v is a m x 1 zero mean white noise vector, a simple least-squares solution is finding the estimated vector x which minimizes the norm of /Ax-y/. It is well known that for an ill-conditioned matrix A, solving least-squares problems by orthogonal triangular (QR) decomposition and back substitution has robust numerical properties under finite word length effect since 2-norm is preserved. Many fast algorithms have been proposed and applied to systolic arrays. Gentleman-Kung (1981) first presented the trianglular systolic array for a basic Givens reduction. McWhirter (1983) used this array structure to find the least-squares estimation errors. Then by geometric approach, several different systolic array realizations of the recursive least-squares estimation algorithms of Lee et al (1981) were derived by Kalson-Yao (1985). Basic QR decomposition algorithms are considered in this paper and it is found that under a one-row time updating situation, the Householder transformation degenerates to a simple Givens reduction. Next, an improved least-squares estimation algorithm is derived by considering a modified version of fast Givens reduction. From this approach, the basic relationship between Givens reduction and Modified-Gram-Schmidt transformation can easily be understood. This improved algorithm also has simpler computational and inter-cell connection complexities while compared with other known least-squares algorithms and is more realistic for systolic array implementation.

Chen, M. J.↗
NASA NTRS1985

On the evaluation of expected performance cost for partially observed closed-loop stochastic systems

New methods are presented for evaluating the expected performance cost of partially observed closed-loop stochastic systems. When the variances of the process statistics are small, a linearized model of the closed-loop stochastic system is defined for which the expected cost can be evaluated by recursion on a set of purely deterministic difference equations. When the variances of the process statistics are large, the linearized model can be used in the control variate method of variance reduction for reducing the number of sample paths required for effective Monte Carlo estimation.

Bayard, D. S.↗
NASA NTRS1985

Solution of the two-dimensional spectral factorization problem

An approximation theorem is proven which solves a classic problem in two-dimensional (2-D) filter theory. The theorem shows that any continuous two-dimensional spectrum can be uniformly approximated by the squared modulus of a recursively stable finite trigonometric polynomial supported on a nonsymmetric half-plane.

Lawton, W. M.↗