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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

A generalized theory for the design of contraction cones and other low speed ducts

A generalization of the Tsien method of contraction cone design is described. The design velocity distribution is expressed in such a form that the required high order derivatives can be obtained by recursion rather than by numerical or analytic differentiation. The method is applicable to the design of diffusers and converging-diverging ducts as well as contraction cones. The computer program is described and a FORTRAN listing of the program is provided.

Barger, R. L.↗
NASA NTRS1972

Representations of the language recognition problem for a theorem prover

Two representations of the language recognition problem for a theorem prover in first order logic are presented and contrasted. One of the representations is based on the familiar method of generating sentential forms of the language, and the other is based on the Cocke parsing algorithm. An augmented theorem prover is described which permits recognition of recursive languages. The state-transformation method developed by Cordell Green to construct problem solutions in resolution-based systems can be used to obtain the parse tree. In particular, the end-order traversal of the parse tree is derived in one of the representations. An inference system, termed the cycle inference system, is defined which makes it possible for the theorem prover to model the method on which the representation is based. The general applicability of the cycle inference system to state space problems is discussed. Given an unsatisfiable set S, where each clause has at most one positive literal, it is shown that there exists an input proof. The clauses for the two representations satisfy these conditions, as do many state space problems.

Minker, J.↗
NASA NTRS1973

Ames-aided inertial navigation work - The first two years of progress

A description of work whose broad objective is to attain improved aircraft navigation performance through exploitation of the concept of combining navigation data from several sources in an optimum manner is presented. The system developed as a result of the work, called RAINPAL (Recursive Aided Inertial Navigation for Precision Approach and Landing) is designed to combine precision radio range measurements with data from on-board inertial sensors to achieve precision navigation for approach and landing. The paper describes RAINPAL and the rationale of its design, and also serves as a sort of planning document, including a progress report, a summary of objectives past and present, and an exposition of reasons for doing the work.

Smith, G. L.↗
NASA NTRS1973

Counting digital filters

Several embodiments of a counting digital filter of the non-recursive type are disclosed. In each embodiment two registers, at least one of which is a shift register, are included. The shift register received j sub x-bit data input words bit by bit. The kth data word is represented by the integer.

Zohar, S.↗
NASA NTRS1973

Source encoding of images for efficient transmission

A set of recursive rules which generate unitary transforms with a fast algorithm are presented. For each rule, simple relations give the number of elementary operations required by the fast algorithm. The common Fourier, Walsh-Hadamard, Slant, and Haar transforms are expressed with these rules. The framework developed allows the introduction of generalized transforms which include all common transforms in a large class of identical computation transforms. A systematic and unified view is provided for unitary transforms which have appeared in the literature and for a number of new transforms of potential interest. Generalization to complex and multidimensional unitary transforms is considered.

Algazi, V. R.↗
NASA NTRS1973

Aerosol physical properties from satellite horizon inversion

The feasibility is investigated of determining the physical properties of aerosols globally in the altitude region of 10 to 100 km from a satellite horizon scanning experiment. The investigation utilizes a horizon inversion technique previously developed and extended. Aerosol physical properties such as number density, size distribution, and the real and imaginary components of the index of refraction are demonstrated to be invertible in the aerosol size ranges (0.01-0.1 microns), (0.1-1.0 microns), (1.0-10 microns). Extensions of previously developed radiative transfer models and recursive inversion algorithms are displayed.

Gray, C. R.↗
NASA NTRS1972

A geometrical interpretation of the 2n-th central difference

Many algorithms used for data smoothing, data classification and error detection require the calculation of the distance from a point to the polynomial interpolating its 2n neighbors (n on each side). This computation, if performed naively, would require the solution of a system of equations and could create numerical problems. This note shows that if the data is equally spaced, then this calculation can be performed using a simple recursion formula.

Tapia, R. A.↗
NASA NTRS1972

On the technology of aerospace communication in multipath.

The mechanism, effects, and modelling of multipath propagation, caused by rough earth reflection, are examined for aerospace communication. Emphasis is on binary digital signalling for aircraft and hybrid vehicles, such as Shuttle. The cases of direct Air-Ground and satellite relay (Aerosat) are treated. The recursive, adaptive, coherent Bayes detector for binary phase-shift-keying in nonselective multipath is presented. The derivation for the frequency-shift-keying detector is indicated.

Painter, J. H.↗
NASA NTRS1973

Resolution improvement of remote sensing data.

Discussion of the theory of a technique for image restoration in the reconstruction of a spatial input scene mapped by a line scanner. Special attention is given to the application of this technique in reducing the data telemetered from the Infrared Scanning Radiometer of the Apollo 17 spacecraft. The technique is based on the theory of splines and uses the results of optimal approximation studies by Colomb (1959), Sard (1967), and Anselone (1968). A recursive algorithm is also developed to improve the reconstruction. The study treats a one-dimensional case, but the treatment can be readily extended to multi-dimensional situations.

