Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error codes”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

High-order neural models for error correcting code

The decoding and error-correction of data transmitted over a noisy channel is in principle equivalent to the operation of a neural network performing as a content-addressable memory. For a successful application, however, the neural network has to be capable of storing arbitrary words, and it has to be guaranteed that the stored words represent the only stable attractors of the memory. This paper presents a novel high-order neural network architecture that has these characteristics. The analog nature of the network can be used to perform soft-decision decoding with any block code. The performance in terms of postdecoding bit error rate versus SNR is demonstrated for two exemplary block codes. The comparison with a conventional decoding algorithm for a (15,5) cyclic redundancy code shows, for example, that the bit error rate at 7dB SNR can be decreased by two orders of magnitude.

Jeffries, Clark↗
NASA NTRS1984

Reed Solomon codes for error control in byte organized computer memory systems

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K-bit DRAM's are organized in 32Kx8 bit-bytes. Byte oriented codes such as Reed Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. Some special decoding techniques for extended single-and-double-error-correcting RS codes which are capable of high speed operation are presented. These techniques are designed to find the error locations and the error values directly from the syndrome without having to use the iterative algorithm to find the error locator polynomial.

Lin, S.↗
DOE OSTI2025

Recommendations for Minimum Required Diagnostics Information

The rapid growth of electrified transportation, including light- and medium-duty electric vehicles (EVs) as a mobility solution requires a reliable EV-charging infrastructure. To advance charging reliability, the ChargeX Consortium reports “Recommendations for Minimum Required Error Codes for Electric Vehicle Charging Infrastructure” and “Implementation Guide for Minimum Required Error Codes in Electric Vehicle Charging Infrastructure” provided recommendations for a set of minimum required error codes (MRECs), their functional and responsibility classifications, and a guide for their implementation, using Open Charge Point Protocol (OCPP) versions 1.6J4 and 2.0.1.5 These reports outline a recommended practice for consistent error reporting and interpretation, which is essential for communicating issues uniformly across the complex and diverse EV-charging ecosystem. However, MRECs are just one part of diagnosing issues; another critical part is obtaining enough information about the current state and performance of the various charging components to identify root causes for each of the error codes. This additional diagnostics data can be used by technicians or automated systems to understand the context around an issue, allowing for timely resolution, decreased maintenance costs, and increased charging reliability. During everyday operations, data are regularly collected and analyzed across the ecosystem. Although sharing of all that available data would be great for diagnostics, concerns on data ownership, privacy, and original equipment manufacturer (OEM) intellectual property pose a challenge. To overcome this obstacle, this report proposes a set of minimum required diagnostic information (MRDI) and recommends that the industry implement these uniformly across the North American EV charging ecosystem. MRDI provides a means to exchange only data deemed necessary for root cause determination.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS1987

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↗
DOE OSTI2025

Recommendations for Minimum Required Diagnostics Information for Electric Vehicle Charging Infrastructure

The rapid growth of electrified transportation, including light- and medium-duty electric vehicles (EVs) as a mobility solution requires a reliable EV charging infrastructure. To advance charging reliability, the ChargeX Consortium reports “Recommendations for Minimum Required Error Codes for Electric Vehicle Charging Infrastructure” and “Implementation Guide for Minimum Required Error Codes in Electric Vehicle Charging Infrastructure” have provided recommendations for a set of minimum required error codes (MRECs), their functional and responsibility classifications, and a guide for their implementation using OCPP versions 1.6J and 2.0.1. These reports outline a recommended practice for consistent error reporting and interpretation, which is essential for communicating issues uniformly across the complex and diverse EV charging ecosystem. However, MRECs are just one part of diagnosing issues, another critical part is obtaining enough information about the current state and performance of the various charging components to identify root causes for each of the error codes. This additional diagnostics data can be used by technicians or automated systems to understand the context around an issue, allowing for timely resolution, decreased maintenance costs, and increased charging reliability. During everyday operations, data is regularly collected and analyzed across the ecosystem. Although sharing of all that available data would be great for diagnostics, concerns on data ownership, privacy, and OEM intellectual property pose a challenge. To overcome this obstacle, this report proposes a set of Minimum Required Diagnostic Information (MRDI) and recommends that the industry implement these uniformly across the North American EV charging ecosystem. MRDI provides a means to exchange only data deemed necessary for root cause determination.

32 - ENERGY CONSERVATION, CONSUMPTION, AND UTILIZA↗
NASA NTRS1984

On the undetected error probability of a concatenated coding scheme for error control

