Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error correction”

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 343 records · Page 19

Performance of some block codes on a Gaussian channel

A technique proposed by Chase (1972) is used to evaluate the performance of several fairly long binary block codes on a wideband additive Gaussian channel. Considerations leading to the use of Chase's technique are discussed. Chase's concepts are first applied to the most powerful practical class of binary codes, the BCH codes with Berlekamp's (1972) decoding algorithm. Chase's algorithm is then described along with proposed selection of candidate codes. Results are presented of applying Chase's algorithm to four binary codes: (23, 12) Golay code, (32, 16) second-order Reed-Muller code, (63, 36) 5-error correcting BCH code, and (95, 39) 9-error correcting shortened BCH code. It is concluded that there are many block codes of length not exceeding 100 with extremely attractive maximum likelihood decoding performance on a Gaussian channel. BCH codes decoded via Berlekamp's binary decoding algorithm and Chase's idea are close to being practical competitors to short-constraint length convolutional codes with Viterbi decoding.

Baumert, L. D.↗

A terabyte linear tape recorder

A plan has been formulated and selected for a NASA Phase 2 SBIR award for using the VLBA tape recorder for recording general data. The VLBA tape recorder is a high-speed, high-density linear tape recorder developed for Very Long Baseline Interferometry (VLBI) which is presently capable of recording at rates up to 2 Gbit/sec and holding up to 1 Terabyte of data on one tape, using a special interface and not employing error correction. A general-purpose interface and error correction will be added so that the recorder can be used in other high-speed, high-capacity applications.

Webber, John C.↗

Method and apparatus for selective and power-aware memory error protection and memory management

A method for providing selective memory error protection responsive to a predictable failure notification associated with at least one portion of a memory in a computing system includes: obtaining an active error correcting code (ECC) configuration corresponding to the portion of the memory; determining whether the active ECC configuration is sufficient to correct at least one error in the portion of the memory affected by the predictable failure notification; when the active ECC configuration is insufficient to correct the error, determining whether data corruption can be tolerated by an application running on the computing system; when data corruption cannot be tolerated by the application, determining whether a stronger ECC level is available and, if a stronger ECC level is available, increasing a strength of the active ECC configuration; and when data corruption can be tolerated, performing page reassignment and aggregation of non-critical data.

97 MATHEMATICS AND COMPUTING↗

Detecting and correcting hard errors in a memory array

Hard errors in the memory array can be detected and corrected in real-time using reusable entries in an error status buffer. Data may be rewritten to a portion of a memory array and a register in response to a first error in data read from the portion of the memory array. The rewritten data may then be written from the register to an entry of an error status buffer in response to the rewritten data read from the register differing from the rewritten data read from the portion of the memory array.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

The Effectiveness of TAG or Guard-Gates in SET Suppression Using Delay and Dual-Rail Configurations at 0.35 microns

Design options for decreasing the susceptibility of integrated circuits to Single Event Upset (SEU) fall into two categories: (1) increasing the critical charge to cause an upset at a particular node, and (2) employing redundancy to mask or correct errors. With decreasing device sizes on an Integrated Circuit (IC), the amount of charge required to represent a logic state has steadily reduced. Critical charge methods such as increasing drive strength or increasing the time required to change state as in capacitive or resistive hardening or delay based approaches extract a steadily increasing penalty as a percentage of device resources and performance. Dual redundancy is commonly assumed only to provide error detection with Triple Modular Redundancy (TMR) required for correction, but less well known methods employ dual redundancy to achieve full error correction by voting two inputs with a prior state to resolve ambiguity. This requires special circuits such as the Whitaker latch [1], or the guard-gate [2] which some of us have called a Transition AND Gate (TAG) [3]. A 2-input guard gate is shown in Figure 1. It is similar to a Muller Completion Element [4] and relies on capacitance at node "out" to retain the prior state when inputs disagree, while eliminating any output buffer which would be susceptible to radiation strikes. This paper experimentally compares delay based and dual rail flip-flop designs wherein both types of circuits employ guard-gates to optimize layout and performance, and draws conclusions about design criteria and suitability of each option. In both cases a design goal is protection against Single Event Transients (SET) in combinational logic as well as SEU in the storage elements. For the delay based design, it is also a goal to allow asynchronous clear or preset inputs on the storage elements, which are often not available in radiation tolerant designs.

Shuler, Robert L.↗

Techniques for containing error propagation in compression/decompression schemes

