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

Error control in the GCF: An information-theoretic model for error analysis and coding

The structure of data-transmission errors within the Ground Communications Facility is analyzed in order to provide error control (both forward error correction and feedback retransmission) for improved communication. Emphasis is placed on constructing a theoretical model of errors and obtaining from it all the relevant statistics for error control. No specific coding strategy is analyzed, but references to the significance of certain error pattern distributions, as predicted by the model, to error correction are made.

Adeyemi, O.↗

Accuracy enhancements for overset grids using a defect correction approach

A defect-correction approach is investigated as a means of enhancing the accuracy of flow computations on overset grids. Typically, overset-grid techniques process and pass information only at grid boundaries. In the current approach, error corrections at all overlapped interior points are injected between grids by using a defect-correction scheme. In some cases this is found to enhance the overall accuracy of the overset-grid method. Locally refined overset grids can be used to provide an efficient solution-adaptation method. The defect correction can also be ultilized as an error-correction technique for a coarse grid by evaluating the residual using a fine base grid, but solving the implicit equations only on the coarse grid. Numerical examples include an accuracy and dissipation study of an unsteady decaying vortex flow, the flow over a NACA 0012 airfoil, and the flow over a mulit-element high-lift airfoil.

Rogers, Stuart E.↗

Entanglement phases in large- N hybrid Brownian circuits with long-range couplings

Here, we develop solvable models of large-N hybrid quantum circuits on qubits and fermions with tunable long-range power-law interactions and continuous local monitoring. These models provide analytical access to the entanglement phase diagram and error-correcting properties of many-body entangled nonequilibrium states generated by such dynamics. In one dimension, the long-range couplings are irrelevant for α > 3/2, where α is the power-law exponent, and the models exhibit a conventional measurement-induced phase transition between volume- and area-law entangled phases. For 1/2 < α < 3/2, the long-range couplings become relevant, leading to a nontrivial dynamical exponent at the measurement-induced phase transition. More interestingly, for α < 1, the entanglement pattern receives a subvolume correction for both area-law and volume-law phases, indicating that the phase realizes a quantum error correcting code whose code distance scales as L 2–2α . While the entanglement phase diagram is the same for both the interacting qubit and fermionic hybrid Brownian circuits, we find that long-range free-fermionic circuits exhibit a distinct phase diagram with two different fractal entangled phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Space Telescope SI C&DH system

The Hubble Space Telescope Scientific Instrument Control and Data Handling Subsystem (SI C&DH) is designed to interface with five scientific instruments of the Space Telescope to provide ground and autonomous control and collect health and status information using the Standard Telemetry and Command Components (STACC) multiplex data bus. It also formats high throughput science data into packets. The packetized data is interleaved and Reed-Solomon encoded for error correction and Pseudo Random encoded. An inner convolutional coding with the outer Reed-Solomon coding provides excellent error correction capability. The subsystem is designed with the capacity for orbital replacement in order to meet a mission life of fifteen years. The spacecraft computer and the SI C&DH computer coordinate the activities of the spacecraft and the scientific instruments to achieve the mission objectives.

Gadwal, Govind R.↗

HetArch: Heterogeneous Microarchitectures for Superconducting Quantum Systems

