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 451 records · Page 25

Galileo EM-2 contributions to the lunar control network

A local control network is being developed using Galileo images that cover the region north of the Apollo area and lie between 10 and 100 degrees east longitude. This network is tied to the Apollo control network and will have a positional accuracy of approximately 500-1500 m. This region has been photographed by Earth-based telescopes and the Mariner 10 and Lunar Orbiter spacecraft, but the Gallileo images are preferred for control because of their superior viewing angles, resolution, and Galileo's geometrically stable sensor. Based on Davies et al., 1987, the potential accuracy of the near-side Apollo network is estimated to be between 50 and 300 m. The laser ranging retroreflector locations at the Apollo 11, 14, and 15 sites and the Lunikhod 2 site have been determined with an accuracy of about 10 m. The locations of the ALSEP transmitters relative to the retroreflectors have also been measured. These known coordinates are used to estimate errors in the Apollo network. The telescopic control is approximately bounded by 75 degrees north and south latitude and 75 degrees east and west longitudes. The accuracy of the telescopic network is thought to be about one to two km. Thus, the Galileo network might improve coordinates in the telescopic area as well as north and east of it.

Davies, M. E.↗

Retransmission error control with memory

In this paper, an error control technique that is a basic improvement over automatic-repeat-request ARQ is presented. Erroneously received blocks in an ARQ system are used for error control. The technique is termed ARQ-with-memory (MRQ). The general MRQ system is described, and simple upper and lower bounds are derived on the throughput achievable by MRQ. The performance of MRQ with respect to throughput, message delay and probability of error is compared to that of ARQ by simulating both systems using error data from a VHF satellite channel being operated in the ALOHA packet broadcasting mode.

Sindhu, P. S.↗

Flight-test measurements of ground effect - STOL airplanes

Powered-lift STOL aircraft exhibit special aerodynamic characteristics that necessitate changes in established procedures of flight testing. Methods used in ground-effect flight testing of STOL-configured aircraft are described, with special emphasis on results obtained from tests of the YC-15 AMST prototype aircraft. Ground effect on lift and on drag is theoretically analyzed in terms of trailing vortices, bound vortex, and flight-path angle. Airspeed static source position errors are induced by ground constraint and must be considered in the data reduction. Flight-test results show a positive lift increment due to ground proximity.

Parks, E. K.↗

Reassessment of net radiation measurements in the atmosphere of Venus

An analysis was performed of the possible error mechanisms which degraded the IR net flux measurements made by the three small atmospheric probes dispatched from the Pioneer Venus spacecraft. The larger errors began below 30 km, and caused the data to be inconsistent with previous estimates of the atmospheric opacity. Evaluations were made of the possible radiation field perturbations behind each probe, cloud particle deposition on the sensor windows, and thermal disturbances within the sensors because of gas flow through the window retainers. The gas flow through the retainers was identified as the most likely error source, and was demonstrated in laboratory tests. A strong Reynolds number dependence was also found. Radiative transfer calculations were performed to account for the errors, using the constraints defined by the tests. Upper and lower bounds were calculated for the true net flux for both day and night conditions.

Revercomb, H. E.↗

New short constraint length, rate 1/N convolutional codes which minimize the required SNR for given desired bit error rates

It is pointed out that for a convolutional coding system, the Bit Error Rate (BER) at the Viterbi decoder output is upper-bounded by the transfer function bound. A large number of rate 1/N convolutional codes have been reported. The criteria used for determining the quality of a code in code search procedures, however, may not be very suited for cases in which the required BER is in the moderate range. For this reason, it may be best to select the code with the aim to minimize the required SNR for a given disired BER. Partial code searching techniques are presented, and a table listing the code search results is provided.

Lee, P. J.↗

Uncertainty Quantification for Polynomial Systems via Bernstein Expansions

This paper presents a unifying framework to uncertainty quantification for systems having polynomial response metrics that depend on both aleatory and epistemic uncertainties. The approach proposed, which is based on the Bernstein expansions of polynomials, enables bounding the range of moments and failure probabilities of response metrics as well as finding supersets of the extreme epistemic realizations where the limits of such ranges occur. These bounds and supersets, whose analytical structure renders them free of approximation error, can be made arbitrarily tight with additional computational effort. Furthermore, this framework enables determining the importance of particular uncertain parameters according to the extent to which they affect the first two moments of response metrics and failure probabilities. This analysis enables determining the parameters that should be considered uncertain as well as those that can be assumed to be constants without incurring significant error. The analytical nature of the approach eliminates the numerical error that characterizes the sampling-based techniques commonly used to propagate aleatory uncertainties as well as the possibility of under predicting the range of the statistic of interest that may result from searching for the best- and worstcase epistemic values via nonlinear optimization or sampling.

