Engineering Papers⌕ Search

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.

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

At least 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS1971

136 MHz interferometer error due to galactic nucleus.

Extraneous interfering signals are discussed which limit the basic accuracy of the 136 MHz Minitrack radio-interferometer system providing electrical phase data from which direction cosines for determining spacecraft orbits are generated. In particular, the fundamental error due to interference caused by the passage of the galactic nucleus is investigated. An expression is developed for the lower bound of the phase error when the noise source is not uniformly distributed across the Minitrack's zenith-pointed fan beam. In addition, the threshold of the Minitrack input power levels is determined below which the electrical phase is no longer determined unambiguously. The effect of the passage of the galactic nucleus coincident with the presence of a spacecraft is analyzed, and the corresponding phase error established.

Kyriakopoulos, N.↗
NASA NTRS1991

Multi-stage decoding for multi-level block modulation codes

Various types of multistage decoding for multilevel block modulation codes, in which the decoding of a component code at each stage can be either soft decision or hard decision, maximum likelihood or bounded distance are discussed. Error performance for codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. It was found that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. It was found that the difference in performance between the suboptimum multi-stage soft decision maximum likelihood decoding of a modulation code and the single stage optimum decoding of the overall code is very small, only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity.

Lin, Shu↗
NASA NTRS2001

Accuracy of Pressure Sensitive Paint

Uncertainty in pressure sensitive paint (PSP) measurement is investigated from a standpoint of system modeling. A functional relation between the imaging system output and luminescent emission from PSP is obtained based on studies of radiative energy transports in PSP and photodetector response to luminescence. This relation provides insights into physical origins of various elemental error sources and allows estimate of the total PSP measurement uncertainty contributed by the elemental errors. The elemental errors and their sensitivity coefficients in the error propagation equation are evaluated. Useful formulas are given for the minimum pressure uncertainty that PSP can possibly achieve and the upper bounds of the elemental errors to meet required pressure accuracy. An instructive example of a Joukowsky airfoil in subsonic flows is given to illustrate uncertainty estimates in PSP measurements.

Liu, Tianshu↗
NASA NTRS1977

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

Theoretical and experimental determinations of the emittance of soils and leaves are reviewed, and an error analysis of emittance and spectral emittance measurements is developed as an aid to remote sensing applications. In particular, an equation for the upper bound of the absolute error in an emittance determination is derived. The absolute error is found to decrease with an increase in contact temperature and to increase with an increase in environmental integrated radiant flux density. The difference between temperature and band radiance temperature is plotted as a function of emittance for the wavelength intervals 4.5 to 5.5 microns, 8 to 13.5 microns and 10.2 to 12.5 microns.

Kumar, R.↗
NASA NTRS1974

Upper bounds on sequential decoding performance parameters

This paper presents the best obtainable random coding and expurgated upper bounds on the probabilities of undetectable error, of t-order failure (advance to depth t into an incorrect subset), and of likelihood rise in the incorrect subset, applicable to sequential decoding when the metric bias G is arbitrary. Upper bounds on the Pareto exponent are also presented. The G-values optimizing each of the parameters of interest are determined, and are shown to lie in intervals that in general have nonzero widths. The G-optimal expurgated bound on undetectable error is shown to agree with that for maximum likelihood decoding of convolutional codes, and that on failure agrees with the block code expurgated bound. Included are curves evaluating the bounds for interesting choices of G and SNR for a binary-input quantized-output Gaussian additive noise channel.

Jelinek, F.↗
NASA NTRS1977

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

An upper bound on the average probability of error for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n with distinction between memory length and tail length is given. It is shown that the bound is independent of the length L of the information sequence if the memory length exceeds the tail length by a specified amount that depends on L. Sequential decoding simulations using the stack algorithm were conducted to test the dependence of the undetected error probability on tail length and memory length, and the results corroborated the theory.

Johannesson, R.↗
NASA NTRS1989

More On The Decoder-Error Probability Of Reed-Solomon Codes

Paper extends theory of decoder-error probability for linear maximum-distance separable (MDS) codes. General class of error-correcting codes includes Reed-Solomon codes, important in communications with distant spacecraft, military communications, and compact-disk recording industry. Advancing beyond previous theoretical developments that placed upper bounds on decoder-error probabilities, author derives an exact formula for probability PE(u) that decoder will make error when u code symbols in error.

Cheung, Kar-Ming↗
NASA NTRS1995

Transfer function bounds on the performance of turbo codes

In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-error rate for maximum likelihood decoding of turbo codes constructed with random permutations. These techniques are applied to two turbo codes with constraint length 3 and later extended to other codes. The performance predicted by these bounds is compared with simulation results. The bounds are useful in estimating the 'error floor' that is difficult to measure by simulation, and they provide insight on how to lower this floor. More refined bounds are needed for accurate performance measures at lower signal-to-noise ratios.

Divsalar, D.↗
NASA NTRS1976

Feature combinations and the Bhattacharyya criterion

A procedure for calculating a kxn rank k matrix B for data compression using the Bhattacharyya bound on the probability of error and an iterative construction using Householder transformation was developed. Two sets of remotely sensed agricultural data are used to demonstrate the application of the procedure. The results of the applications gave some indication of the extent to which the Bhattacharyya bound on the probability of error is affected by such transformations for multivariate normal populations.

