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.
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.
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.
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.
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.
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.
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.
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.
Formulas are presented relating Taylor series expansion coefficients of three functions of several variables, the energy of the trial wave function (W), the energy computed using the optimized variational wave function (E), and the response function (lambda), under certain conditions. Partial derivatives of lambda are obtained through solution of a recursive system of linear equations, and solution through order n yields derivatives of E through order 2n + 1, extending Puley's application of Wigner's 2n + 1 rule to partial derivatives in couple perturbation theory. An examination of numerical accuracy shows that the usual two-term second derivative formula is less stable than an alternative four-term formula, and that previous claims that energy derivatives are stationary properties of the wave function are fallacious. The results have application to quantum theoretical methods for the computation of derivative properties such as infrared frequencies and intensities.
Attention is given to an end-to-end Space Station Data System (SSDS) architecture which is based on internationally-recommended standards developed by the Consultative Committee for Space Data Systems (CCSDS). The proposed system uses simple modular building blocks that are recursively replicated and linked to construct essentially any desired data system configuration. The SSDS concept provides for a user-transparent data transport system which is entirely independent of the characteristics of the user data being transported, and in addition, has the flexibility to accommodate mission-induced changes in data traffic. SSDS physical elements include the following: (1) on-orbit local area networks, (2) space-to-ground, ground-to-space, and space-to-space data links, and (3) ground mission support facilities containing telemetry and telecommand data handling termini and preprocessing services.
Computational schemes are presented that allow accurate reconstruction of an aircraft's flightpath in real-time. The reconstruction of the flightpath is formulated as a linear state reconstruction problem, which can be solved via Kalman filtering (KF) techniques. This imposes some conditions upon the flight-test equipment. A reliable square root covariance KF (SRCF) implementation is chosen and further developed into a fully adaptive flightpath reconstruction scheme. Therefore, the basic SRCF is modified in order to cope with several practical problems such as: the automatic control of the convergence of the recursive KF calculations, time varying zero-bias errors on the input signal of the system model used in the KF, and the changing aircraft dynamics owing to a change in reference flight condition. The developed solutions for these problems are all implemented in a numerically stable way, which guarantees the overall flightpath reconstruction scheme to be robust. Furthermore, some special features of the used system model are exploited to make the algorithmic implementation very efficient. An experimental simulation study using simulated flight test data demonstrated these different capabilities.
Real-time flutter prediction including close modes can be effectively estimated from turbulence or on-board excitation with an Extended Kalman Filter (EKF) approach. A physically based model form enables prediction of the damping rate as well as damping, giving a time to instability estimate with its variance. The approach is recursive and can operate asynchronously to drop data outliers and hence is quite robust. Its speed is reasonable for on-line application but can also be used effectively as an off-line analysis tool for application to any modal testing situation.
Report discusses simplified recursive solutions for equations of class of fading-memory filters. Under appropriate assumptions regarding noise and exponential decay of effects of previous states, filter equations reduced to analytic formulas in closed form.
An approach to the design of digital phase locked loops (DPLLs), using estimation theory concepts in the selection of a loop filter, is presented. The key concept is that the DPLL closed-loop transfer function is decomposed into an estimator and a predictor. The estimator provides recursive estimates of phase, frequency, and higher order derivatives, while the predictor compensates for the transport lag inherent in the loop. This decomposition results in a straightforward loop filter design procedure, enabling use of techniques from optimal and sub-optimal estimation theory. A design example for a particular choice of estimator is presented, followed by analysis of the associated bandwidth, gain margin, and steady state errors caused by unmodeled dynamics. This approach is under consideration for the design of the Deep Space Network (DSN) Advanced Receiver Carrier DPLL.
Identification of frequencies, damping ratios, and mode shapes of large space structures (LSSs) are examined in real time. Real time processing allows for quick updates of model processing after a reconfiguration of structural failure. Recursive lattice least squares (RLLS) was selected as the baseline algorithm for the identification. Simulation results on a one dimensional LSS demonstrated that it provides good estimates, was not ill-conditioned in the presence of under-excited modes, allowed activity by a supervisory control system which prevented damage to the LSS or excessive drift, and was capable of real-time processing for typical LSS models. A suboptimal version of RLLS, which is equivalent to simulated parallel processing, was derived. A NASTRAN model of the dual keel U.S. space station was used to demonstrate the input/identification algorithm package in a more realistic simulation. Because the first eight flexible modes were very close together, the identification was much more difficult than in the simple examples. Even so, the model was accurately identified in real time.
In contrast to binary filters, continuously variable optical filters offer an ability to conpensate for certain imperfections in the optics of a hybrid correlator. Arbitrary static phase errors are introduced into a model of a phase-only filtering hybrid correlator, and a method of discovering a correction for them simulated. By a recursive technique a first approximation to the impulse's matched filter is adjusted (allowed to relax) so as to produce successively more localized distribution of the output in the correlation plane. The method is motivated by the development of continuously-variable phase-only spatial light modulators, but it is applicable to amplitude modulators and -with appropriate modification -- to binary modulators as well. The technique is robust against the form of the system's departure from ideal behavior.
Discussed are how loop level parallelism is detected in a nonprocedural dataflow program, and how a procedural program with concurrent loops is scheduled. Also discussed is a program restructuring technique which may be applied to recursive equations so that concurrent loops may be generated for a seemingly iterative computation. A compiler which generates C code for the language described below has been implemented. The scheduling component of the compiler and the restructuring transformation are described.
It is shown how the complete field of the electron beam may be incorporated into the transmission line model theory of the traveling wave tube (TWT). The fact that the longitudinal component of the field due to the bunched beam is not used when formulating the beam-to-circuit coupling equation is not well-known. The fundamental partial differential equation for the traveling wave field is developed and compared with the older (now standard) one. The equation can be solved numerically using the same algorithms, but now the coefficients can be updated continuously as the calculation proceeds down the tube. The coefficients in the older equations are primarily derived from preliminary measurements and some trial and error. The newer coefficients can be found by a recursive method, since each has a well defined physical interpretation and can be calculated once a reasonable first trial solution is postulated. The results of the new expression were compared with those of the older forms, as well as to a field theory model to show the ease in which a reasonable fit to the field prediction is obtained. A complete summary of the existing transmission line modeling of the TWT is given to explain the somewhat vague ideas and techniques in the general area of drifting carrier-traveling circuit wave interactions. The basic assumptions and inconsistencies of the existing theory and areas of confusion in the general literature are examined and hopefully cleared up.
A unified computed aided design method was studied for the cure cycle design that incorporates an optimal design technique with the analytical model of a composite cure process. The preliminary results of using this proposed method for optimal cure cycle design are reported and discussed. The cure process of interest is the compression molding of a polyester which is described by a diffusion reaction system. The finite element method is employed to convert the initial boundary value problem into a set of first order differential equations which are solved simultaneously by the DE program. The equations for thermal design sensitivities are derived by using the direct differentiation method and are solved by the DE program. A recursive quadratic programming algorithm with an active set strategy called a linearization method is used to optimally design the cure cycle, subjected to the given design performance requirements. The difficulty of casting the cure cycle design process into a proper mathematical form is recognized. Various optimal design problems are formulated to address theses aspects. The optimal solutions of these formulations are compared and discussed.