Search NASA⌕ Search

SEARCH · Search NASA

Results for “Minimum Required 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Recommendations for Minimum Required Error Codes for Electric Vehicle Charging Infrastructure

OCPP protocol manages the interaction between the EVSE and its respective back-end communication network. It plays a pivotal role in both error reporting and troubleshooting, carried out primarily through the CSMS. OCPP defines both standard error codes and a flexible framework for creating and communicating custom error codes. The OCPI protocol orchestrates the communication between different backhaul communication networks, incorporating the exchange of error codes. These error codes are instrumental in pinpointing and rectifying issues that can surface prior to, during, or after charging operations, fortifying the reliability and resilience of the EV charging infrastructure. The flexibility offered by the OCPP and OCPI frameworks through the introduction of custom error codes also creates its own set of challenges. While the integration of custom error codes allows for enhanced granularity, it also introduces inconsistencies and fragmentation within the overarching diagnostic reporting system. To address the challenges with custom error codes this report proposes a set of Minimum Required Error Codes (MRECs) for streamlined error reporting, interpretability, and diagnostics. Recommendations in this report are based on independent analysis of custom error codes from multiple stakeholders within the EV charging ecosystem. For better error resolution, this report also assigns one or more entities responsible for the resolution of every mentioned error code. Finally, a functional classification for each mentioned error code is also identified to describe the nature of the error. In summary, the purpose of this document is to simplify the troubleshooting process and increase charging reliability for all EV users. This report serves as a recommendation for industry stakeholders, encouraging a unified methodology to define, transmit, and interpret common error codes.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Implementation Guide for Minimum Required Error Codes in Electric Vehicle Charging Infrastructure

With the growing adoption of Electric Vehicles (EVs), there is an increasing need for a reliable EV charging infrastructure. To help meet this need, the report “Recommendations for Minimum Required Error Codes for Electric Vehicle Charging Infrastructure,” recommends a set of minimum required error codes (MRECs) and their functional and responsibility classification. Charger manufacturers, charging station operators, EV manufacturers, and other stakeholders in the North American market are encouraged to uniformly adopt the MRECs to enhance EV charging error reporting, interpretation, and diagnostics. This document serves as a guide to enable uniform implementation of the MRECs using the Open Charge Point Protocol (OCPP).

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
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↗
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 NTRS1972

Variable-length codes and the Fano metric.

It is shown that the metric proposed originally by Fano for sequential decoding is precisely the required statistic for minimum-error-probability decoding of variable-length codes. The analysis shows further that the 'natural' choice of bias in the metric is the code rate and gives insight into why the Fano metric has proved to be the best practical choice in sequential decoding. The recently devised Jelinek-Zigangirov 'stack algorithm' is shown to be a natural consequence of this interpretation of the Fano metric. Finally, it is shown that the elimination of the bias in the 'truncated' portion of the code tree gives a slight reduction in average computation at the sacrifice of increased error probability.

Massey, J. L.↗
NASA NTRS1985

Further Results on Rate 1/N Convolutional Code Constructions with Minimum Required SNR Criterion

New good (K, 1/N) convolutional codes for 8 or = to K or = to 13 and 2 or = to N or = to 8 were found and tabulated which require minimum signal-to-noise ratio (SNR) for given desired bit error rates (BER) with Viterbi decoding. The transfer function bound was used for the BER evaluations. These low-rate codes are expected to have a number of applications, especially for systems having large bandwidth-bit time products such as deep space and spread spectrum communication systems.

Lee, P. J.↗
NASA NTRS1985

Further results on rate 1/N convolutional code constructions with minimum required SNR criterion

New good (K, 1/N) convolutional codes for 8 or = to K or = to 13 and 2 or = to N or = to 8 were found and tabulated which require minimum signal-to-noise ratio (SNR) for given desired bit error rates (BER) with Viterbi decoding. The transfer function bound was used for the BER evaluations. These low-rate codes are expected to have a number of applications, especially for systems having large bandwidth-bit time products such as deep space and spread spectrum communication systems.

Lee, P. J.↗
NASA NTRS1988

dc-free coset codes

A class of block coset codes with disparity and run-length constraints are studied. They are particularly well suited for high-speed optical fiber links and similar channels, where dc-free pulse formats, channel error control, and low-complexity encoder-decoder implementations are required. The codes are derived by partitioning linear block codes. The encoder and decoder structures are the same as those of linear block codes with only slight modifications. A special class of dc-free coset block codes are derived from BCH codes with specified bounds on minimum distance, disparity, and run length. The codes have low disparity levels (a small running digital sum) and good error-correcting capabilities.

Deng, Robert H.↗
NASA NTRS1985

Combined trellis coding with asymmetric MPSK modulation: An MSAT-X report