Caprihan, A.↗
NASA NTRS1973

An efficient parallel algorithm for the solution of a tridiagonal linear system of equations.

Tridiagonal linear systems of equations can be solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computation on computers of the Illiac IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log(sub-2) N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.

Stone, H. S.↗
NASA NTRS1973

Orbit determination by range-only data.

The determination of satellite orbits for use in geodesy using range-only data has been examined. A recently developed recursive algorithm for rectification of the nominal orbit after processing each observation has been tested. It is shown that when a synchronous satellite is tracked simultaneously with a subsynchronous geodetic target satellite, the orbits of each may be readily determined by processing the range information. Random data errors and satellite perturbations are included in the examples presented.

Duong, N.↗
NASA NTRS1973

Image analysis techniques associated with automatic data base generation.

This paper considers some basic problems relating to automatic data base generation from imagery, the primary emphasis being on fast and efficient automatic extraction of relevant pictorial information. Among the techniques discussed are recursive implementations of some particular types of filters which are much faster than FFT implementations, a 'sequential similarity detection' technique of implementing matched filters, and sequential linear classification of multispectral imagery. Several applications of the above techniques are presented including enhancement of underwater, aerial and radiographic imagery, detection and reconstruction of particular types of features in images, automatic picture registration and classification of multiband aerial photographs to generate thematic land use maps.

Bond, A. D.↗
NASA NTRS1973

Algebraic criteria for positive realness relative to the unit circle.

A purely algebraic algorithm is developed for testing positive real character of real rational functions and matrices relative to the unit circle in the complex plane. Since the algorithm is entirely recursive and is performed in finite number of steps, it is suitable for machine computations.

Siljak, D. D.↗
NASA NTRS1973

Algebraic criteria for positive realness relative to the unit circle.

A definition is presented of the circle positive realness of real rational functions relative to the unit circle in the complex variable plane. The problem of testing this kind of positive reality is reduced to the algebraic problem of determining the distribution of zeros of a real polynomial with respect to and on the unit circle. Such reformulation of the problem avoids the search for explicit information about imaginary poles of rational functions. The stated algebraic problem is solved by applying the polynomial criteria of Marden (1966) and Jury (1964), and a completely recursive algorithm for circle positive realness is obtained.

Siljak, D. D.↗
NASA NTRS1973

Real-time minimal bit error probability decoding of convolutional codes

A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.

Lee, L. N.↗
NASA NTRS1974

Enhancing simulation of efficiency with analytical tools

Some means of combining both computer simulation and anlytical techniques are indicated in order to mutually enhance their efficiency as design tools and to motivate those involved in engineering design to consider using such combinations. While the idea is not new, heavy reliance on computers often seems to overshadow the potential utility of analytical tools. Although the example used is drawn from the area of dynamics and control, the principles espoused are applicable to other fields. In the example the parameter plane stability analysis technique is described briefly and extended beyond that reported in the literature to increase its utility (through a simple set of recursive formulas) and its applicability (through the portrayal of the effect of varying the sampling period of the computer). The numerical values that were rapidly selected by analysis were found to be correct for the hybrid computer simulation for which they were needed. This obviated the need for cut-and-try methods to choose the numerical values, thereby saving both time and computer utilization.

Seltzer, S. M.↗
NASA NTRS1974

Parallel tridiagonal equation solvers

Three parallel algorithms were compared for the direct solution of tridiagonal linear systems of equations. The algorithms are suitable for computers such as ILLIAC 4 and CDC STAR. For array computers similar to ILLIAC 4, cyclic odd-even reduction has the least operation count for highly structured sets of equations, and recursive doubling has the least count for relatively unstructured sets of equations. Since the difference in operation counts for these two algorithms is not substantial, their relative running times may be more related to overhead operations, which are not measured in this paper. The third algorithm, based on Buneman's Poisson solver, has more arithmetic operations than the others, and appears to be the least favorable. For pipeline computers similar to CDC STAR, cyclic odd-even reduction appears to be the most preferable algorithm for all cases.

Stone, H. S.↗
NASA NTRS1974

Two-dimensional signal processing with application to image restoration

A recursive technique for modeling and estimating a two-dimensional signal contaminated by noise is presented. A two-dimensional signal is assumed to be an undistorted picture, where the noise introduces the distortion. Both the signal and the noise are assumed to be wide-sense stationary processes with known statistics. Thus, to estimate the two-dimensional signal is to enhance the picture. The picture representing the two-dimensional signal is converted to one dimension by scanning the image horizontally one line at a time. The scanner output becomes a nonstationary random process due to the periodic nature of the scanner operation. Procedures to obtain a dynamical model corresponding to the autocorrelation function of the scanner output are derived. Utilizing the model, a discrete Kalman estimator is designed to enhance the image.

Assefi, T.↗