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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 595 records · Page 33

All sources NASA NTRS DOE OSTI

DOE OSTI2012

Robustness Against Interfraction Prostate Movement in Scanned Ion Beam Radiation Therapy

Purpose: To assess the robustness of scanned ion beam treatment plans against the interfraction internal target motion and evaluate the limits of validity of target-based isocenter realignment for prostate cancer radiation therapy. Methods and Materials: For 12 prostate patients, scanned beam carbon ion treatment plans were prepared using 2 lateral opposed beams and the raster scanning technique with different clinical target volume (CTV) to planning target volume (PTV) margins (2-10 mm). Internal target motion of 2-15 mm in anteroposterior (AP), superoinferior (SI), and left-to-right (LR) directions was simulated by displacing the CTV contours with respect to the computed tomography data. The plans were recalculated with and without target-based isocenter realignment and the CTV coverage was assessed. Results: For CTV shifts within the applied planning margin, the CI-98% is greater than 98.0%, both with and without isocenter realignment. Without realignment, because of the sharp lateral gradients, the CI-98% shows rapid fall as soon as the target shift exceeds the applied planning margin for all displacement directions. With isocenter realignment, the coverage improves notably for shifts in AP and SI directions and the CI-98% is restored to >95.0% for plans optimized with a 2-mm margin, >97% with a 3-mm margin, and >98% with larger margins. For large corrections, predominately in AP direction, cold spots in the CTV may occur. Their magnitude is dependent on the patients' individual anatomies. Conclusions: Within the physiological limits of internal prostate movement, target-based isocenter realignment results in improved CTV coverage for shifts in AP and SI directions exceeding the applied planning margin. Assuming optimal patient setup reproducibility (eg, immobilization, setup error correction, patient preparation protocols), hence negligible interfraction bone and soft-tissue variations, changes in traversed densities resulting from target-based realignment applied with a reduced planning margin do not induce significant dose deterioration in most of the cases.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DOE OSTI2023

Self-absorption correction on 2D X-ray fluorescence maps

Abstract X-ray fluorescence mapping (XRF) is a highly efficient and non-invasive technique for quantifying material composition with micro and nanoscale spatial resolutions. Quantitative XRF analysis, however, confronts challenges from the long-lasting problem called self-absorption. Moreover, correcting two-dimensional XRF mapping datasets is particularly difficult because it is an ill-posed inverse problem. Here we report a semi-empirical method that can effectively correct 2D XRF mapping data. The correction error is generally less than 10% from a comprehensive evaluation of the accuracy in various configurations. The proposed method was applied to quantify the composition distribution around the grain boundaries in an electrochemically corroded stainless steel sample. Highly localized Cr enrichment was found around the crack sites, which was invisible before the absorption correction.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Three-Photon Optical Pumping for Trapped Ion Quantum Computing

In this report we describe the testing of a novel scheme for state preparation of trapped ions in a quantum computing setup. This technique optimally would allow for similar precision and speed of state preparation while allowing for individual addressability of single ions in a chain using technology already available in a trapped ion experiment. As quantum computing experiments become more complicated, mid-experiment measurements will become necessary to achieve algorithms such as quantum error correction. Any mid-experiment measurement then requires the measured qubit to be re-prepared to a known quantum state. Currently this involves the protected qubits to be moved a sizeable distance away from the qubit being re-prepared which can be costly in terms of experiment length as well as introducing errors. Theoretical calculations predict that a three-photon process would allow for state preparation without qubit movement with similar efficiencies to current state preparation methods.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

A joint source/channel coder design

The situation where there is residual redundancy at the source coder output is examined. This residual redundancy can be used to provide error correction without a channel encoder. This approach is extended to conventional source coder/convolutional coder combinations. A design for nonbinary encoders for this situation is also developed. Through simulation results it is shown that the proposed systems consistently outperform conventional source-channel coder pairs with gains of greater than 10 dB at high probability of error.

Sayood, Khalid↗

NASA NTRS1987

Low-cost FM oscillator for capacitance type of blade tip clearance measurement system