Traditionally symmetric, multiple phase-shift-keyed (MPSK) signal constellations, i.e., those with uniformly spaced signal points around the circle, have been used for both uncoded and coded systems. Although symmetric MPSK signal constellations are optimum for systems with no coding, the same is not necessarily true for coded systems. This appears to show that by designing the signal constellations to be asymmetric, one can, in many instances, obtain a significant performance improvement over the traditional symmetric MPSK constellations combined with trellis coding. The joint design of n/(n + 1) trellis codes and asymmetric 2 sup n + 1 - point MPSK is considered, which has a unity bandwidth expansion relative to uncoded 2 sup n-point symmetric MPSK. The asymptotic performance gains due to coding and asymmetry are evaluated in terms of the minimum free Euclidean distance free of the trellis. A comparison of the maximum value of this performance measure with the minimum distance d sub min of the uncoded system is an indication of the maximum reduction in required E sub b/N sub O that can be achieved for arbitrarily small system bit-error rates. It is to be emphasized that the introduction of asymmetry into the signal set does not effect the bandwidth of power requirements of the system; hence, the above-mentioned improvements in performance come at little or no cost. MPSK signal sets in coded systems appear in the work of Divsalar.

Simon, M. K.↗
NASA NTRS1992

Investigation of Bandwidth-Efficient Coding and Modulation Techniques

The necessary technology was studied to improve the bandwidth efficiency of the space-to-ground communications network using the current capabilities of that network as a baseline. The study was aimed at making space payloads, for example the Hubble Space Telescope, more capable without the need to completely redesign the link. Particular emphasis was placed on the following concepts: (1) what the requirements are which are necessary to convert an existing standard 4-ary phase shift keying communications link to one that can support, as a minimum, 8-ary phase shift keying with error corrections applied; and (2) to determine the feasibility of using the existing equipment configurations with additional signal processing equipment to realize the higher order modulation and coding schemes.

Osborne, William P.↗
NASA NTRS2003

Upper bounds to error probabilities of coded systems beyond the cutoff rate

A family of upper bounds to error probabilities of coded systems was recently proposed by Divsalar. These bounds are valid for transmission over the additive white Gaussian noise channel, and require only the knowledge of the weight spectrum of the code words. After illustrating these bounds, we extend them to fading channels. Contrary to the union bound, our bounds maintain their effectiveness below the signal-to-noise ratio (SNR)at which the cutoff rate of the channel equals the rate of the code. Some applications are shown. First, we derive upper bounds to the minimum SNR necessary to achieve zero error probability as the code block length increases to infinity. Next, we use our bounds to predict the performance of turbo codes and low-density parity-check codes.

Biglieri, Ezio↗
NASA NTRS2004

Coding for Communication Channels with Dead-Time Constraints

Coding schemes have been designed and investigated specifically for optical and electronic data-communication channels in which information is conveyed via pulse-position modulation (PPM) subject to dead-time constraints. These schemes involve the use of error-correcting codes concatenated with codes denoted constrained codes. These codes are decoded using an interactive method. In pulse-position modulation, time is partitioned into frames of Mslots of equal duration. Each frame contains one pulsed slot (all others are non-pulsed). For a given channel, the dead-time constraints are defined as a maximum and a minimum on the allowable time between pulses. For example, if a Q-switched laser is used to transmit the pulses, then the minimum allowable dead time is the time needed to recharge the laser for the next pulse. In the case of bits recorded on a magnetic medium, the minimum allowable time between pulses depends on the recording/playback speed and the minimum distance between pulses needed to prevent interference between adjacent bits during readout. The maximum allowable dead time for a given channel is the maximum time for which it is possible to satisfy the requirement to synchronize slots. In mathematical shorthand, the dead-time constraints for a given channel are represented by the pair of integers (d,k), where d is the minimum allowable number of zeroes between ones and k is the maximum allowable number of zeroes between ones. A system of the type to which the present schemes apply is represented by a binary- input, real-valued-output channel model illustrated in the figure. At the transmitting end, information bits are first encoded by use of an error-correcting code, then further encoded by use of a constrained code. Several constrained codes for channels subject to constraints of (d,infinity) have been investigated theoretically and computationally. The baseline codes chosen for purposes of comparison were simple PPM codes characterized by M-slot PPM frames separated by d-slot dead times.

Moision, Bruce↗
NASA NTRS1996

Bit Error Probability for Maximum Likelihood Decoding of Linear Block Codes

In this paper, the bit error probability P(sub b) for maximum likelihood decoding of binary linear codes is investigated. The contribution of each information bit to P(sub b) is considered. For randomly generated codes, it is shown that the conventional approximation at high SNR P(sub b) is approximately equal to (d(sub H)/N)P(sub s), where P(sub s) represents the block error probability, holds for systematic encoding only. Also systematic encoding provides the minimum P(sub b) when the inverse mapping corresponding to the generator matrix of the code is used to retrieve the information sequence. The bit error performances corresponding to other generator matrix forms are also evaluated. Although derived for codes with a generator matrix randomly generated, these results are shown to provide good approximations for codes used in practice. Finally, for decoding methods which require a generator matrix with a particular structure such as trellis decoding or algebraic-based soft decision decoding, equivalent schemes that reduce the bit error probability are discussed.

Lin, Shu↗
NASA NTRS2012

GMSK Modulation for Deep Space Applications

