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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
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.↗
NASA NTRS1974

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 NTRS1973

Simulation results for an innovative anti-multipath digital receiver

Simulation results are presented for the error rate performance of the recursive digital MAP detector for known M-ary signals in multiplicative and additive Gaussian noise. Plots of detection error rate versus additive signal to noise ratio are given, with multipath interference strength as a parameter. For comparison, the error rates of conventional coherent and noncoherent digital MAP detectors are simultaneously simulated and graphed. It is shown that with nonzero multiplicative noise, the error rates of the conventional detectors saturate at an irreducible level as additive signal to noise ratio increases. The error rate for the innovative detector continues to decrease rapidly with increasing additive signal to noise ratio. In the absence of multiplicative interference, the conventional coherent detector and the innovative detector are shown to exhibit identical performance.-

Painter, J. H.↗
NASA NTRS1974

Sequential square root filtering and smoothing of discrete linear systems

A square root information filter/smoother is derived using recursive least-squares arguments. The combined filter/smoother algorithm has the following attributes: (1) it has a square root structure, which enhances numerical accuracy; (2) filter and smoother mechanizations are identical in form, facilitating implementation of the smoother; and (3) storage and computation requirements are modest compared with other smoothing algorithms. Partitioning the results to separate bias parameters provides further computational economies and reduction of storage requirements.

Bierman, G. J.↗
NASA NTRS1975

New methods for the numerical integration of ordinary differential equations and their application to the equations of motion of spacecraft

A number of hybrid methods for solving Cauchy problems are described on the basis of an evaluation of advantages of single and multiple-point numerical integration methods. The selection criterion is the principle of minimizing computer time. The methods discussed include the Nordsieck method, the Bulirsch-Stoer extrapolation method, and the method of recursive Taylor-Steffensen power series.

Banyukevich, A.↗
NASA NTRS1975

On the cost of approximating and recognizing a noise perturbed straight line or a quadratic curve segment in the plane

Approximation of noisy data in the plane by straight lines or elliptic or single-branch hyperbolic curve segments arises in pattern recognition, data compaction, and other problems. The efficient search for and approximation of data by such curves were examined. Recursive least-squares linear curve-fitting was used, and ellipses and hyperbolas are parameterized as quadratic functions in x and y. The error minimized by the algorithm is interpreted, and central processing unit (CPU) times for estimating parameters for fitting straight lines and quadratic curves were determined and compared. CPU time for data search was also determined for the case of straight line fitting. Quadratic curve fitting is shown to require about six times as much CPU time as does straight line fitting, and curves relating CPU time and fitting error were determined for straight line fitting. Results are derived on early sequential determination of whether or not the underlying curve is a straight line.

Cooper, D. B.↗
NASA NTRS1975

Superradiant effects on pulse propagation in resonant media

Adopting the so-called genealogical construction, the eigenstates of collective operators can be expressed corresponding to a specified mode for an N-atom system in terms of those for an (N-1)-atom system. Matrix element of a collective operator of an arbitrary mode is presented which can be written as the product of an m-dependent factor and an m-independent reduced matrix element (RME). A set of recursion formulas for the RME was obtained. A graphical representation of the RME on the branching diagram for binary irreducible representations of permutation groups was then introduced. This gave a simple and systematic way of calculating the RME. Results show explicitly the geometry dependence of superradiance and the relative importance of r-conserving and r-nonconserving processes and clears up the chief difficulty encounted in the problem of N two-level atoms, spread over large regions, interacting with a multimode radiation field.

Lee, C.↗
NASA NTRS1974

Synthesis and evaluation of phase detectors for active bit synchronizers

Self-synchronizing digital data communication systems usually use active or phase-locked loop (PLL) bit synchronizers. The three main elements of PLL synchronizers are the phase detector, loop filter, and the voltage controlled oscillator. Of these three elements, phase detector synthesis is the main source of difficulty, particularly when the received signals are demodulated square-wave signals. A phase detector synthesis technique is reviewed that provides a physically realizable design for bit synchronizer phase detectors. The development is based upon nonlinear recursive estimation methods. The phase detector portion of the algorithm is isolated and analyzed.

Mcbride, A. L.↗