SEARCH · Search NASA

Results for “Decoding”

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 19 records

All sources NASA NTRS DOE OSTI

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.]↗

DOE OSTI2025

Fault Tolerant Decoding of QLDPC-GKP Codes with Circuit Level Soft Information

Concatenated bosonic-stabilizer codes have recently gained prominence as promising candidates for achieving low-overhead fault-tolerant quantum computing in the long term. In such systems, analog information obtained from the syndrome measurements of an inner bosonic code is used to inform decoding for an outer code layer consisting of a discrete-variable stabilizer code such as a surface code. The use of Quantum Low-Density Parity Check (QLDPC) codes as an outer code is of particular interest due to the significantly higher encoding rates offered by these code families, leading to a further reduction in overhead for large-scale quantum computing. Recent works have investigated the performance of QLDPC-GKP codes in detail, and the use of analog information from the inner code significantly boosts decoder performance. However, the noise models assumed in these works are typically limited to depolarizing or phenomenological noise. In this paper, we investigate the performance of QLDPC-GKP concatenated codes under circuit-level noise, based on a model introduced by Noh et al. in the context of the surface-GKP code. To demonstrate the performance boost from analog information, we investigate three scenarios: (a) decoding without soft information, (b) decoding with precomputed error probabilities but without real-time soft information, and (c) decoding with real-time soft information obtained from round-to-round decoding of the inner GKP code. Results show minimal improvement between (a) and (b), but a significant boost in (c), indicating that real-time soft information is critical for concatenated decoding under circuit-level noise. We also study the effect of measurement schedules with varying depths and show that using a schedule with minimum depth is essential for obtaining reliable soft information from the inner code.

Borah, Shantom K. [Arizona U. (main)]↗

DOE OSTI2024

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding

In network communication, it is common in broadcasting scenarios for there to exist a hierarchy among receivers based on information they decode due, for example, to different physical conditions or premium subscriptions. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. This is modeled mathematically as a degraded message set, indicating a hierarchy between messages to be decoded by different receivers, where the default quality corresponds to a common message intended for all receivers, a higher quality is represented by a message for a smaller subset of receivers, and so forth. We extend these considerations to quantum communication, exploring three-receiver quantum broadcast channels with two- and three-degraded message sets. Our technical tool involves employing quantum non-unique decoding, a technique we develop by utilizing the simultaneous pinching method. Here, we construct one-shot codes for various scenarios and find achievable rate regions relying on various quantum Rényi mutual information error exponents. Our investigation includes a comprehensive study of pinching across tensor product spaces, presenting our findings as the asymptotic counterpart to our one-shot codes. By employing the non-unique decoding, we also establish a simpler proof to Marton’s inner bound for two-receiver quantum broadcast channels without the need for more involved techniques. Additionally, we derive no-go results and demonstrate their tightness in special cases.