Data compression has the potential for increasing the risk of data loss. It can also cause bit error propagation, resulting in catastrophic failures. There are a number of approaches possible for containing error propagation due to data compression: (1) data retransmission; (2) data interpolation; (3) error containment; and (4) error correction. The most fruitful techniques will be ones where error containment and error correction are integrated with data compression to provide optimal performance for both. The error containment characteristics of existing compression schemes should be analyzed for their behavior under different data and error conditions. The error tolerance requirements of different data sets need to be understood, so guidelines can then be developed for matching error requirements to suitable compression algorithms.

Kobler, Ben↗

Method for detection and correction of errors in speech pitch period estimates

A method of detecting and correcting received values of a pitch period estimate of a speech signal for use in a speech coder or the like. An average is calculated of the nonzero values of received pitch period estimate since the previous reset. If a current pitch period estimate is within a range of 0.75 to 1.25 times the average, it is assumed correct, while if not, a correction process is carried out. If correction is required successively for more than a preset number of times, which will most likely occur when the speaker changes, the average is discarded and a new average calculated.

Bhaskar, Udaya↗

Mitigating cosmic-ray-like correlated events with a modular quantum processor

Quantum processors based on superconducting qubits are being scaled to larger qubit numbers, enabling the implementation of small-scale quantum error-correction codes. However, catastrophic chip-scale correlated errors have been observed in these processors, attributed to, e.g., cosmic ray impacts, which challenge conventional error-correction codes such as the surface code. These events are characterized by a temporary but pronounced suppression of the qubit-energy relaxation times. Here, in this study, we explore the potential for modular quantum computing architectures to mitigate such correlated energy decay events. We measure cosmic-ray-like events in a quantum processor comprising a motherboard and two flip-chip bonded daughterboard modules, each module containing two superconducting qubits. We monitor the appearance of correlated qubit decay events within a single module and across the physically separated modules. We find that while decay events within one module are strongly correlated (over 85%), events in separate modules only display approximately 2% correlations. We also report coincident decay events in the motherboard and in either of the two daughterboard modules, providing further insight into the nature of these decay events. These results suggest that modular architectures, combined with bespoke errorcorrection codes, offer a promising approach for protecting future quantum processors from chip-scale correlated errors.

Wu, Xuntao [Univ. of Chicago, IL (United States)] ↗

An Integrated Signaling-Encryption Mechanism to Reduce Error Propagation in Wireless Communications: Performance Analyses

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

advanced encryption standard (AES)↗

Fast Correction of Errors in the DFT‐Calculated Energies of Gaseous Nitrogen‐Containing Species

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.

Urrego‐Ortiz, Ricardo↗

Analysis and correction of errors in nanoscale particle tracking using the Single-pixel interior filling function (SPIFF) algorithm

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.

Science & Technology - Other Topics↗

Approximate simulation of quantum channels

Earlier, we proved a duality between two optimizations problems [Phys. Rev. Lett. 104, 120501 (2010)]. The primary one is, given two quantum channels M and N, to find a quantum channel R such that R White-Bullet N is optimally close to M as measured by the worst-case entanglement fidelity. The dual problem involves the information obtained by the environment through the so-called complementary channels M and N, and consists in finding a quantum channel R' such that R Prime White-Bullet cM is optimally close to N. It turns out to be easier to find an approximate solution to the dual problem in certain important situations, notably when M is the identity channel - the problem of quantum error correction - yielding a good near-optimal worst-case entanglement fidelity as well as the corresponding near-optimal correcting channel. Here we provide more detailed proofs of these results. In addition, we generalize the main theorem to the case where there are certain constraints on the implementation of R, namely, on the number of Kraus operators. We also offer a simple algebraic form for the near-optimal correction channel in the case M=id. For approximate error correction, we show that any {epsilon}-correctable channel is, up to appending an ancilla, {epsilon}-close to an exactly correctable one. We also demonstrate an application of our theorem to the problem of minimax state discrimination.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance analysis of a cascaded coding scheme with interleaved outer code

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.

Lin, S.↗

Digital-analog quantum computation

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.

97 MATHEMATICS AND COMPUTING↗

Dynamic Aperture of JLEIC Electron Collider Ring with Errors and Correction

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.

Lin, F.↗

Simplified algorithm for correcting both errors and erasures of Reed-Solomon codes

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.

Reed, I. S.↗

Topological subsystem codes

We introduce a family of two-dimensional (2D) topological subsystem quantum error-correcting codes. The gauge group is generated by two-local Pauli operators, so that two-local measurements are enough to recover the error syndrome. We study the computational power of code deformation in these codes and show that boundaries cannot be introduced in the usual way. In addition, we give a general mapping connecting suitable classical statistical mechanical models to optimal error correction in subsystem stabilizer codes that suffer from depolarizing noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