SEARCH · Engineering Papers

Results for “error bounds”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 397 records · Page 22

All sources NASA NTRS DOE OSTI

NASA NTRS1983

On the probability of undetected error for the maximum distance separable codes

The performance of maximum-distance-separable codes with symbols from GF(1) when they are used for pure error detection or for simultaneous error correction and detection is investigated. These codes are good for symbol error detection. Their probability of undetected error is upper bounded by q to the -r and decreases monotonically as the symbol error probability epsilon decreases from (q-1)/q to 0, where r is the number of parity-check symbols of a code.

Kasami, T.↗

NASA NTRS1984

On the probability of undetected error for the maximum distance separable codes

Kasami, T.↗

NASA NTRS1992

Robust adaptive kinematic control of redundant robots

The paper presents a general method for the resolution of redundancy that combines the Jacobian pseudoinverse and augmentation approaches. A direct adaptive control scheme is developed to generate joint angle trajectories for achieving desired end-effector motion as well as additional user defined tasks. The scheme ensures arbitrarily small errors between the desired and the actual motion of the manipulator. Explicit bounds on the errors are established that are directly related to the mismatch between actual and estimated pseudoinverse Jacobian matrix, motion velocity and the controller gain. It is shown that the scheme is tolerant of the mismatch and consequently only infrequent pseudoinverse computations are needed during a typical robot motion. As a result, the scheme is computationally fast, and can be implemented for real-time control of redundant robots. A method is incorporated to cope with the robot singularities allowing the manipulator to get very close or even pass through a singularity while maintaining a good tracking performance and acceptable joint velocities. Computer simulations and experimental results are provided in support of the theoretical developments.

Tarokh, M.↗

NASA NTRS1972

Bounding filter - A simple solution to lack of exact a priori statistics.

Wiener and Kalman-Bucy estimation problems assume that models describing the signal and noise stochastic processes are exactly known. When this modeling information, i.e., the signal and noise spectral densities for Wiener filter and the signal and noise dynamic system and disturbing noise representations for Kalman-Bucy filtering, is inexactly known, then the filter's performance is suboptimal and may even exhibit apparent divergence. In this paper a system is designed whereby the actual estimation error covariance is bounded by the covariance calculated by the estimator. Therefore, the estimator obtains a bound on the actual error covariance which is not available, and also prevents its apparent divergence.

Nahi, N. E.↗

NASA NTRS1972

Noncommuting observables in quantum detection and estimation theory

Basing decisions and estimates on simultaneous approximate measurements of noncommuting observables in a quantum receiver is shown to be equivalent to measuring commuting projection operators on a larger Hilbert space than that of the receiver itself. The quantum-mechanical Cramer-Rao inequalities derived from right logarithmic derivatives and symmetrized logarithmic derivatives of the density operator are compared, and it is shown that the latter give superior lower bounds on the error variances of individual unbiased estimates of arrival time and carrier frequency of a coherent signal. For a suitably weighted sum of the error variances of simultaneous estimates of these, the former yield the superior lower bound under some conditions.

Helstrom, C. W.↗

NASA NTRS1974

Noncommuting observables in quantum detection and estimation theory

Basing decisions and estimates on simultaneous approximate measurements of noncommuting observables in a quantum receiver is shown to be equivalent to measuring commuting projection operators on a large Hilbert space than that of the receiver itself. The quantum-mechanical Cramer-Rao inequalities derived from right logarithmic derivatives and symmetrized logarithmic derivatives of the density operator are compared, and it is shown that the latter give superior lower bounds on the error variances of individual unbiased estimates of arrival time and carrier frequency of a coherent signal. For a suitably weighted sum of the error variances of simultaneous estimates of these, the former yield the superior lower bound under some conditions.

Helstrom, C. W.↗

DOE OSTI2021

Parallel transport dynamics for mixed quantum states with applications to time-dependent density functional theory

Direct simulation of the von Neumann dynamics for a general (pure or mixed) quantum state can often be expensive. One prominent example is the real-time time-dependent density functional theory (rt-TDDFT), a widely used framework for the first principle description of many-electron dynamics in chemical and materials systems. Practical rt-TDDFT calculations often avoid the direct simulation of the von Neumann equation, and solve instead a set of Schrödinger equations, of which the dynamics is equivalent to that of the von Neumann equation. However, the time step size employed by the Schrödinger dynamics is often much smaller. Here, in order to improve the time step size and the overall efficiency of the simulation, we generalize a recent work of the parallel transport (PT) dynamics for simulating pure states [An, Lin, Multiscale Model. Simul. 18, 612, 2020] to general quantum states. The PT dynamics provides the optimal gauge choice, and can employ a time step size comparable to that of the von Neumann dynamics. Going beyond the linear and near adiabatic regime in previous studies, we find that the error of the PT dynamics can be bounded by certain commutators between Hamiltonians, density matrices, and their derived quantities. Such a commutator structure is not present in the Schrödinger dynamics. We demonstrate that the parallel transport-implicit midpoint (PT-IM) method is a suitable method for simulating the PT dynamics, especially when the spectral radius of the Hamiltonian is large. The commutator structure of the error bound, and numerical results for model rt-TDDFT calculations in both linear and nonlinear regimes, confirm the advantage of the PT dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1976