Salek, Farzin [Technical University of Munich (Ger↗

DOE OSTI2025

MoRE-Brain: Routed Mixture of Experts for Interpretable and Generalizable Cross-Subject fMRI Visual Decoding

Decoding visual experiences from fMRI offers a powerful avenue to understand human perception and develop advanced brain-computer interfaces. However, current progress often prioritizes maximizing reconstruction fidelity while overlooking interpretability, an essential aspect for deriving neuroscientific insight. To address this gap, we propose MoRE-Brain, a neuro-inspired framework designed for high-fidelity, adaptable, and interpretable visual reconstruction. MoRE-Brain uniquely employs a hierarchical Mixture-of-Experts architecture where distinct experts process fMRI signals from functionally related voxel groups, mimicking specialized brain networks. The experts are first trained to encode fMRI into the frozen CLIP space. A finetuned diffusion model then synthesizes images, guided by expert outputs through a novel dual-stage routing mechanism that dynamically weighs expert contributions across the diffusion process. MoRE-Brain offers three main advancements: First, it introduces a novel Mixture-of-Experts architecture grounded in brain network principles for neuro-decoding. Second, it achieves efficient cross-subject generalization by sharing core expert networks while adapting only subject-specific routers. Third, it provides enhanced mechanistic insight, as the explicit routing reveals precisely how different modeled brain regions shape the semantic and spatial attributes of the reconstructed image. Extensive experiments validate MoRE-Brain’s high reconstruction fidelity, with bottleneck analyses further demonstrating its effective utilization of fMRI signals, distinguishing genuine neural decoding from over-reliance on generative priors. Consequently, MoRE-Brain marks a substantial advance towards more generalizable and interpretable fMRI-based visual decoding.

Wei, Yuxiang [Georgia Institute of Technology]↗

DOE OSTI2026

A Single-Board Fermilab Timing Pipeline on the Xilinx KR260: Decode, Timestamp, Publish, Mirror

Full-width abstract \renewcommand{\maketitlehookd}{% \begin{abstract} \noindent Fermilab's accelerator timing links broadcast short event codes to thousands of devices at once, but the links themselves carry no absolute notion of time; that comes separately from a White Rabbit reference. This work builds the piece that ties the two together on a single board. On a Xilinx Kria KR260 (Zynq UltraScale+), the programmable logic decodes a real Fermilab TCLK link, stamps every event with an absolute White-Rabbit \{sec, ns\} UTC time, and reads the timestamped stream out over AXI4-Lite; a thin Linux process on the same die publishes each event into a Redis stream on the control network. To exercise the full chain on one board, the decoded events are re-encoded as gigabit ACLK, transmitted out an SFP+ optical port, looped back over a short fiber jumper, and decoded again on the same timeline, and are additionally mirrored as an ACLK-Lite Manchester waveform for benchtop probing. Across sustained, multi-day testing against real Fermilab TCLK, the pipeline has decoded, timestamped, and published hundreds of millions of events with practically zero loss, and folding the timestamped stream on the 60-second accelerator supercycle recovers the machine's periodic structure directly from the published data.

Rossel, Jacob [UC, Berkeley; Fermilab] (ORCID:0009↗

DOE OSTI2024

J1939 Decoder

The J1939 Decoder package is a set of scripts that will allow one to decode J1939 messages.

Olatt, Joseph↗

DOE OSTI2025

Chasing ghosts: characterization of artifact generation in coded aperture decoding due to experimental implementation

Coded aperture imaging is a form of lensless aperture imaging that projects multiple overlapping images of the source onto the detector, enhancing signal strength, which is advantageous for low-flux sources or high-resolution imaging. This technique requires decoding of the detector signal to reconstruct the original source, which involves convolving the detector data with the aperture pattern. When the signal is from a centered point source, the reconstructed source image is known as the point spread function (PSF). A clean PSF without artifacts is a Dirac delta function [Appl. Opt. 20, 1858 (1981)]. This paper examines the robustness of the decoding process against variations in experimental tolerances by analyzing artifact growth in the reconstructed PSF. We illustrate the effects of incorrect magnification, rotation, and detector size and find that aperture–detector rotational misalignment about the imaging axis is the most sensitive parameter, with significant artifact generation occurring with angular offsets of less than one degree. We discuss compensation methods for imperfect aperture placement, finding that small detector sizes produce uncompensatable artifact generation, and compare theoretical predictions with experimental PSF measurements of a rank , 6.8 mm thick (less than one mean free path) coded aperture with a 3.5 mm cell size, conducted at the MegaJOuLe Neutron Imaging Radiography dense plasma focus [IEEE Trans. Plasma Sci. 49, 3299 (2021)] using a 2.45 MeV neutron source. Based on our findings, we recommend using magnified coded apertures in the under-sampled regime, which allows for the inclusion of fiducial markers to characterize aperture–detector rotational offsets and the addition of mechanical coupling, where possible, to constrain rotational and magnification offsets.

Selwood, M. P. [Lawrence Livermore National Labora↗

DOE OSTI2024

System for controller area network payload decoding

A system for decoding an unknown automotive controller area network (“CAN”) message definitions. CAN data vehicle signal mappings are typically held in secret and varied by automotive model and year. Without knowledge of the mappings, the wealth of real-time vehicle data hidden in the automotive CAN packets is uninterpretable—impeding research, after-market tuning, efficiency and performance monitoring, fault diagnosis, and privacy-related technologies. This system can ascertain the CAN signals' boundaries (start bit and length), endianness (byte ordering), signedness (binary-to-integer encoding) from raw CAN data. This allows conversion of CAN data to time series. Interpreting the translated CAN data's physical meaning and finding a linear mapping to standard units (e.g., knowing the signal is speed and scaling values to represent units of miles per hour) can be achieved for many signals by leveraging diagnostic standards to obtain real-time measurements of in-vehicle systems. The system can be integrated into lightweight hardware enabling an OBD-II plugin for real-time in-vehicle CAN decoding or run on standard computers. The system can output a standard DBC file with the signal definition information.

Verma, Kiren E.↗

DOE OSTI2025

Enhancing Multi-Step Reservoir Inflow Forecasting: A Time-Variant Encoder–Decoder Approach

Accurate reservoir inflow forecasting is vital for effective water resource management. Reliable forecasts enable operators to optimize storage and release strategies to meet competing sectoral demands—such as water supply, irrigation, and hydropower scheduling—while also mitigating flood and drought risks. To address this need, in this study, we propose a novel time-variant encoder–decoder (ED) model designed specifically to improve multi-step reservoir inflow forecasting, enabling accurate predictions of reservoir inflows up to seven days ahead. Unlike conventional ED-LSTM and recursive ED-LSTM models, which use fixed encoder parameters or recursively propagate predictions, our model incorporates an adaptive encoder structure that dynamically adjusts to evolving conditions at each forecast horizon. Additionally, we introduce the Expected Baseline Integrated Gradients (EB-IGs) method for variable importance analysis, enhancing interpretability of inflow by incorporating multiple baselines to capture a broader range of hydrometeorological conditions. The proposed methods are demonstrated at several diverse reservoirs across the United States. Our results show that they outperform traditional methods, particularly at longer lead times, while also offering insights into the key drivers of inflow forecasting. These advancements contribute to enhanced reservoir management through improved forecasting accuracy and practical decision-making insights under complex hydroclimatic conditions.

58 GEOSCIENCES↗

DOE OSTI2025

Decoding Antenna Behavior in Metal—Organic Frameworks

Metal–organic frameworks (MOFs) define a solid-state platform for developing artificial photosystems. Efficient anisotropic exciton migrations in these frameworks entail “antenna behavior” that can power up the distal interior reaction centers (RC), driving charge separation between donor-acceptor pairs. Reminiscent of the natural light-harvesting complex, such processes can achieve high quantum yield by exploiting the vast interior surface of the porous crystallites. It is important to understand the optimum positioning of the RC site relative to the anisotropic exciton migration path within these frameworks. The efficiency of such antenna behavior is probed here through Stern–Volmer (SV) type analysis with a series of node-anchored redox quenchers, ferrocene-carboxylate, ferrocene acetate, and dinitrobenzoate. Decoding various intrinsic processes, this work constructs a revised SV formalism in solid assembly that hosts ultrafast anisotropic exciton migration to account for the intrinsic exciton hopping rate from the extrinsic electron transfer rate, and the dimension of effective quenching. In conclusion, this transformative understanding can be applied to other relevant solid-state assemblies.

Saha, Bapan [Southern Illinois University, Carbond↗

DOE OSTI2026

Decoding the proton’s gluonic density with lattice QCD-informed machine learning

We present a first machine learning-based decoding of the gluonic structure of the proton from lattice QCD using a variational autoencoder inverse mapper (VAIM). Harnessing the power of generative AI, we predict the parton distribution function (PDF) of the gluon given information on the reduced pseudo-Ioffe-time distributions (RpITDs) as calculated from an ensemble with lattice spacing a ≈ 0.09 fm and a pion mass of M π ≈ 310 MeV. The resulting gluon PDF is consistent with phenomenological global fits within uncertainties, particularly in the intermediate-to-high-x region where lattice data are most constraining. A subsequent correlation analysis confirms that the VAIM learns a meaningful latent representation, highlighting the potential of generative AI to bridge lattice QCD and phenomenological extractions within a unified analysis framework.

Gluon parton distribution function↗

DOE OSTI2024

PDF DECODER ANALYSIS CODE

SF-24-038"PDFdecoder", as a new application to explore parametrizations of parton distribution functions (PDFs) of the proton or other hadrons. The PDFs are fundamental quantities in particle physics which are necessary inputs to precise theoretical predictions for experiments at the Large Hadron Collider (LHC) and other facilities. As such, understanding how the PDFs are parametrized and associated uncertainties is a pressing need. The specific problem PDFdecoder confronts is the need of having a tractable and interpretably machine-learning (ML) framework to parametrize the PDFs and their uncertainties so as to understand how a given preferred parametrization is obtained. This problem has not been significantly addressed in the current literature. While other groups have used ML-based approaches to parametrize PDFs in the form of feed-forward neural networks, the question of tractability has not been explored in a PDF context. Our solution makes significant progress in this problem by using an array of encoder-decoder (essentially, autoencoder) architectures with varying constraints to the intermediate latent spaces based on interpretable physics. As a consequence, the trained models can be used as generative networks to produce interpretable predictions for the PDFs in a way that can be refined and studied further.

Hobbs, Timothy↗

DOE OSTI2025

MSU IETC LSTM Ethernet Decode (AN EDGE)

This research explores the ability of machine learning to perform signal separation of an Ethernet style encoded, full-duplex communication. Typical signal separation currently requires an active tap of the communication line, followed by a recombination and retransmission of the data. The purpose of this research is to study a passive approach to data acquisition from a full-duplex signal. The machine learning model used in this research is a long-short-term memory recurrent neural network (LSTM-RNN). The results show that the LSTM was largely successful in recreating the transmission signal from the measured data points, though the separated signals have not yet been tested using a decoding method.

Full Duplex Signals↗

DOE OSTI2024

Decoding the Broadband Emission of 2D Pb-Sn Halide Perovskites through High-Throughput Exploration

Unlike single-component 2D metal halide perovskites (MHPs) exhibiting sharp excitonic photoluminescence (PL), a broadband PL emerges in mixed Pb-Sn 2D lattices. Two physical models –self-trapped exciton and defect-induced Stokes-shift – are proposed to explain this unconventional phenomenon. However, the explanations provide limited rationalizations without consideration of the formidable compositional space, and thus, the fundamental origin of broadband PL remains elusive. Herein, the high-throughput automated experimental workflow is established to systematically explore the broadband PL in mixed Pb-Sn 2D MHPs, employing PEA (Phenethylammonium) as a model cation known to work as a rigid organic spacer. Spectrally, the broadband PL becomes further broadened with rapid PEA 2 PbI 4 phase segregation with increasing Pb concentrations during early-stage crystallization. Counterintuitively, MHPs with high Pb concentrations exhibit prolonged PL lifetimes. Hyperspectral microscopy identifies substantial PEA 2 PbI 4 phase segregation in those films, hypothesizing that the establishment of charge transfer excitons by the phase segregation upon crystallization at high-Pb compositions results in distinctive PL properties. In conclusion, these results indicate that two independent mechanisms—defect-induced Stoke-shifts and the establishment of charge transfer excitons by phase segregation—coexist which significantly correlates with the Pb:Sn ratio, thereby simultaneously contributing to the broadband PL emission in 2D mixed Pb-Sn HPs.

2D Pb-Sn halide perovskites↗

DOE OSTI2026

Decoding THz‐Driven Dynamic Fingerprints of Ferroelectric Nanotwin Networks

Ultrafast polarization dynamics in ferroelectrics are of considerable interest for high-speed tunable dielectrics and electro-optics. Extended domain wall networks formed in ferroelectric twin nanodomains can support collective dynamics in the terahertz regime but require techniques that track polarization and strain evolution driven by ultrafast stimulus. Here, we use multi-modal probing of THz-pulse-driven excitations in PbTiO 3 /SrTiO 3 superlattices by combining X-ray free electron laser measurements that directly tracks lattice changes, with optical second harmonic generation that tracks the electronic potential coupled with the lattice potential. Dynamical phase-field modeling enables fingerprinting of these collective modes as superpositions of domain “breathing” through wall oscillations and polarization “rotations” with still walls. Ultrafast domain wall motion at 0.1–0.5 THz is observed at practical fields of 100 kV/cm with wall velocities of >4000 m/s, approaching typical speed of sound in PbTiO 3 . A unique “charging” mode is discovered that can electrically charge and discharge domain walls on ∼4 ps time scale thus dynamically tuning wall conductivity. Integrated experimental and theoretical fingerprinting of the dynamical landscape presented here enables ultrafast control of ferroics for high-speed microelectronics and optical applications.

THz dynamics↗