SEARCH · Engineering Papers
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.
In this paper we present a sea surface radar echo spectral analysis technique to correct for the rainfall velocity error caused by radar pointing uncertainty.
Traditional encryption techniques require packet overhead, produce processing time delay, and suffer from severe quality of service deterioration due to fades and interference in wireless channels. These issues reduce the effective transmission data rate (throughput) considerably in wireless communications, where data rate with limited bandwidth is the main constraint. In this paper, performance evaluation analyses are conducted for an integrated signaling-encryption mechanism that is secure and enables improved throughput and probability of bit-error in wireless channels. This mechanism eliminates the drawbacks stated herein by encrypting only a small portion of an entire transmitted frame, while the rest is not subject to traditional encryption but goes through a signaling process (designed transformation) with the plaintext of the portion selected for encryption. We also propose to incorporate error correction coding solely on the small encrypted portion of the data to drastically improve the overall bit-error rate performance while not noticeably increasing the required bit-rate. We focus on validating the signaling-encryption mechanism utilizing Hamming and convolutional error correction coding by conducting an end-to-end system-level simulation-based study. The average probability of bit-error and throughput of the encryption mechanism are evaluated over standard Gaussian and Rayleigh fading-type channels and compared to the ones of the conventional advanced encryption standard (AES).
Abstract Modeling adsorption phenomena on surfaces by DFT calculations often involves substantial errors, resulting in inaccurate predictions of catalytic activities. Such errors partly stem from the inaccurate description of the energetics of free molecules. Herein, we use a semiempirical group‐additivity method to correct the DFT‐calculated heats of formation of 106 carbon‐ and nitrogen‐containing gaseous compounds belonging to 15 different chemical families. PBE, PW91, RPBE and BEEF‐vdW initially yield mean absolute errors (MAEs) with respect to experiments in the range of 0.32–0.75 eV. After correcting the systematic errors, the overall MAEs decrease to ∼0.05 eV. Additionally, upon applying the corrections to three types of reaction enthalpies, the resulting MAEs are below 0.10 eV. These functional‐group corrections can be used in (electro)catalysis to correct the gas‐phase references necessary to evaluate equilibrium potentials and adsorption energies, predict error cancellation, and assess conflicting experimental data.
Particle tracking, which is an essential tool in many fields of scientific research, uses algorithms that retrieve the centroid of tracked particles with sub-pixel accuracy. However, images in which the particles occupy a small number of pixels on the detector, are in close proximity to other particles or suffer from background noise, show a systematic error in which the particle sub-pixel positions are biased towards the center of the pixel. This “pixel locking” effect greatly reduces particle tracking accuracy. In this report, we demonstrate the severity of these errors by tracking experimental (and simulated) imaging data of optically trapped silver nanoparticles and single fluorescent proteins. We show that errors in interparticle separation, angle and mean square displacement are significantly reduced by applying the corrective Single-Pixel Interior Filling Function (SPIFF) algorithm. Our work demonstrates the potential ubiquity of such errors and the general applicability of SPIFF correction to many experimental fields.
A cascaded coding scheme for a random error channel with a bit-error rate is analyzed. In this scheme, the inner code C sub 1 is an (n sub 1, m sub 1l) binary linear block code which is designed for simultaneous error correction and detection. The outer code C sub 2 is a linear block code with symbols from the Galois field GF (2 sup l) which is designed for correcting both symbol errors and erasures, and is interleaved with a degree m sub 1. A procedure for computing the probability of a correct decoding is presented and an upper bound on the probability of a decoding error is derived. The bound provides much better results than the previous bound for a cascaded coding scheme with an interleaved outer code. Example schemes with inner codes ranging from high rates to very low rates are evaluated. Several schemes provide extremely high reliability even for very high bit-error rates say 10 to the -1 to 10 to the -2 power.
Digital quantum computing paradigm offers highly desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multiqubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. Here, we construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and M-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise DAQC) with an always-on multiqubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.
Design of the electron and ion rings of the Jefferson Lab Electron-Ion Collider (JLEIC) features the low-beta Interaction Regions (IR) with detector solenoid, non-linear chromaticity compensation blocks (CCB), and spin rotator optics with solenoids. The high beta functions in the IR final focus quadrupoles (FFQ) and in the CCB magnets result in strong effects of errors in these magnets. Performance of the spin rotators may also be sensitive to the errors. The first part of this study includes the design of orbit correction system for both rings and evaluation of dynamic aperture (DA) with misalignment and the correction. The second part is devoted to the DA study with the FFQ non-linear field errors. The orbit correction design, the dynamic aperture, and the impact on error specifications are presented.
Using a finite-field transform, a simplified algorithm for decoding Reed-Solomon codes is developed to correct erasures as well as errors over the finite-field GF(q to the m power), where q is a prime and m is an integer. If the finite-field transform is a fast transform, this decoder can be faster and simpler than a decoder that uses more conventional methods.
Modification of error detection equipment for error correction
Long coherence times and high fidelity control recently achieved in scalable superconducting circuits paved the way for the growing number of experimental studies of many-qubit quantum coherent phenomena in these devices. Albeit full implementation of quantum error correction and fault tolerant quantum computation remains a challenge the near term pre-error correction devices could allow new fundamental experiments despite inevitable accumulation of errors. One such open question foundational for quantum computing is achieving the so called quantum supremacy, an experimental demonstration of a computational task that takes polynomial time on the quantum computer whereas the best classical algorithm would require exponential time and/or resources. It is possible to formulate such a task for a quantum computer consisting of less than a 100 qubits. The computational task we consider is to provide approximate samples from a non-trivial quantum distribution. This is a generalization for the case of superconducting circuits of ideas behind boson sampling protocol for quantum optics introduced by Arkhipov and Aaronson. In this presentation we discuss a proof-of-principle demonstration of such a sampling task on a 9-qubit chain of superconducting gmon qubits developed by Google. We discuss theoretical analysis of the driven evolution of the device resulting in output approximating samples from a uniform distribution in the Hilbert space, a quantum chaotic state. We analyze quantum chaotic characteristics of the output of the circuit and the time required to generate a sufficiently complex quantum distribution. We demonstrate that the classical simulation of the sampling output requires exponential resources by connecting the task of calculating the output amplitudes to the sign problem of the Quantum Monte Carlo method. We also discuss the detailed theoretical modeling required to achieve high fidelity control and calibration of the multi-qubit unitary evolution in the device. We use a novel cross-entropy statistical metric as a figure of merit to verify the output and calibrate the device controls. Finally, we demonstrate the statistics of the wave function amplitudes generated on the 9-gmon chain and verify the quantum chaotic nature of the generated quantum distribution. This verifies the implementation of the quantum supremacy protocol.
This note discusses aspects of fuzzy extraction: in particular, how the interplay between PUF entropy and the revelation of helper data affects the entropy of the underlying secret. We examine the theory behind a scheme by Dodis et alii to develop exact formulas for the entropy of the given seed, given that an adversary knows the helper data. We also give a simple lower bound on the security of the Dodis scheme that is achieved exactly in many instances. By way of several examples, we quantify the amount of entropy that can be lost due to interactions between imperfect PUF implementations and given error correction methods. We repeatedly show that understanding the details of the error correction scheme and the interaction with the PUF response is crucial to being able to estimate the entropy of the system.
Although ACTS (Advanced Communications Technology Satellite) provides an almost error-free channel during much of the day and under most conditions, there are times when it is not suitable for reliably error-free data communications when operating in the uncoded mode. Because coded operation is not always available to every earth station, measures must be taken in the end system to maintain adequate throughput when transferring data under adverse conditions. The most effective approach that we tested to improve performance was the addition of an 'outer' Reed-Solomon code through use of CCSDS (Consultative Committee for Space Data Systems) GOS 2 (a forward error correcting code). This addition can benefit all users of an ACTS channel including those applications that do not require totally reliable transport, but it is somewhat expensive because additional hardware is needed. Although we could not characterize the link noise statistically (it appeared to resemble uncorrelated white noise, the type that block codes are least effective in correcting), we did find that CCSDS GOS 2 gave an essentially error-free link at BER's (bit error rate) as high as 6x10(exp -4). For users that demand reliable transport, an ARQ (Automatic Repeat Queuing) protocol such as TCP (Transmission Control Protocol) or TP4 (Transport Protocol, Class 4) will probably be used. In this category, it comes as no surprise that the best choice of the protocol suites tested over ACTS was TP4 using CCSDS GOS 2. TP4 behaves very well over an error-free link which GOS 2 provides up to a point. Without forward error correction, however, TP4 service begins to degrade in the 10(exp -7)-10(exp -6) range and by 4x10(exp -6), it barely gives any throughput at all. If Congestion Avoidance is used in TP4, the degradation is even more pronounced. Fortunately, as demonstrated here, this effect can be more than compensated for by choosing the Selective Acknowledgment option. In fact, this option can enable TP4 to deliver some throughput at error rates as high as 10(exp -5).
In this paper, a three-stage adjusted regression forecasting model is proposed to forecast the local regression model [6]. This is a growth curve approximation model that predicts the parameters for a future linear model based on a sliding window of previous linear models. The three stages of the model are as follows: • Initial fit: train regression models on a sliding window of the date and record model coefficients. • Prediction: fit new regression models to the coefficient lists and predict the value of the next coefficient. • Error correction: correct coefficient prediction error using the residual of the last point of the coefficient list and moving average. The resulting model from the multi-stage process is a forecast of the local regression model that represents the future window of data and is referred to as the predicted line. Results suggest the three-stage model demonstrates better prediction capability compared to existing solutions.
The use of Reed-Solomon (RS) block codes over the pulse position modulated (PPM) frames to obtain the largest degree of error correction is considered. Since RS codes can correct both symbol errors and symbol erasures, a question arises as to the best way to demodulate the PPM laser fields in order to generate the input symbols for the RS decoder. The method selected for demodulating (converting the received laser field to digital symbols) defines the erasure and transmitted symbols of the laser link, and therefore determines the work error probabilities of the system. Several demodulating schemes are considered, and the effect of each on RS decoding performance computed. This computation was carried out for various optical receiver models. It is shown that simple threshold decisioning of pulse slots produces performance that degrades as the background noise increases. This is caused by the generation of too many erasures for the RS decoder to handle. A decision scheme, delta-max demodulation which offers improvement over threshold decisioning by redefining the generation of an erasure is proposed.
Counting circuit corrects errors when side lock occurs. Digital error-detection-and-correction circuit in color-television oscillator circuit provides synchronization when color-burst frequency drifts outside normal tolerance. Digital side-lock-prevention circuit used in television color-burst phase-lock-loop oscillator provides greater tolerance of off-frequency signals than crystal-controlled oscillators.
The triple probe method is an attractive technique for measuring axial and radial profiles of electron temperature T(e) and electron number density n(e) in magnetoplasmadynamic (MPD) thruster plumes. In this paper the performance and applicability of the triple probe to MPD thruster plumes is evaluated by identifying sources of error, correction methods, and error estimation techniques. Included in the analysis is an adaptation of Laframboise's exact calculations to the triple probe, aligned with the flow vector, and a preliminary investigation of the effect of flow transverse to the probe axis. In MPD thrusters, the triple probe method can provide measurement accuracy of T(e) wintin about 10 percent and n(e) within about 60 percent.
Low Density Parity Check (LDPC) Codes provide near-Shannon Capacity performance for NASA Missions. These codes have high coding rates R=0.82 and 0.875 with moderate code lengths, n=4096 and 8176. Their decoders have inherently parallel structures which allows for high-speed implementation. Two codes based on Euclidean Geometry (EG) were selected for flight ASIC implementation. These codes are cyclic and quasi-cyclic in nature and therefore have a simple encoder structure. This results in power and size benefits. These codes also have a large minimum distance as much as d,,, = 65 giving them powerful error correcting capabilities and error floors less than lo- BER. This paper will present development of the LDPC flight encoder and decoder, its applications and status.