Noisy Intermediate-Scale Quantum Computing (NISQ) has dominated headlines in recent years, with the longer-term vision of Fault-Tolerant Quantum Computation (FTQC) offering significant potential but at currently intractable resource costs and quantum error correction (QEC) overheads. For problems of interest, FTQC will require millions of physical qubits with long coherence times, high-fidelity gates, and compact sizes to surpass classical systems. Just as heterogeneous specialization has offered scaling benefits in classical computing, it is likewise gaining interest in FTQC. However, systematic use of heterogeneity in either hardware or software elements of FTQC systems remains a serious challenge due to the vast design space and the variable physical constraints. This paper meets the challenge of making heterogeneous FTQC design practical by introducing HetArch, a toolbox for designing heterogeneous quantum systems, and using it to explore heterogeneous design scenarios. Using a hierarchical approach, we successively break quantum algorithms into smaller operations (akin to classical application kernels), thus greatly simplifying the design space and resulting tradeoffs. Specializing to superconducting systems, we then design optimized heterogeneous hardware composed of varied superconducting devices, abstracting physical constraints into design rules that enable devices to be assembled into standard cells optimized for specific operations, which, in turn, form heterogeneous modules optimized for quantum subroutines. Finally, we provide a heterogeneous design space exploration framework which reduces the simulation burden by a factor of 10^4 or more and allows us to characterize optimal design points. We use these techniques to design superconducting quantum modules for entanglement distillation, error correction, and code teleportation, reducing error rates by 2.6×, 10.7×, and 3.4× compared to homogeneous systems.

Quantum Computing, Quantum Physics, Computer Archi↗

Self-dual (48,24;12) codes

Two self-dual (48,24;12) codes are constructed as 6 x 8 matrices whose columns add up to form an extended BCH-Hamming (8,4;4) code and whose rows sum to odd or even parity. The codes constructed have the identical weight structure of the extended quadratic residue code of length 48. Algebraic isomorphisms may exist between pairs of these three codes. However, because of their matrix form, the newly constructed codes are easily correctable for all five-error and many six-error patterns. The first code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix and then adjoining six dimensions to the extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. The second code comes from a slight modification in the parity (eighth) dimension of the Reed-Solomon (8,4;5) code over GF(64). Error correction in both codes uses the row sum parity information to detect errors in the correction algorithm.

Solomon, G.↗

Does software design complexity affect maintenance effort?

The design complexity of a software system may be characterized within a refinement level (e.g., data flow among modules), or between refinement levels (e.g., traceability between the specification and the design). We analyzed an existing set of data from NASA's Software Engineering Laboratory to test whether changing software modules with high design complexity requires more personnel effort than changing modules with low design complexity. By analyzing variables singly, we identified strong correlations between software design complexity and change effort for error corrections performed during the maintenance phase. By analyzing variables in combination, we found patterns which identify modules in which error corrections were costly to perform during the acceptance test phase.

Epping, Andreas↗

Beyond toy models: distilling tensor networks in full AdS/CFT

We present a general procedure for constructing tensor networks that accurately reproduce holographic states in conformal field theories (CFTs). Given a state in a large-N CFT with a static, semiclassical gravitational dual, we build a tensor network by an iterative series of approximations that eliminate redundant degrees of freedom and minimize the bond dimensions of the resulting network. We argue that the bond dimensions of the tensor network will match the areas of the corresponding bulk surfaces. For “tree” tensor networks (i.e., those that are constructed by discretizing spacetime with nonintersecting Ryu-Takayanagi surfaces), our arguments can be made rigorous using a version of one-shot entanglement distillation in the CFT. Using the known quantum error correcting properties of AdS/CFT, we show that bulk legs can be added to the tensor networks to create holographic quantum error correcting codes. These codes behave similarly to previous holographic tensor network toy models, but describe actual bulk excitations in continuum AdS/CFT. By assuming some natural generalizations of the “holographic entanglement of purification” conjecture, we are able to construct tensor networks for more general bulk discretizations, leading to finer-grained networks that partition the information content of a Ryu-Takayanagi surface into tensor-factorized subregions. While the granularity of such a tensor network must be set larger than the string/Planck scales, we expect that it can be chosen to lie well below the AdS scale. However, we also prove a no-go theorem which shows that the bulk-to-boundary maps cannot all be isometries in a tensor network with intersecting Ryu-Takayanagi surfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Anomaly detection for MPC forecast in Fleet of Water Heaters