Consider a concatenated coding scheme for error control on a binary symmetric channel, called the inner channel. The bit error rate (BER) of the channel is correspondingly called the inner BER, and is denoted by Epsilon (sub i). Two linear block codes, C(sub f) and C(sub b), are used. The inner code C(sub f), called the frame code, is an (n,k) systematic binary block code with minimum distance, d(sub f). The frame code is designed to correct + or fewer errors and simultaneously detect gamma (gamma +) or fewer errors, where + + gamma + 1 = to or d(sub f). The outer code C(sub b) is either an (n(sub b), K(sub b)) binary block with a n(sub b) = mk, or an (n(sub b), k(Sub b) maximum distance separable (MDS) code with symbols from GF(q), where q = 2(b) and the code length n(sub b) satisfies n(sub)(b) = mk. The integerim is the number of frames. The outercode is designed for error detection only.

Deng, H.↗
NASA NTRS1996

Introduction to Forward-Error-Correcting Coding

This reference publication introduces forward error correcting (FEC) and stresses definitions and basic calculations for use by engineers. The seven chapters include 41 example problems, worked in detail to illustrate points. A glossary of terms is included, as well as an appendix on the Q function. Block and convolutional codes are covered.

Freeman, Jon C.↗
DOE OSTI2026

Resilience of the surface code to error bursts

Quantum error correction works effectively only if the error rate of gate operations is sufficiently low. However, some rare physical mechanisms can cause a temporary increase in the error rate that affects many qubits; examples include ionizing radiation in superconducting hardware and large deviations in the global control of atomic systems. We refer to such rare transient spikes in the gate error rate as error bursts. In this work, we investigate the resilience of the rotated surface code to generic error bursts. We assume that, after appropriate mitigation strategies, the spike in the error rate lasts for only a single syndrome-extraction cycle; we also assume that the enhanced error rate is uniform across the code block. Under these assumptions, and for a circuit-level depolarizing noise model, we perform Monte Carlo simulations to determine the regime in burst error rate and background error rate for which the memory time becomes arbitrarily long as the code block size grows. Our results indicate that suitable hardware mitigation methods combined with standard decoding methods may suffice to protect against transient error bursts in the rotated surface code.

Quantum error correction↗
NASA NTRS1996

Testing and Performance Analysis of the Multichannel Error Correction Code Decoder

This report provides the test results and performance analysis of the multichannel error correction code decoder (MED) system for a regenerative satellite with asynchronous, frequency-division multiple access (FDMA) uplink channels. It discusses the system performance relative to various critical parameters: the coding length, data pattern, unique word value, unique word threshold, and adjacent-channel interference. Testing was performed under laboratory conditions and used a computer control interface with specifically developed control software to vary these parameters. Needed technologies - the high-speed Bose Chaudhuri-Hocquenghem (BCH) codec from Harris Corporation and the TRW multichannel demultiplexer/demodulator (MCDD) - were fully integrated into the mesh very small aperture terminal (VSAT) onboard processing architecture and were demonstrated.

Soni, Nitin J.↗
NASA NTRS1989

Bandwidth efficient coding for error control

One of the dramatic developments in bandwidth-efficient communications over the past few years is the introduction and rapid applications of combined coding and bandwidth efficient modulation, known as coded modulation, for error control. Using coded modulation, reliable data transmission can be attained without compromising bandwidth efficiency. Presented here are the basic concepts of coded modulation. Two simple examples are used to demonstrate how significant coding gains can be achieved without bandwidth expansion.

Lin, Shu↗
NASA NTRS1990

Tutorial on Reed-Solomon error correction coding

This tutorial attempts to provide a frank, step-by-step approach to Reed-Solomon (RS) error correction coding. RS encoding and RS decoding both with and without erasing code symbols are emphasized. There is no need to present rigorous proofs and extreme mathematical detail. Rather, the simple concepts of groups and fields, specifically Galois fields, are presented with a minimum of complexity. Before RS codes are presented, other block codes are presented as a technical introduction into coding. A primitive (15, 9) RS coding example is then completely developed from start to finish, demonstrating the encoding and decoding calculations and a derivation of the famous error-locator polynomial. The objective is to present practical information about Reed-Solomon coding in a manner such that it can be easily understood.

Geisel, William A.↗
NASA NTRS1996

Communications and information research: Improved space link performance via concatenated forward error correction coding

With the development of new advanced instruments for remote sensing applications, sensor data will be generated at a rate that not only requires increased onboard processing and storage capability, but imposes demands on the space to ground communication link and ground data management-communication system. Data compression and error control codes provide viable means to alleviate these demands. Two types of data compression have been studied by many researchers in the area of information theory: a lossless technique that guarantees full reconstruction of the data, and a lossy technique which generally gives higher data compaction ratio but incurs some distortion in the reconstructed data. To satisfy the many science disciplines which NASA supports, lossless data compression becomes a primary focus for the technology development. While transmitting the data obtained by any lossless data compression, it is very important to use some error-control code. For a long time, convolutional codes have been widely used in satellite telecommunications. To more efficiently transform the data obtained by the Rice algorithm, it is required to meet the a posteriori probability (APP) for each decoded bit. A relevant algorithm for this purpose has been proposed which minimizes the bit error probability in the decoding linear block and convolutional codes and meets the APP for each decoded bit. However, recent results on iterative decoding of 'Turbo codes', turn conventional wisdom on its head and suggest fundamentally new techniques. During the past several months of this research, the following approaches have been developed: (1) a new lossless data compression algorithm, which is much better than the extended Rice algorithm for various types of sensor data, (2) a new approach to determine the generalized Hamming weights of the algebraic-geometric codes defined by a large class of curves in high-dimensional spaces, (3) some efficient improved geometric Goppa codes for disk memory systems and high-speed mass memory systems, and (4) a tree based approach for data compression using dynamic programming.

Rao, T. R. N.↗