Arrival time of satellite-broadened laser pulses

A method for measuring the time of arrival of very narrow laser pulses which have been reflected and randomly broadened by a target is examined. It is known that these return pulses from the target have very small rise times. A threshold detection algorithm that detects the rising edge of the pulse is used for obtaining the pulse arrival times. The errors of the scheme are evaluated numerically for different pulse shapes, and a loose bound on the errors of detecting a typical pulse is obtained. A gamma-density model is used to characterize the random gain processes of the optical receiver, and the effect of such random gains on the errors of threshold detection is analyzed.

Iyer, R. S.↗

NASA NTRS1987

Proof that timing requirements of the FDDI token ring protocol are satisfied

The fiber distributed data interface (FDDI) is an ANSI draft proposed standard for a 100 Mbit/s fiber-optic token ring. The FDDI timed token access protocol provides dynamic adjustment of the load offered to the ring, with the goal of maintaining a specified token rotation time and of providing a guaranteed upper bound on time between successive arrivals of the token at a station. FDDI also provides automatic recovery when errors occur. The bound on time between successive token arrivals is guaranteed only if the token rotates quickly enough to satisfy timer requirements in each station when all ring resources are functioning properly. Otherwise, recovery would be initiated unnecessarily. The purpose of this paper is to prove that FDDI timing requirements are satisfied, i.e., the token rotates quickly enough to prevent initiation of recovery unless there is failure of a physical resource or unless the network management entity within a station initiates the recovery process.

Johnson, Marjory J.↗

NASA NTRS1984

Software reliability: Additional investigations into modeling with replicated experiments

The effects of programmer experience level, different program usage distributions, and programming languages are explored. All these factors affect performance, and some tentative relational hypotheses are presented. An analytic framework for replicated and non-replicated (traditional) software experiments is presented. A method of obtaining an upper bound on the error rate of the next error is proposed. The method was validated empirically by comparing forecasts with actual data. In all 14 cases the bound exceeded the observed parameter, albeit somewhat conservatively. Two other forecasting methods are proposed and compared to observed results. Although demonstrated relative to this framework that stages are neither independent nor exponentially distributed, empirical estimates show that the exponential assumption is nearly valid for all but the extreme tails of the distribution. Except for the dependence in the stage probabilities, Cox's model approximates to a degree what is being observed.

Nagel, P. M.↗

NASA NTRS1976

Convolutional code performance in the Rician fading channel

The performance of short constraint length convolutional codes in conjunction with binary phase-shift keyed (BPSK) modulation and Viterbi maximum likelihood decoding on the classical Rician fading channel is examined in detail. Primary interest is in the bit error probability performance as a function of E sub b/N sub 0 parameterized by the fading channel parameters. Fairly general upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results in the two extremes of zero channel memory and infinite channel memory. The efficacy of simple block interleaving in combating the memory of the channel is thoroughly explored. Results include the effects of fading on tracking loop performance and the subsequent impact on overall coded system performance. The approach is analytical where possible; otherwise resort is made to digital computer simulation.

Modestino, J. W.↗

NASA NTRS1977

Determination and error analysis of emittance and spectral emittance measurements by remote sensing

The author has identified the following significant results. From the theory of remote sensing of surface temperatures, an equation of the upper bound of absolute error of emittance was determined. It showed that the absolute error decreased with an increase in contact temperature, whereas, it increased with an increase in environmental integrated radiant flux density. Change in emittance had little effect on the absolute error. A plot of the difference between temperature and band radiance temperature vs. emittance was provided for the wavelength intervals: 4.5 to 5.5 microns, 8 to 13.5 microns, and 10.2 to 12.5 microns.

Dejesusparada, N.↗

DOE OSTI2026

Optimal sensing on an asymmetric exceptional surface