Among residential devices, water heaters consume 20% of home energy use in the United States. Water heaters possess the capability to store energy within their reservoirs, enabling the ability to decouple energy use from hot water use. This capability can be used to reduce energy usage and costs while also supporting grid services. This requires accurate forecasting of the parameters of the water heater such as upper and lower temperatures. In this study, we analyzed the performance and behavior of a water heater model used in the real-world to predict a control mechanism that is implemented in a smart residential neighborhood. The model forecasts are accurate in most cases but not all. In such scenarios, error correction of the model is necessary to further improve model predictive control accuracy. Anomaly detection is the first step of error correction. This study complements existing research by grouping time series data into two clusters one with anomalies and another without anomalies. To achieve this task, we explored and compared multiple unsupervised machine learning algorithms to perform clustering. Among these algorithms, Ward clustering has the lowest running time and identified the highest number of anomalies for the upper temperature limit. The proposed approach is tested based on the data collected in a neighborhood with 46 townhomes located in Atlanta, GA.

Lebakula, Viswadeep↗

A technique for correcting transmission errors in delta modulation channels

The delta modulator is a relatively new device which has found wide application in voice encoding. Two main difficulties in using this device for video encoding and processing is that it slope overloads and 'rings' and that channel errors produce a DC level shift. An algorithm is developed which is easily implemented and which significantly reduces 'picture streaks' due to the production of DC level shifts by channel errors. The algorithm can be made adaptive whereby the insertion rate of the pulse code modulation (PCM) codeword needed for correction can be adjusted depending on the strength of the channel noise. This yields a more efficient use of bandwidth. Further, the resulting signal can still be processed further using line-to-line correlation to remove the remaining 'streaks'.

Ali, M. Z.↗

An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications

In this paper, we explore using the Harrow–Hassidim–Lloyd (HHL) algorithm to address scientific and engineering problems through quantum computing, utilizing the NWQSim simulation package on a high-performance computing platform. Focusing on domains such as power-grid management and climate projection, we demonstrate the correlations of the accuracy of quantum phase estimation, along with various properties of coefficient matrices, on the final solution and quantum resource cost in iterative and non-iterative numerical methods such as the Newton–Raphson method and finite difference method, as well as their impacts on quantum error correction costs using the Microsoft Azure Quantum resource estimator. We summarize the exponential resource cost from quantum phase estimation before and after quantum error correction and illustrate a potential way to reduce the demands on physical qubits. This work lays down a preliminary step for future investigations, urging a closer examination of quantum algorithms’ scalability and efficiency in domain applications.

hybrid software for QC-HPC↗

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↗

A decoding procedure for the Reed-Solomon codes

A decoding procedure is described for the (n,k) t-error-correcting Reed-Solomon (RS) code, and an implementation of the (31,15) RS code for the I4-TENEX central system. This code can be used for error correction in large archival memory systems. The principal features of the decoder are a Galois field arithmetic unit implemented by microprogramming a microprocessor, and syndrome calculation by using the g(x) encoding shift register. Complete decoding of the (31,15) code is expected to take less than 500 microsecs. The syndrome calculation is performed by hardware using the encoding shift register and a modified Chien search. The error location polynomial is computed by using Lin's table, which is an interpretation of Berlekamp's iterative algorithm. The error location numbers are calculated by using the Chien search. Finally, the error values are computed by using Forney's method.

Lim, R. S.↗

Performance of concatenated Reed-Solomon trellis-coded modulation over Rician fading channels

A concatenated coding scheme for providing very reliable data over mobile-satellite channels at power levels similar to those used for vocoded speech is described. The outer code is a shorter Reed-Solomon code which provides error detection as well as error correction capabilities. The inner code is a 1-D 8-state trellis code applied independently to both the inphase and quadrature channels. To achieve the full error correction potential of this inner code, the code symbols are multiplexed with a pilot sequence which is used to provide dynamic channel estimation and coherent detection. The implementation structure of this scheme is discussed and its performance is estimated.

Moher, Michael L.↗

Optimizing Parameters for Deep-Space Optical Communication