Decell, H. P., Jr.↗
NASA NTRS1975

Analysis of synchronous digital-modulation schemes for satellite communication

The multipath communication channel for space communications is modeled as a multiplicative channel. This paper discusses the effects of multiplicative channel processes on the symbol error rate for quadrature modulation (QM) digital modulation schemes. An expression for the upper bound on the probability of error is derived and numerically evaluated. The results are compared with those obtained for additive channels.

Takhar, G. S.↗
DOE OSTI2022

Sivers extraction with Neural Network

Pseudo-data with simulated experimental errors can be generated to train an ensemble of Artificial Neural Networks (ANN) implemented on a regression to extract Transverse Momentum-dependent Distributions (TMDs). A preliminary analysis is presented on the reliability in extraction of the Sivers function imposed in the pseudo-data given the bounds on the experimental errors, data sparsity, and complexity of phase-space.

Fernando, Ishara↗
NASA NTRS2008

The Limits of Coding with Joint Constraints on Detected and Undetected Error Rates

We develop a remarkably tight upper bound on the performance of a parameterized family of bounded angle maximum-likelihood (BA-ML) incomplete decoders. The new bound for this class of incomplete decoders is calculated from the code's weight enumerator, and is an extension of Poltyrev-type bounds developed for complete ML decoders. This bound can also be applied to bound the average performance of random code ensembles in terms of an ensemble average weight enumerator. We also formulate conditions defining a parameterized family of optimal incomplete decoders, defined to minimize both the total codeword error probability and the undetected error probability for any fixed capability of the decoder to detect errors. We illustrate the gap between optimal and BA-ML incomplete decoding via simulation of a small code.

Undetected Error Rate↗
NASA NTRS1990

Robust tracking of a flexible spacecraft subject to induced disturbances and parametric uncertainties

A variable structure control technique combined with an operator spline for bilinear systems is implemented to a fast moving deformable structure for purposes of achieving robust tracking performance. The control torque applied to the structure is based on estimates of the structure parameters and on upper bounds of the model errors. For a rapid rotation of the deformable structure, the elastic response can be modeled by oscillators driven by angular acceleration, where stiffness and damping coefficients are also angular velocity and acceleration dependent. By transforming this 'slew-driven' elastic dynamics into a bilinear form, an operator spline can be constructed, that gives a low order estimate of the induced disturbance. An upper bound between the estimated deformation and the unknown exact deformation is also generated, which can be used where required in the sliding control correction.

Karray, Fakhreddine↗
DOE OSTI2022

Parametric model-order-reduction development for unsteady convection

A time-averaged error indicator with POD- h Greedy is developed to drive parametric model order reduction (pMOR) for 2D unsteady natural convection in a high-aspect ratio slot parameterized with the Prandtl number, Rayleigh number, and slot angle with respect to the gravity. The error indicator is extended to accommodate the energy equation and Leray regularization. Despite being two-dimensional and laminar, the target flow regime presents several challenges: 1) there is a bifurcation in the angle parameter space; 2) the solution can be multivalued, even at steady state; and 3) the solution exhibits spatio-temporal chaos at several points in the parameter space. The authors explore several reduced-order models (ROMs) and demonstrate that Leray-regularized Galerkin ROMs provide a robust solution approach for this class of flows. They further demonstrate that error-indicated pMOR can efficiently predict several QOIs, such as mean flow, mean Nusselt number and mean turbulent kinetic energy, even in the presence of a bifurcation. Finally, they show that spatio-temporal chaos can lead to lack of reproducibility in both the full-order model and the reduced-order model and that the variance in the full-order model provides a lower bound on the pMOR error in these cases.

leray regularization↗
DOE OSTI2020

Near-optimal ground state preparation

Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We assume that an initial state with non-trivial overlap with the ground state can be efficiently prepared, and the spectral gap between the ground energy and the first excited energy is bounded from below. With these assumptions we design an algorithm that prepares the ground state when an upper bound of the ground energy is known, whose runtime has a logarithmic dependence on the inverse error. When such an upper bound is not known, we propose a hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019]. These two algorithms can then be combined to prepare a ground state without knowing an upper bound of the ground energy. We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Soft-decision decoding techniques for linear block codes and their error performance analysis

The first paper presents a new minimum-weight trellis-based soft-decision iterative decoding algorithm for binary linear block codes. The second paper derives an upper bound on the probability of block error for multilevel concatenated codes (MLCC). The bound evaluates difference in performance for different decompositions of some codes. The third paper investigates the bit error probability code for maximum likelihood decoding of binary linear codes. The fourth and final paper included in this report is concerns itself with the construction of multilevel concatenated block modulation codes using a multilevel concatenation scheme for the frequency non-selective Rayleigh fading channel.

Lin, Shu↗
NASA NTRS1978

The Lovasz bound and some generalizations

The zero error capacity of a discrete memoryless channel is defined as the largest rate at which information can be transmitted over the channel with zero error probability. One channel with five inputs and outputs whose zero capacity remained unsolved until very recently is considered. An extremely powerful and general technique phased in terms of graph theory, for studying combinatorial packing problems is presented. In particular, Delsarte's linear programming bound for cliques in association schemes appears as a special case of the Lovasz bound.

Mceliece, R. J.↗