The frequency-modulated (FM) oscillator described is part of a blade tip clearance measurement system that meets the needs of a wide class of fans, compressors, and turbines. As a result of advancements in the technology of ultra-high-frequency operational amplifiers, the FM oscillator requires only a single low-cost integrated circuit. Its carrier frequency is 42.8 MHz when it is used with an integrated probe and connecting cable assembly consisting of a 0.81 cm diameter engine-mounted capacitance probe and a 61 cm long hermetically sealed coaxial cable. A complete circuit analysis is given, including amplifier negative resistance characteristics. An error analysis of environmentally induced effects is also derived, and an error-correcting technique is proposed. The oscillator can be calibrated in the static mode and has a negative peak frequency deviation of 400 kHz for a rotor blade thickness of 1.2 mm. High-temperature performance tests of the probe and 13 cm of the adjacent cable show good accuracy up to 600 C, the maximum permissible seal temperature. The major source of error is the residual FM oscillator noise, which produces a clearance error of + or - 10 microns at a clearance of 0.5 mm. The oscillator electronics accommodates the high rotor speeds associated with small engines, the signals from which may have frequency components as high as 1 MHz.

Barranger, John P.↗

DOE OSTI2018

Global Estimates of Errors in Quantum Computation by the Feynman–Vernon Formalism

The operation of a quantum computer is considered as a general quantum operation on a mixed state on many qubits followed by a measurement. The general quantum operation is further represented as a Feynman–Vernon double path integral over the histories of the qubits and of an environment, and afterward tracing out the environment. The qubit histories are taken to be paths on the two-sphere S{sup 2} as in Klauder’s coherent-state path integral of spin, and the environment is assumed to consist of harmonic oscillators initially in thermal equilibrium, and linearly coupled to to qubit operators Ŝ{sub z}. The environment can then be integrated out to give a Feynman–Vernon influence action coupling the forward and backward histories of the qubits. This representation allows to derive in a simple way estimates that the total error of operation of a quantum computer without error correction scales linearly with the number of qubits and the time of operation. It also allows to discuss Kitaev’s toric code interacting with an environment in the same manner.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS2000

Full Duplex, Spread Spectrum Radio System

The goal of this project was to support the development of a full duplex, spread spectrum voice communications system. The assembly and testing of a prototype system consisting of a Harris PRISM spread spectrum radio, a TMS320C54x signal processing development board and a Zilog Z80180 microprocessor was underway at the start of this project. The efforts under this project were the development of multiple access schemes, analysis of full duplex voice feedback delays, and the development and analysis of forward error correction (FEC) algorithms. The multiple access analysis involved the selection between code division multiple access (CDMA), frequency division multiple access (FDMA) and time division multiple access (TDMA). Full duplex voice feedback analysis involved the analysis of packet size and delays associated with full loop voice feedback for confirmation of radio system performance. FEC analysis included studies of the performance under the expected burst error scenario with the relatively short packet lengths, and analysis of implementation in the TMS320C54x digital signal processor. When the capabilities and the limitations of the components used were considered, the multiple access scheme chosen was a combination TDMA/FDMA scheme that will provide up to eight users on each of three separate frequencies. Packets to and from each user will consist of 16 samples at a rate of 8,000 samples per second for a total of 2 ms of voice information. The resulting voice feedback delay will therefore be 4 - 6 ms. The most practical FEC algorithm for implementation was a convolutional code with a Viterbi decoder. Interleaving of the bits of each packet will be required to offset the effects of burst errors.

Harvey, Bruce A.↗

DOE OSTI2015

Dosimetric evaluation of three adaptive strategies for prostate cancer treatment including pelvic lymph nodes irradiation

Purpose: The movements of the prostate relative to the pelvic lymph nodes during intensity-modulated radiation therapy treatment can limit margin reduction and affect the protection of the organs at risk (OAR). In this study, the authors performed an analysis of three adaptive treatment strategies that combine information from both bony and gold marker registrations. The robustness of those treatments against the interfraction prostate movements was evaluated. Methods: A retrospective study was conducted on five prostate cancer patients with 7–13 daily cone-beam CTs (CBCTs). The clinical target volumes (CTVs) consisting of pelvic lymph nodes, prostate, and seminal vesicles as well as the OARs were delineated on each CBCT and the initial CT. Three adaptive strategies were analyzed. Two of these methods relied on a two-step patient positioning at each fraction. First step: a bony registration was used to deliver the nodal CTV prescription. Second step: a gold marker registration was then used either to (1) complete the dose delivered to the prostate (complement); (2) or give almost the entire prescription to the prostate with a weak dose gradient between the targets to compensate for possible motions (gradient). The third method (COR) used a pool of precalculated plans based on images acquired at previous treatment fractions. At each new fraction, a plan is selected from that pool based on the daily position of prostate center-of-mass. The dosimetric comparison was conducted and results are presented with and without the systematic shift in the prostate position on the CT planning. The adaptive strategies were compared to the current clinical standard where all fractions are treated with the initial nonadaptive plan. Results: The minimum daily prostate D{sub 95%} is improved by 2%, 9%, and 6% for the complement, the gradient, and the COR approaches, respectively, compared to the nonadaptive method. The average nodal CTV D{sub 95%} remains constant across the strategies, except for the gradient approach where a reduction of 7% is observed. However, a correction of the systematic shift reduced the problem, and the adaptive strategies remain robust against the prostate movement across the fraction. The bladder V{sub 55Gy} is reduced by 35% on average for the adaptive strategies. Conclusions: Because they offer increased CTV coverage and OAR sparing, adaptive methods may be suitable candidates for simple and efficient adaptive treatment strategies for prostate cancer. Margin reduction and systematic error correction in the prostate position improve the protection of the OAR and the dose coverage. A cumulative dose to simulate a complete treatment would show real effects and allow a better comparison between each method.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2025

