Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error bound”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRS2013

Flight Test Results of an Angle of Attack and Angle of Sideslip Calibration Method Using Output-Error Optimization

As part of a joint partnership between the NASA Aviation Safety Program (AvSP) and the University of Tennessee Space Institute (UTSI), research on advanced air data calibration methods has been in progress. This research was initiated to expand a novel pitot-static calibration method that was developed to allow rapid in-flight calibration for the NASA Airborne Subscale Transport Aircraft Research (AirSTAR) facility. This approach uses Global Positioning System (GPS) technology coupled with modern system identification methods that rapidly computes optimal pressure error models over a range of airspeed with defined confidence bounds. Subscale flight tests demonstrated small 2-σ error bounds with significant reduction in test time compared to other methods. Recent UTSI full scale flight tests have shown airspeed calibrations with the same accuracy or better as the Federal Aviation Administration (FAA) accepted GPS 'four-leg' method in a smaller test area and in less time. The current research was motivated by the desire to extend this method for inflight calibration of angle of attack (AOA) and angle of sideslip (AOS) flow vanes. An instrumented Piper Saratoga research aircraft from the UTSI was used to collect the flight test data and evaluate flight test maneuvers. Results showed that the output-error approach produces good results for flow vane calibration. In addition, maneuvers for pitot-static and flow vane calibration can be integrated to enable simultaneous and efficient testing of each system.

Siu, Marie-Michele↗
NASA NTRS1985

Bounds and approximations for rapid evaluation of coherent MPSK error probabilities

The error probability for MPSK detection is expressed here as a sum of a familiar upper-bound approximation and a correction term which is well suited for numerical integration. An asymptotic expansion of the correction term is derived, from which simple and extremely tight upper and lower bounds are obtained. Relative errors in using these bounds and approximations of them are graphed for cases of practical interest.

Chie, C. M.↗
NASA NTRS2015

Cauchy Drag Estimation For Low Earth Orbiters

Recent work on minimum variances estimators based on Cauchy distributions appear relevant to orbital drag estimation. Samples form Cauchy distributions which are part of a class of heavy-tailed distributions, are characterized by long stretches of fairly small variation, punctuated by large variations that are many times larger than could be expected from a Gaussian. Such behavior can occur when solar storms perturb the atmosphere. In this context, the present work describes an embedding of the scalar Idan-Speyer Cauchy Estimator to estimate density corrections, within an Extended Kalman Filter that estimates the state of a low Earth orbiter. In contrast to the baseline Kalman approach, the larger formal errors of the present approach fully and conservatively bound the predictive error distribution, even in the face of unanticipated density disturbances of hundreds of percent.

Low Earth↗
NASA NTRS2002

Reliable Real-Time Solution of Parametrized Partial Differential Equations: Reduced-Basis Output Bound Methods

We present a technique for the rapid and reliable prediction of linear-functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential components are (i) (provably) rapidly convergent global reduced basis approximations, Galerkin projection onto a space W(sub N) spanned by solutions of the governing partial differential equation at N selected points in parameter space; (ii) a posteriori error estimation, relaxations of the error-residual equation that provide inexpensive yet sharp and rigorous bounds for the error in the outputs of interest; and (iii) off-line/on-line computational procedures, methods which decouple the generation and projection stages of the approximation process. The operation count for the on-line stage, in which, given a new parameter value, we calculate the output of interest and associated error bound, depends only on N (typically very small) and the parametric complexity of the problem; the method is thus ideally suited for the repeated and rapid evaluations required in the context of parameter estimation, design, optimization, and real-time control.

Prudhomme, C.↗
NASA NTRS2021

Assessment of M2020 Terrain Relative Landing Accuracy: Flight Performance vs Predicts

Terrain Relative Navigation (TRN) was a critical enabling Entry, Descent, and Landing (EDL) technology that enabled Mars 2020 mission Perseverance rover to land at Jezero crater. TRN pro-vides real-time, autonomous, map-relative position determination and generates a landing target based on a priori knowledge of hazards. The required performance for TRN was to land within 60m of the selected target. The required 60m was sub-allocated to various error sources in three major categories: targeting error, knowledge error, and control error. The targeting error is the error in selecting an appropriate landing target and the knowledge of the target on the surface. It includes the Lander Vision System (LVS) position localization with respect the ground, the synchronization between the Lander Vision System measurement and the main Navigation filter, and errors associated with the LVS Reference Map and Safe Target Selec-tion (STS). The knowledge error is the contribution of knowledge growth from the synchronization with LVS to touchdown. The control error encompasses how accurately the system could stay on the desired reference trajectory. The TRN error budget uses a combination of analysis, simulation, and hardware test-ing results to bound the various error contributions obtained during the verification and validation process. This paper first presents a description the TRN system, focusing on the architecture of LVS and STS. The paper then gives detailed overview of the TRN error budget, with a description of the major error contribu-tions in each of the three categories. Next, the paper gives the results for three versions of the error budget, pre-launch, in-flight pre-landing, and post-landing. The paper compares the pre-flight analysis, the pre-landing analysis using in-flight data during cruise, to the post-landing analysis of the TRN performance. Pre-landing analysis best estimate of the landing performance was 33m, compared to the 60m require-ment. Post-landing analysis estimated a landing accuracy of 8.53m or better, much better than the 33m pre-landing estimate. The actual post-landing imagery calculated the distance of the rover to the targeted location to be 5m. The post-landing analysis closely bounds the image-based assessment of landing accu-racy, indicating the success of the error budget architecture in bounding the landing accuracy, as well as the fidelity of the simulations used to model and predict performance.

