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

Reversal-bounded multipushdown machines

Several representations of the recursively enumerable (r.e.) sets are presented. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. The second states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown stores such that in every computation, each pushdown store can make at most one reversal (that is, one change from 'pushing' to 'popping'). It is shown that this automata theoretic representation cannot be strengthened by restricting the acceptors to be deterministic multitape, nondeterministic one-tape, or nondeterministic multicounter acceptors. This provides evidence that reversal bounds are not a natural measure of computational complexity for multitape Turing acceptors.

Baker, B. S.↗
NASA NTRS1975

A least mean squares CUBIC algorithm for on-line differential of sampled analog signals

A digital computer algorithm is developed for on-line time differentiation of sampled analog voltage signals. The derivative is obtained by employing a least mean squares technique. The recursive algorithm results in a considerable reduction in computer time compared to a complete new solution of the normal equations each time a new data point is accepted. Implementation of the algorithm on a digital computer is discussed. Examples are simulated on a DEC PDP-8 computer.

Allum, J. H. J.↗
NASA NTRS1975

The treatment of bias in the square-root information filter/smoother

The Dyer-McReynolds square-root information filter (SRIF) is rederived, using recursive least-square arguments. The result is applied to a system composed partly of biases. The filter sensitivity matrix, computed covariance, and consider covariance for this augmented system are reviewed. A new computationally attractive representation for the smoothed estimates, in terms of a smoothed sensitivity matrix and a smoothed computed covariance is presented.

Bierman, G. J.↗
NASA NTRS1975

Stability criteria for two-variable polynomials

Recursive algebraic algorithms are developed for testing various stability properties of two-variable polynomials in finite number of steps. Stability is tested with respect to either the half plane or the unit circle applying the equivalent of the Routh or Marden test only two times, regardless of the degree of the polynomial.

Siljak, D. D.↗
NASA NTRS1975

Stability criteria for two-variable polynomials

Recursive algebraic algorithms are developed for testing various stability properties of two-variable polynomials in a finite number of steps. Stability is tested with respect to either the half-plane or the unit circle applying only two times the equivalent of the Routh or Marden test, regardless of the degree of the polynomial.

Siljak, D. D.↗
NASA NTRS1975

Diagrammatic technique for calculating matrix elements of collective operators in superradiance

Adopting the so-called genealogical construction, one can express the eigenstates of collective operators corresponding to a specified mode for an N-atom system in terms of those for an (N-1) atom system. Using these Dicke states as bases and using the Wigner-Eckart theorem, a matrix element of a collective operator of an arbitrary mode 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 is obtained. A graphical representation of the RME on the branching diagram for binary irreducible representations of permutation groups is then introduced. This gives a simple and systematic way of calculating the RME. This method is especially useful when the cooperation number r is close to N/2, where almost exact asymptotic expressions can be obtained easily. The result shows explicity the geometry dependence of superradiance and the relative importance of r-conserving and r-nonconserving processes.

Lee, C. T.↗
NASA NTRS1975

Ground truth applications to orbit refinements

A weighted least-squares recursive estimator program is reported for simulating spacecraft orbital position by analyzing earth and sun sensor data. The program uses constant time adjustment for a set of ephemeris data to eliminate intrack error and to improve attitude determination accuracy.

White, R. L.↗
NASA NTRS1975

A two parameter survey of periodic orbits in the restricted problem of three bodies

Within the context of the restricted problem of three bodies the effects caused by varying the mass ratio of the primaries and the eccentricity of their orbits, upon periodic orbits of the infinitesimal mass which are numerical continuations of circular orbits in the ordinary problem of two bodies are shown. A recursive power series technique is used to numerically integrate the equations of motion as well as the first variational equations in order to generate a two parameter family of perodic orbits and identify the linear stability characteristics. Seven such families are investigated with equally spaced mass ratios from 0.0 to 1.0 and eccentricities of the orbits of the primaries in a range 0.0 to 0.6. Stable orbits are associated with large distances of the infinitesimal mass from the perturbing primary, nearly circular motion of the primaries, and small mass ratios of the primaries. Unstable orbits for the infinitesimal mass are associated with small distances from the perturbing primary, highly elliptic orbits of the primaries and large mass ratios.

Shelus, P. J.↗
NASA NTRS1976

On the role of dimensionality and sample size for unstructured and structured covariance matrix estimation

The experimental observation that a surprisingly small sample size vis-a-vis dimension is needed to achieve good signal-to-interference ratio (SIR) performance with an adaptive predetection filter is explained. The adaptive filter requires estimates as obtained by a recursive stochastic algorithm of the inverse of the filter input data covariance matrix. The SIR performance with sample size is compared for the situations where the covariance matrix estimates are of unstructured (generalized) form and of structured (finite Toeplitz) form; the latter case is consistent with weak stationarity of the input data stochastic process.

Morgera, S. D.↗