Due to scarcity of spectrum at 8.42 GHz deep space Xband allocation, many deep space missions are now considering the use of higher order modulation schemes instead of the traditional binary phase shift keying (BPSK). One such scheme is pre-coded Gaussian minimum shift keying (GMSK). GMSK is an excellent candidate for deep space missions. GMSK is a constant envelope, bandwidth efficien modulation whose frame error rate (FER) performance with perfect carrier tracking and proper receiver structure is nearly identical to that of BPSK. There are several issues that need to be addressed with GMSK however. Specificall, we are interested in the combined effects of spectrum limitations and receiver structure on the coded performance of the X-band link using GMSK. The receivers that are typically used for GMSK demodulations are variations on offset quadrature phase shift keying (OQPSK) receivers. In this paper we consider three receivers: the standard DSN OQPSK receiver, DSN OQPSK receiver with filte ed input, and an optimum OQPSK receiver with filte ed input. For the DSN OQPSK receiver we show experimental results with (8920, 1/2), (8920, 1/3) and (8920, 1/6) turbo codes in terms of their error rate performance. We also consider the tracking performance of this receiver as a function of data rate, channel code and the carrier loop signal-to-noise ratio (SNR). For the other two receivers we derive theoretical results that will show that for a given loop bandwidth, a receiver structure, and a channel code, there is a lower data rate limit on the GMSK below which a higher SNR than what is required to achieve the required FER on the link is needed. These limits stem from the minimum loop signal-to-noise ratio requirements on the receivers for achieving lock. As a result of this, for a given channel code and a given FER, there could be a gap between the maximum data rate that BPSK can support without violating the spectrum limits and the minimum data rate that GMSK can support with the required FER depending on the type of GMSK receiver that is used.

Communications↗
NASA NTRS1975

Interpolation in numerical optimization

The present work discusses the generation of the cubic-spline interpolator in numerical optimization methods which use a variable-step integrator with step size control based on local relative truncation error. An algorithm for generating the cubic spline with successive over-relaxation is presented which represents an improvement over that given by Ralston and Wilf (1967). Rewriting the code reduces the number of N-vectors from eight to one. The algorithm is formulated in such a way that the solution of the linear system set up yields the first derivatives at the nodal points. This method is as accurate as other schemes but requires the minimum amount of storage.

Hall, K. R.↗
NASA NTRS1997

Root-Raised Cosine Filter Implementation That Uses Canonical Signed Digits for High-Speed Digital Filter Applications

NASA Lewis Research Center's Space Communications Division has been investigating high-speed digital filters that can operate at a higher speed than those in current use for a digital modulator and demodulator (modem). Using the Canonical Signed Digits (CSD) number representation for filter coefficients is a very effective way to increase the filter's speed while reducing complexity in the digital filter hardware design. This approach is a good alternative to using an expensive parallel-processing design technique or custom, application-specific integrated circuits. Such integrated circuits may not be suitable for applications that require filter speeds faster than what application-specific integrated circuits digital signal processors can offer for a dedicated channel. When a communication channel is a dedicated, multiplication process--a costly, time-consuming process--it can be greatly simplified by a replacement of the filter coefficients with CSD numbers. A computer code written with the MATLAB software package runs the program and generates CSD-represented filter coefficients that are based on minimizing minimum mean square errors. Also, the Alta Group of Cadence's Signal Processing Workstation is used to simulate and analyze the CSD filter responses. The impulse response of the root-raised cosine filter that is used as a base model is defined. From this filter, a set of coefficients is sampled and stored in a file. For the all coefficients, the optimal CSD number for each coefficient is searched on the basis of the minimum-mean-square-errors criterion. Because the distribution of CSD numbers is not uniform, quantization errors tend to be bigger for coefficients greater than 1/2. To offset errors that occur in a region of coefficients between 1/2 to 1 and to better represent fractions with CSD numbers, an extra nonzero digit is allowed for any coefficients exceeding 1/2. This will greatly improve frequency response as well as intersymbol interference at the receiver. The frequency response of a set of collected CSD-represented filter coefficients was compared with the same filter that was conventionally implemented. Analyses show CSD-implemented filters perform as well as conventional filters. Comparison of eye diagrams and bit-error-rate curves between CSD filters and traditionally implemented filters are almost indistinguishable. However, filter complexity was reduced from almost 3.5 to 1 for CSD filters. Complete computer simulation results are available. In the near future, work will focus on building actual working digital filter hardware in a field programmable gate array (FPGA).

Kim, Heechul↗
NASA NTRS1991

MacPASCO - A Macintosh-based, interactive graphic preprocessor for structural analysis and sizing

MacPASCO, an interactive, graphic preprocessor for panel design is described. MacPASCO creates input for PASCO, an existing computer code for structural analysis and optimization of longitudinal stiffened composite panels. By using a graphical user interface, MacPASCO simplifies the specification of panel geometry and reduces user input errors, thus making the modeling and analysis of panel designs more efficient. The user draws the initial structural geometry on the computer screen, then uses a combination of graphic and text inputs to: refine the structural geometry, specify information required for analysis such as panel load conditions, and define design variables and constraints for minimum-mass optimization. Composite panel design is an ideal application because the graphical user interface can: serve as a visual aid, eliminate the tedious aspects of text-based input, and eliminate many sources of input errors.

Lucas, S. H.↗