A paper discusses the optimization of the parameters of a high-rate, deep-space optical communication link that utilizes pulse-position modulation (PPM) and an error-correcting code (ECC). The parameters in question include the PPM order (number of pulse time slots in one symbol period), the ECC rate, and the uncoded symbol error rate. In simple terms, the optimization problem is to choose the combination of these parameters that maximizes the throughput data rate at a given bit-error-rate (BER), subject to several constraints, including limits on the average and peak power and possibly a limit on the uncoded symbol error rate. This is a complex, multidimensional optimization problem, the solution of which involves computation of channel capacities for various combinations of the parameters. The paper presents extensive theoretical analyses and numerical predictions that elucidate the many facets of the optimization problem. It shows how a nearly optimum solution can be obtained by choosing the optimum PPM order for the desired number of bits per slot and concatenating the PPM mapping with an error-correction code so that the decoded bits satisfy some BER threshold.

Moison, Bruce↗

The Use of Field Programmable Gate Arrays (FPGA) in Small Satellite Communication Systems

This paper will describe the use of digital Field Programmable Gate Arrays (FPGA) to contribute to advancing the state-of-the-art in software defined radio (SDR) transponder design for the emerging SmallSat and CubeSat industry and to provide advances for NASA as described in the TAO5 Communication and Navigation Roadmap (Ref 4). The use of software defined radios (SDR) has been around for a long time. A typical implementation of the SDR is to use a processor and write software to implement all the functions of filtering, carrier recovery, error correction, framing etc. Even with modern high speed and low power digital signal processors, high speed memories, and efficient coding, the compute intensive nature of digital filters, error correcting and other algorithms is too much for modern processors to get efficient use of the available bandwidth to the ground. By using FPGAs, these compute intensive tasks can be done in parallel, pipelined fashion and more efficiently use every clock cycle to significantly increase throughput while maintaining low power. These methods will implement digital radios with significant data rates in the X and Ka bands. Using these state-of-the-art technologies, unprecedented uplink and downlink capabilities can be achieved in a 1/2 U sized telemetry system. Additionally, modern FPGAs have embedded processing systems, such as ARM cores, integrated inside the FPGA allowing mundane tasks such as parameter commanding to occur easily and flexibly. Potential partners include other NASA centers, industry and the DOD. These assets are associated with small satellite demonstration flights, LEO and deep space applications. MSFC currently has an SDR transponder test-bed using Hardware-in-the-Loop techniques to evaluate and improve SDR technologies.

Varnavas, Kosta↗

Coded Modulation in C and MATLAB

This software, written separately in C and MATLAB as stand-alone packages with equivalent functionality, implements encoders and decoders for a set of nine error-correcting codes and modulators and demodulators for five modulation types. The software can be used as a single program to simulate the performance of such coded modulation. The error-correcting codes implemented are the nine accumulate repeat-4 jagged accumulate (AR4JA) low-density parity-check (LDPC) codes, which have been approved for international standardization by the Consultative Committee for Space Data Systems, and which are scheduled to fly on a series of NASA missions in the Constellation Program. The software implements the encoder and decoder functions, and contains compressed versions of generator and parity-check matrices used in these operations.

Hamkins, Jon↗

Reduced circuit implementation of encoder and syndrome generator

An error correction method and system includes an Encoder and Syndrome-generator that operate in parallel to reduce the amount of circuitry used to compute check symbols and syndromes for error correcting codes. The system and method computes the contributions to the syndromes and check symbols 1 bit at a time instead of 1 symbol at a time. As a result, the even syndromes can be computed as powers of the odd syndromes. Further, the system assigns symbol addresses so that there are, for an example GF(2.sup.8) which has 72 symbols, three (3) blocks of addresses which differ by a cube root of unity to allow the data symbols to be combined for reducing size and complexity of odd syndrome circuits. Further, the implementation circuit for generating check symbols is derived from syndrome circuit using the inverse of the part of the syndrome matrix for check locations.

97 MATHEMATICS AND COMPUTING↗