Crespo, Luis G.↗

Powered Descent Guidance with General Thrust-Pointing Constraints

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Carson, John M., III↗

Cyclic unequal error protection codes constructed from cyclic codes of composite length

The distance structure of cyclic codes of composite length was investigated. A lower bound on the minimum distance for this class of codes is derived. In many cases, the lower bound gives the true minimum distance of a code. Then the distance structure of the direct sum of two cyclic codes of composite length were investigated. It was shown that, under certain conditions, the direct-sum code provides two levels of error correcting capability, and hence is a two-level unequal error protection (UEP) code. Finally, a class of two-level UEP cyclic direct-sum codes and a decoding algorithm for a subclass of these codes are presented.

Lin, Shu↗

Estimating Surface Radiation Fluxes in the Arctic from TOVS Brightness Temperatures

A new method for estimating downwelling shortwave and longwave radiation fluxes in the Arctic from TOVS brightness temperatures has been developed. The method employs a neural network to bypass computationally intensive inverse and for-ward radiative transfer calculations, Results from two drifting ice camps (CEAREX, LeadEx) and from one coastal station show that downwelling fluxes can be estimated with r.m.s. errors of 20 W/sq m for longwave radiation and 35 W/sq m for shortwave radiation. Mean errors are less than 4 W/sq m and are well within the bounds required for many climate process studies.

Schweiger, A. J.↗

Spacecraft Thermal and Optical Modeling Impacts on Estimation of the GRAIL Lunar Gravity Field

We summarize work performed involving thermo-optical modeling of the two Gravity Recovery And Interior Laboratory (GRAIL) spacecraft. We derived several reconciled spacecraft thermo-optical models having varying detail. We used the simplest in calculating SRP acceleration, and used the most detailed to calculate acceleration due to thermal re-radiation. For the latter, we used both the output of pre-launch finite-element-based thermal simulations and downlinked temperature sensor telemetry. The estimation process to recover the lunar gravity field utilizes both a nominal thermal re-radiation accleration history and an apriori error model derived from that plus an off-nominal history, which bounds parameter uncertainties as informed by sensitivity studies.

thermal modeling↗

Poster error probability in the Mu-11 Sequential Ranging System

An expression is derived for the posterior error probability in the Mu-2 Sequential Ranging System. An algorithm is developed which closely bounds the exact answer and can be implemented in the machine software. A computer simulation is provided to illustrate the improved level of confidence in a ranging acquisition using this figure of merit as compared to that using only the prior probabilities. In a simulation of 20,000 acquisitions with an experimentally determined threshold setting, the algorithm detected 90% of the actual errors and made false indication of errors on 0.2% of the acquisitions.

Coyle, C. W.↗

Trajectory Specification for High-Capacity Air Traffic Control

In the current air traffic management system, the fundamental limitation on airspace capacity is the cognitive ability of human air traffic controllers to maintain safe separation with high reliability. The doubling or tripling of airspace capacity that will be needed over the next couple of decades will require that tactical separation be at least partially automated. Standardized conflict-free four-dimensional trajectory assignment will be needed to accomplish that objective. A trajectory specification format based on the Extensible Markup Language is proposed for that purpose. This format can be used to downlink a trajectory request, which can then be checked on the ground for conflicts and approved or modified, if necessary, then uplinked as the assigned trajectory. The horizontal path is specified as a series of geodetic waypoints connected by great circles, and the great-circle segments are connected by turns of specified radius. Vertical profiles for climb and descent are specified as low-order polynomial functions of along-track position, which is itself specified as a function of time. Flight technical error tolerances in the along-track, cross-track, and vertical axes define a bounding space around the reference trajectory, and conformance will guarantee the required separation for a period of time known as the conflict time horizon. An important safety benefit of this regimen is that the traffic will be able to fly free of conflicts for at least several minutes even if all ground systems and the entire communication infrastructure fail. Periodic updates in the along-track axis will adjust for errors in the predicted along-track winds.

Paielli, Russell A.↗

Error analysis of bent ray radio occultation measurments

There are two types of experimental measurement errors of the Doppler data associated with the radio occultation, random and systematic. Random errors are due to thermal noise in the transmission channel, and the phase lock loop, and quantization error in the digital circuitry. These are called noise type errors. The systematic errors are due to geometric uncertainty and equipment phase instability. Considered is the amount of uncertainty, due to random measurement errors, in the refractivity profiles reconstructed by this type of indirect sensing experiment. A class of refractivity profiles is defined which approximately fit the set of measured data. Bounds are placed on the extent of this class of solution profiles. To accomplish this, the sensivity of the reconstructed refractivity profiles to errors in the measured quantity and the statistics of the errors in the measurement are examined.