We study the connection between exceptional points (EPs) and optimal parameter estimation, in a simple system consisting of two counterpropagating traveling wave modes in a microring resonator. The unknown parameter to be estimated is the strength of a perturbing cross-coupling between the two modes. Partially reflecting the output of one mode into the other creates a non-Hermitian Hamiltonian that exhibits a family of EPs, creating an exceptional surface (ES). We use a fully quantum treatment of field inputs and noise sources to obtain a quantitative bound on the estimation error by calculating the quantum Fisher information (QFI) in the output fields, whose inverse gives the Cramér-Rao lower bound on the mean-squared error of any unbiased estimator. We determine the bounds for two input states, namely, a semiclassical coherent state and a highly nonclassical NOON state. We find that the QFI is enhanced in the presence of an EP for both of these input states and that both states can saturate the Cramér-Rao bound. We then identify idealized yet experimentally feasible measurements that achieve the minimum bound for these two input states. We also investigate how the QFI changes for parameter values that do not lie on the ES, finding that these can have a larger QFI, suggesting alternative routes to optimize the parameter estimation for this problem.

Exceptional points↗

NASA NTRS2010

Formal Verification of Safety Buffers for Sate-Based Conflict Detection and Resolution

The information provided by global positioning systems is never totally exact, and there are always errors when measuring position and velocity of moving objects such as aircraft. This paper studies the effects of these errors in the actual separation of aircraft in the context of state-based conflict detection and resolution. Assuming that the state information is uncertain but that bounds on the errors are known, this paper provides an analytical definition of a safety buffer and sufficient conditions under which this buffer guarantees that actual conflicts are detected and solved. The results are presented as theorems, which were formally proven using a mechanical theorem prover.

Herencia-Zapana, Heber↗

NASA NTRS1976

Performance of convolutionally encoded noncoherent MFSK modem in fading channels

The performance of a convolutionally encoded noncoherent multiple-frequency shift-keyed (MFSK) modem utilizing Viterbi maximum-likelihood decoding and operating on a fading channel is described. Both the lognormal and classical Rician fading channels are considered for both slow and time-varying channel conditions. Primary interest is in the resulting bit error rate as a function of the ratio between the energy per transmitted information bit and noise spectral density, parameterized by both the fading channel and code parameters. Fairly general upper bounds on bit error probability are provided and compared with simulation results in the two extremes of zero and infinite channel memory. The efficacy of simple block interleaving in combatting channel memory effects are thoroughly explored. Both quantized and unquantized receiver outputs are considered.

Modestino, J. W.↗

NASA NTRS1982

Coded error probability evaluation for antijam communication systems

We present a general union-Chernoff bound on the bit error probability for coded communication systems and apply it to examples of antijam systems. The key feature of this bound is the decoupling of the coding aspects of the system from the remaining part of the communication system which includes jamming, suboptimum detectors, and arbitrary decoding metrics which may or may not use jammer state knowledge

Omura, J. K.↗

NASA NTRS1990

Finding the complete path and weight enumerators of convolutional codes

A method for obtaining the complete path enumerator T(D, L, I) of a convolutional code is described. A system of algebraic equations is solved, using a new algorithm for computing determinants, to obtain T(D, L, I) for the (7,1/2) NASA standard code. Generating functions, derived from T(D, L, I) are used to upper bound Viterbi decoder error rates. This technique is currently feasible for constraint length K less than 10 codes. A practical, fast algorithm is presented for computing the leading nonzero coefficients of the generating functions used to bound the performance of constraint length K less than 20 codes. Code profiles with about 50 nonzero coefficients are obtained with this algorithm for the experimental K = 15, rate 1/4, code in the Galileo mission and for the proposed K = 15, rate 1/6, 2-dB code.

Onyszchuk, I.↗

NASA NTRS2017

Application of GPS to Enable Launch Vehicle Upper Stage Heliocentric Disposal

To properly dispose of the upper stage of the Space Launch System, the vehicle must perform a burn in Earth orbit to perform a close flyby of the Lunar surface to gain adequate energy to enter into heliocentric space. This architecture was selected to meet NASA requirements to limit orbital debris in the Earth-Moon system. The choice of a flyby for heliocentric disposal was driven by mission and vehicle constraints. This paper describes the SLS mission for Exploration Mission -1, a high level overview of the Block 1 vehicle, and the various disposal options considered. The research focuses on this analysis in terms of the mission design and navigation problem, focusing on the vehicle-level requirements that enable a successful mission. An inertial-only system is shown to be insufficient for heliocentric flyby due to large inertial integration errors from launch through disposal maneuver while on a trans-lunar trajectory. The various options for aiding the navigation system are presented and details are provided on the use of GPS to bound the state errors in orbit to improve the capability for stage disposal. The state estimation algorithm used is described as well as its capability in determination of the vehicle state at the start of the planned maneuver. This data, both dispersions on state and on errors, is then used to develop orbital targets to use for meeting the required Lunar flyby for entering onto a heliocentric trajectory. The effect of guidance and navigation errors on this capability is described as well as the identified constraints for achieving the disposal requirements. Additionally, discussion is provided on continued analysis and identification of system considerations that can drive the ability to integrate onto a vehicle intended for deep space.

Anzalone, Evan J.↗