Impact of dynamics, entanglement and Markovian noise on the fidelity of few-qubit digital quantum simulation

Quantum algorithms have been proposed to accelerate the simulation of the chaotic dynamical systems that are ubiquitous in the physics of plasmas. Quantum computers without error correction might even use noise to their advantage to calculate the Lyapunov exponent by measuring the Loschmidt echo fidelity decay rate. For the first time, digital Hamiltonian simulations of the quantum sawtooth map, performed on the IBM-Q quantum hardware platform, show that the fidelity decay rate of a digital quantum simulation increases during the transition from dynamical localization to chaotic diffusion in the map. The observed error per CNOT gate increases by $1.5{\times }$ as the dynamics varies from localized to diffusive, while only changing the phases of virtual RZ gates and keeping the overall gate count constant. A gate-based Lindblad noise model that captures the effective change in relaxation and dephasing errors during gate operation qualitatively explains the effect of dynamics on fidelity as being due to the localization and entanglement of the states created. Specifically, highly delocalized states that are entangled with random phases show an increased sensitivity to dephasing and, on average, a similar sensitivity to relaxation as localized states. In contrast, delocalized unentangled states show an increased sensitivity to dephasing but a lower sensitivity to relaxation. This gate-based Lindblad model is shown to be a useful benchmarking tool by estimating the effective Lindblad coherence times during CNOT gates and finding a consistent $2\unicode{x2013}3{\times }$ shorter $T_2$ time than reported for idle qubits. Thus, the interplay of the dynamics of a simulation with the noise processes that are active can strongly influence the overall fidelity decay rate.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1986

Error control techniques for satellite and space communications

High rate concatenated coding systems with trellis inner codes and Reed-Solomon (RS) outer codes for application in satellite communication systems are considered. Two types of inner codes are studied: high rate punctured binary convolutional codes which result in overall effective information rates between 1/2 and 1 bit per channel use; and bandwidth efficient signal space trellis codes which can achieve overall effective information rates greater than 1 bit per channel use. Channel capacity calculations with and without side information performed for the concatenated coding system. Concatenated coding schemes are investigated. In Scheme 1, the inner code is decoded with the Viterbi algorithm and the outer RS code performs error-correction only (decoding without side information). In scheme 2, the inner code is decoded with a modified Viterbi algorithm which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, while branch metrics are used to provide the reliability information on the decoded sequence. This information is used to erase unreliable bits in the decoded output. An errors-and-erasures RS decoder is then used for the outer code. These two schemes are proposed for use on NASA satellite channels. Results indicate that high system reliability can be achieved with little or no bandwidth expansion.

Costello, D. J., Jr.↗

NASA NTRS1989

High rate concatenated coding systems using bandwidth efficient trellis inner codes

High-rate concatenated coding systems with bandwidth-efficient trellis inner codes and Reed-Solomon (RS) outer codes are investigated for application in high-speed satellite communication systems. Two concatenated coding schemes are proposed. In one the inner code is decoded with soft-decision Viterbi decoding, and the outer RS code performs error-correction-only decoding (decoding without side information). In the other, the inner code is decoded with a modified Viterbi algorithm, which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, whereas branch metrics are used to provide reliability information on the decoded sequence. This information is used to erase unreliable bits in the decoded output. An errors-and-erasures RS decoder is then used for the outer code. The two schemes have been proposed for high-speed data communication on NASA satellite channels. The rates considered are at least double those used in current NASA systems, and the results indicate that high system reliability can still be achieved.

Deng, Robert H.↗

NASA NTRS1988

Extending the impulse response in order to reduce errors due to impulse noise and signal fading