Chen, Allen↗
NASA NTRS1986

On the decode error probability for Reed-Solomon codes

Upper bounds on the decoder error probability for Reed-Solomon codes are derived. By definition, decoder error occurs when the decoder finds a codeword other than the transmitted codeword; this is in contrast to decoder failure, which occurs when the decoder fails to find any codeword at all. The results imply, for example, that for a t error correcting Reed-Solomon code of length q - 1 over GF(q), if more than t errors occur, the probability of decoder error is less than 1/t! In particular, for the Voyager Reed-Solomon code, the probability of decoder error given a word error is smaller than 3 x 10 to the minus 14th power. Thus, in a typical operating region with probability 100,000 of word error, the probability of undetected word error is about 10 to the minus 14th power.

Mceliece, R. J.↗
NASA NTRS1986

On the decoder error probability for Reed-Solomon codes

Upper bounds on the decoder error probability for Reed-Solomon codes are derived. By definition, decoder error occurs when the decoder finds a codeword other than the transmitted codeword; this is in contrast to decoder failure, which occurs when the decoder fails to find any codeword at all. The results imply, for example, that for a t error-correcting Reed-Solomon code of length q - 1 over GF(q), if more than t errors occur, the probability of decoder error is less than 1/t. In particular, for the Voyager Reed-Solomon code, the probability of decoder error given a word error is smaller than 3 x 10 to the minus 14th power. Thus, in a typical operating region with probability 100,000 of word error, the probability of undetected word error is about 10 to the minus 14th power.

Mceliece, Robert J.↗
NASA NTRS1971

The effect of bandlimiting of a PCM/NRZ signal on the bit-error probability.

The explicit expressions for the intersymbol interference as a function of bandwidth-bit duration product and bit positions for PCM/NRZ systems operating in the presence of Gaussian noise and in a bandlimited channel are determined. Two types of linear bit detectors are considered, integrate and dump, and bandlimit and sample. Restriction of bandwidth results in a performance degradation. The degradation of signal-to-noise ratio is presented as a function of bandwidth-bit duration product and bit patterns. The average probability of bit errors is computed for various bandwidths. The calculations of the upper bound and lower bound on the error probability are also presented.

Tu, K.↗
NASA NTRS2009

Decentralized Control of Sound Radiation Using Iterative Loop Recovery

A decentralized model-based control strategy is designed to reduce low-frequency sound radiation from periodically stiffened panels. While decentralized control systems tend to be scalable, performance can be limited due to modeling error introduced by the unmodeled interaction between neighboring control units. Since bounds on modeling error are not known in advance, it is difficult to ensure the decentralized control system will be robust without making the controller overly conservative. Therefore an iterative approach is suggested, which utilizes frequency-shaped loop recovery. The approach accounts for modeling error introduced by neighboring control loops, requires no communication between subsystems, and is relatively simple. The control strategy is evaluated numerically using a model of a stiffened aluminum panel that is representative of the sidewall of an aircraft. Simulations demonstrate that the iterative approach can achieve significant reductions in radiated sound power from the stiffened panel without destabilizing neighboring control units.

Schiller, Noah H.↗
NASA NTRS1973

On the error probability of general tree and trellis codes with applications to sequential decoding

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree codes is derived and shown to be independent of the length of the tree. An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n is derived which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence. This implication is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication and further suggest an empirical formula for the true undetected decoding error probability with sequential decoding.

Johannesson, R.↗
NASA NTRS1986

On model reduction

Three model reduction methods are described. These are the discrete balanced realizations of Mullis and Roberts (1976) where a characterization of the reduction error is given and a previously unknown L(infinity) norm bound on the reduction error, is obtained. Another method is a new model reduction technique for discrete time systems which has the advantage that the reduced order model is balanced and has an L(infinity) norm bound on the reduction error. The last method derived is a frequency weighting technique for continuous and discrete systems where it is possible to specify the approximation accuracy with frequency and also, for this method, an L(infinity) norm on the weighted reduction error is obtained.

Al-Saggaf, Ubaid M.↗
NASA NTRS2011

Flight Test Results of a GPS-Based Pitot-Static Calibration Method Using Output-Error Optimization for a Light Twin-Engine Airplane

As part of the NASA Aviation Safety Program (AvSP), a novel pitot-static calibration method was developed to allow rapid in-flight calibration for subscale aircraft while flying within confined test areas. This approach uses Global Positioning System (GPS) technology coupled with modern system identification methods that rapidly computes optimal pressure error models over a range of airspeed with defined confidence bounds. This method has been demonstrated in subscale flight tests and has shown small 2- error bounds with significant reduction in test time compared to other methods. The current research was motivated by the desire to further evaluate and develop this method for full-scale aircraft. A goal of this research was to develop an accurate calibration method that enables reductions in test equipment and flight time, thus reducing costs. The approach involved analysis of data acquisition requirements, development of efficient flight patterns, and analysis of pressure error models based on system identification methods. Flight tests were conducted at The University of Tennessee Space Institute (UTSI) utilizing an instrumented Piper Navajo research aircraft. In addition, the UTSI engineering flight simulator was used to investigate test maneuver requirements and handling qualities issues associated with this technique. This paper provides a summary of piloted simulation and flight test results that illustrates the performance and capabilities of the NASA calibration method. Discussion of maneuver requirements and data analysis methods is included as well as recommendations for piloting technique.

Martos, Borja↗
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

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 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.↗