Saintgermain, R. L.↗

Free distance bounds for convolutional codes

The best asymptotic bounds presently known on free distance for convolutional codes are presented from a unified point of view. Upper and lower bounds for both time-varying and fixed codes are obtained. A comparison is made between bounds for nonsystematic and systematic codes which shows that more free distance is available with nonsystematic codes. This result is important when selecting codes for use with sequential or maximum-likelihood (Viterbi) decoding since the probability of decoding error is closely related to the free distance of the code. An ancillary result, used in proving the lower bound on free distance for time-varying nonsystematic codes, furnishes a generalization of two earlier bounds on the definite decoding minimum distance of convolutional codes.

Costello, D. J., Jr.↗

An Upper Bound on High Speed Satellite Collision Probability When Only One Object has Position Uncertainty Information

Upper bounds on high speed satellite collision probability, PC †, have been investigated. Previous methods assume an individual position error covariance matrix is available for each object. The two matrices being combined into a single, relative position error covariance matrix. Components of the combined error covariance are then varied to obtain a maximum PC. If error covariance information for only one of the two objects was available, either some default shape has been used or nothing could be done. An alternative is presented that uses the known covariance information along with a critical value of the missing covariance to obtain an approximate but potentially useful Pc upper bound.

Frisbee, Joseph H., Jr.↗

Attitude steering for space shuttle based synthetic aperture radars

A technique is presented to steer the antenna beam to the zero-Doppler line for a spacecraft platform which operates in a non-zero roll attitude. The purposes of employing this attitude steering technique are reduction of the Doppler centroid error caused by the variation in target elevation; reduction of the Doppler centroid bound; and reduction of the Doppler drift. It is shown that a fixed attitude sequence can be easily accommodated in the radar command sequence to achieve nearly zero-Doppler steering. Implementation of this technique improves the image quality as well as simplifies the processor design.

Chang, C. Y.↗

Formal Safety Certification of Aerospace Software

In principle, formal methods offer many advantages for aerospace software development: they can help to achieve ultra-high reliability, and they can be used to provide evidence of the reliability claims which can then be subjected to external scrutiny. However, despite years of research and many advances in the underlying formalisms of specification, semantics, and logic, formal methods are not much used in practice. In our opinion this is related to three major shortcomings. First, the application of formal methods is still expensive because they are labor- and knowledge-intensive. Second, they are difficult to scale up to complex systems because they are based on deep mathematical insights about the behavior of the systems (t.e., they rely on the "heroic proof"). Third, the proofs can be difficult to interpret, and typically stand in isolation from the original code. In this paper, we describe a tool for formally demonstrating safety-relevant aspects of aerospace software, which largely circumvents these problems. We focus on safely properties because it has been observed that safety violations such as out-of-bounds memory accesses or use of uninitialized variables constitute the majority of the errors found in the aerospace domain. In our approach, safety means that the program will not violate a set of rules that can range for the simple memory access rules to high-level flight rules. These different safety properties are formalized as different safety policies in Hoare logic, which are then used by a verification condition generator along with the code and logical annotations in order to derive formal safety conditions; these are then proven using an automated theorem prover. Our certification system is currently integrated into a model-based code generation toolset that generates the annotations together with the code. However, this automated formal certification technology is not exclusively constrained to our code generator and could, in principle, also be integrated with other code generators such as RealTime Workshop or even applied to legacy code. Our approach circumvents the historical problems with formal methods by increasing the degree of automation on all levels. The restriction to safety policies (as opposed to arbitrary functional behavior) results in simpler proof problems that can generally be solved by fully automatic theorem proves. An automated linking mechanism between the safety conditions and the code provides some of the traceability mandated by process standards such as DO-178B. An automated explanation mechanism uses semantic markup added by the verification condition generator to produce natural-language explanations of the safety conditions and thus supports their interpretation in relation to the code. It shows an automatically generated certification browser that lets users inspect the (generated) code along with the safety conditions (including textual explanations), and uses hyperlinks to automate tracing between the two levels. Here, the explanations reflect the logical structure of the safety obligation but the mechanism can in principle be customized using different sets of domain concepts. The interface also provides some limited control over the certification process itself. Our long-term goal is a seamless integration of certification, code generation, and manual coding that results in a "certified pipeline" in which specifications are automatically transformed into executable code, together with the supporting artifacts necessary for achieving and demonstrating the high level of assurance needed in the aerospace domain.

Denney, Ewen↗