A finite impulse response (FIR) digital smearing filter was designed to produce maximum intersymbol interference and maximum extension of the impulse response of the signal in a noiseless binary channel. A matched FIR desmearing filter at the receiver then reduced the intersymbol interference to zero. Signal fades were simulated by means of 100 percent signal blockage in the channel. Smearing and desmearing filters of length 256, 512, and 1024 were used for these simulations. Results indicate that impulse response extension by means of bit smearing appears to be a useful technique for correcting errors due to impulse noise or signal fading in a binary channel.

Webb, Joseph A.↗

DOE OSTI2025

Resilient State Recovery Using Prior Measurement Support Information

Resilient state recovery of cyber-physical systems has attracted much research attention due to the unique challenges posed by the tight coupling between communication, computation, and the underlying physics of such systems. By modeling attacks as additive adversary signals to a sparse subset of measurements, this resilient recovery problem can be formulated as an error correction problem. To achieve exact state recovery, most existing results require less than 50% of the measurement nodes to be compromised, which limits the resiliency of the estimators. In this paper, we show that observer resiliency can be further improved by incorporating data-driven prior information. Here, we provide an analytical bridge between the precision of prior information and the resiliency of the estimator. By quantifying the relationship between the estimation error of the weighted ℓ 1 observer and the precision of the support prior, this quantified relationship provides guidance for the estimator’s weight design to achieve optimal resiliency. Several numerical simulations and an application case study are presented to validate the theoretical claims.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Gu, Shouzhen [Yale U.]↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Gu, Shouzhen [Yale U.]↗

NASA NTRS2001

Survey of Header Compression Techniques

This report provides a summary of several different header compression techniques. The different techniques included are: (1) Van Jacobson's header compression (RFC 1144); (2) SCPS (Space Communications Protocol Standards) header compression (SCPS-TP, SCPS-NP); (3) Robust header compression (ROHC); and (4) The header compression techniques in RFC2507 and RFC2508. The methodology for compression and error correction for these schemes are described in the remainder of this document. All of the header compression schemes support compression over simplex links, provided that the end receiver has some means of sending data back to the sender. However, if that return path does not exist, then neither Van Jacobson's nor SCPS can be used, since both rely on TCP (Transmission Control Protocol). In addition, under link conditions of low delay and low error, all of the schemes perform as expected. However, based on the methodology of the schemes, each scheme is likely to behave differently as conditions degrade. Van Jacobson's header compression relies heavily on the TCP retransmission timer and would suffer an increase in loss propagation should the link possess a high delay and/or bit error rate (BER). The SCPS header compression scheme protects against high delay environments by avoiding delta encoding between packets. Thus, loss propagation is avoided. However, SCPS is still affected by an increased BER (bit-error-rate) since the lack of delta encoding results in larger header sizes. Next, the schemes found in RFC2507 and RFC2508 perform well for non-TCP connections in poor conditions. RFC2507 performance with TCP connections is improved by various techniques over Van Jacobson's, but still suffers a performance hit with poor link properties. Also, RFC2507 offers the ability to send TCP data without delta encoding, similar to what SCPS offers. ROHC is similar to the previous two schemes, but adds additional CRCs (cyclic redundancy check) into headers and improves compression schemes which provide better tolerances in conditions with a high BER.

Ishac, Joseph↗

DOE OSTI2017

deBGR: an efficient and near-exact representation of the weighted de Bruijn graph

Abstract Motivation Almost all de novo short-read genome and transcriptome assemblers start by building a representation of the de Bruijn Graph of the reads they are given as input. Even when other approaches are used for subsequent assembly (e.g. when one is using ‘long read’ technologies like those offered by PacBio or Oxford Nanopore), efficient k-mer processing is still crucial for accurate assembly, and state-of-the-art long-read error-correction methods use de Bruijn Graphs. Because of the centrality of de Bruijn Graphs, researchers have proposed numerous methods for representing de Bruijn Graphs compactly. Some of these proposals sacrifice accuracy to save space. Further, none of these methods store abundance information, i.e. the number of times that each k-mer occurs, which is key in transcriptome assemblers. Results We present a method for compactly representing the weighted de Bruijn Graph (i.e. with abundance information) with essentially no errors. Our representation yields zero errors while increasing the space requirements by less than 18–28% compared to the approximate de Bruijn graph representation in Squeakr. Our technique is based on a simple invariant that all weighted de Bruijn Graphs must satisfy, and hence is likely to be of general interest and applicable in most weighted de Bruijn Graph-based systems. Availability and implementation https://github.com/splatlab/debgr. Supplementary information Supplementary data are available at Bioinformatics online.

Pandey, Prashant↗