SEARCH · Search NASA

Results for “bandwidth optimization”

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 505 records · Page 28

All sources NASA NTRS DOE OSTI

DOE OSTI2022

SMALE: Enhancing Scalability of Machine Learning Algorithms on Extreme-Scale Computing Platforms

Deployment and execution of machine learning tasks on extreme-scale computing platforms face several significant technical challenges: 1) High computing cost incurred by dense networks – The computing workload of deep networks with densely-connected topology increases rapidly with the network size, imposing a non-scalable computing model of extreme-scale computing platforms; 2) Non-optimized workload distribution – Many advanced deep learning algorithms, e.g., sparsification and irregular net-work topology, produce very unbalanced workload distribution on extreme-scale computing platforms. The computation efficiency is greatly hindered by the incurred data and computation redundancies as well as long tails of the node with extensive workload; 3) Constraints in data movement and I/O bottle-neck – Inter-node data movement in extreme-scale computing platforms are associated with high energy and latency costs, and subject to the constraints of I/O bandwidth; and 4) Generalization of algorithm realization and acceleration on computing platforms – The large varieties of machine learning algorithms and structures of extreme-scale computing platforms make the derivation of a generalized algorithm realization and acceleration method very challenging, which, however, is the requirement by domain scientists and interested users. We call the above challenges Smale’s Problems in Machine Learning and Understanding for High-Performance Computing Scientific Discovery. The objective of our three-year research project is to develop a holistic innovation set at structure, assembly, and acceleration layers of machine learning algorithms to address the above challenges in algorithm deployment and execution. Three tasks are particularly performed, including: At the algorithm structure level, we investigate the techniques that can structurally sparsify on the topology of deep networks for computing workload reduction. We also study clustering and pruning techniques that can optimize the workload distributions over the extreme-scale computing platforms; At the algorithm assembly level, we derive a unified learning framework for unsupervised transfer learning and dynamic growing capabilities. Novel training methods are also exploited to enhance the training efficiency of the proposed framework; At the algorithm acceleration level, we will develop a series of techniques that can accelerate the computation of sparse matrix operations, which are one of the core executions in deep learning and optimize memory access of the concerned platforms. Our proposed techniques attack the fundamental problems in machine learning algorithms running on extreme-scale computing platforms by vertically integrating the solutions at three closely entangled layers, paving the long-term scaling path of machine learning applications under DOE context. Three tasks corresponding to the above respective research orientations are performed during the three-year project period with our collaborators at ORNL. The outcome of the proposed project is anticipated to form a holistic solution set of novel algorithms and network topologies, efficient training techniques, and fast acceleration methods to promote the computing scalability of the machine learning applications of particular interest to DOE.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

SIFT-based dense pixel tracking on 0.35 T cine-MR images acquired during image-guided radiation therapy with application to gating optimization

Purpose: To first demonstrate the viability of applying an image processing technique for tracking regions on low-contrast cine-MR images acquired during image-guided radiation therapy, and then outline a scheme that uses tracking data for optimizing gating results in a patient-specific manner. Methods: A first-generation MR-IGRT system—treating patients since January 2014—integrates a 0.35 T MR scanner into an annular gantry consisting of three independent Co-60 sources. Obtaining adequate frame rates for capturing relevant patient motion across large fields-of-view currently requires coarse in-plane spatial resolution. This study initially (1) investigate the feasibility of rapidly tracking dense pixel correspondences across single, sagittal plane images (with both moderate signal-to-noise and spatial resolution) using a matching objective for highly descriptive vectors called scale-invariant feature transform (SIFT) descriptors associated to all pixels that describe intensity gradients in local regions around each pixel. To more accurately track features, (2) harmonic analysis was then applied to all pixel trajectories within a region-of-interest across a short training period. In particular, the procedure adjusts the motion of outlying trajectories whose relative spectral power within a frequency bandwidth consistent with respiration (or another form of periodic motion) does not exceed a threshold value that is manually specified following the training period. To evaluate the tracking reliability after applying this correction, conventional metrics—including Dice similarity coefficients (DSCs), mean tracking errors (MTEs), and Hausdorff distances (HD)—were used to compare target segmentations obtained via tracking to manually delineated segmentations. Upon confirming the viability of this descriptor-based procedure for reliably tracking features, the study (3) outlines a scheme for optimizing gating parameters—including relative target position and a tolerable margin about this position—derived from a probability density function that is constructed using tracking results obtained just prior to treatment. Results: The feasibility of applying the matching objective for SIFT descriptors toward pixel-by-pixel tracking on cine-MR acquisitions was first retrospectively demonstrated for 19 treatments (spanning various sites). Both with and without motion correction based on harmonic analysis, sub-pixel MTEs were obtained. A mean DSC value spanning all patients of 0.916 ± 0.001 was obtained without motion correction, with DSC values exceeding 0.85 for all patients considered. While most patients show accurate tracking without motion correction, harmonic analysis does yield substantial gain in accuracy (defined using HDs) for three particularly challenging subjects. An application of tracking toward a gating optimization procedure was then demonstrated that should allow a physician to balance beam-on time and tissue sparing in a patient-specific manner by tuning several intuitive parameters. Conclusions: Tracking results show high fidelity in assessing intrafractional motion observed on cine-MR acquisitions. Incorporating harmonic analysis during a training period improves the robustness of the tracking for challenging targets. The concomitant gating optimization procedure should allow for physicians to quantitatively assess gating effectiveness quickly just prior to treatment in a patient-specific manner.

61 RADIATION PROTECTION AND DOSIMETRY↗

DOE OSTI2018

Adaptive Runtime Features For Distributed Graph Algorithms

Performance of distributed graph algorithms can benefit greatly by forming rapport between algorithmic abstraction and the underlying runtime system that is responsible for scheduling work and exchanging messages. However, due to their dynamic and irregular nature of computation, distributed graph algorithms written in different programming models impose varying degree of workload pressure on the runtime. To cope with such vastly different workload characteristics, a runtime has to make several trade-offs. One such trade-off arises, for example, when the runtime scheduler has to choose among alternatives such as whether to execute algorithmic work, or progress the network by probing network buffers, or throttle sending messages (termed flow control). This tradeoff decides between optimizing the throughput of a runtime scheduler by increasing the rate of execution of algorithmic work, and reducing the latency of the network messages. Another trade-off exists when a decision has to be made about when to send aggregated messages in buffers (message coalescing). This decision chooses between trading off latency for network bandwidth and vice versa. At any instant, such trade-offs emphasize either on improving the quantity of work being executed (by maximizing the scheduler throughput) or on improving the quality of work (by prioritizing better work). However, encoding static policies for different runtime features (such as flow control, coalescing) can prevent graph algorithms from achieving their full potential, thus can undermine the actual performance of a distributed graph algorithm . In this paper, we investigate runtime support for distributed graph algorithms in the context of two paradigms: variants of wellknown Bulk-Synchronous Parallel model and asynchronous programming model. We explore generic runtime features such as message coalescing (aggregation) and flow control and show that execution policies of these features need to be adjusted over time to make a positive impact on the execution time of a distributed graph algorithm. Since synchronous and asynchronous graph algorithms have different workload characteristics, not all of such runtime features may be good candidates for adaptation. Each of these algorithmic paradigms may require different set of features to be adapted over time. We demonstrate which set of feature(s) can be useful in each case to achieve the right balance of work in the runtime layer. Existing implementation of different graph algorithms can benefit from adapting dynamic policies in the underlying runtime.

Firoz, Jesun S.↗

DOE OSTI2023

Design and simulation of multilayer coatings for a multi-channel Wolter-like x-ray imager with large field of view and high resolution

X-ray diagnostics are key instruments for understanding the physics behind inertial confinement fusion experiments. We report on the multilayer design optimization for the Toroidal X-ray Imager (TXI), a hard x-rays microscope instrument designed by Commissariat à l’énergie atomique (CEA) and Laboratoire Charles Fabry (LCF) to be installed on the National Ignition Facility. TXI includes six channels designed for three different energy bands centered on 8.7, 13, and 17.5 keV. Each channel is made up of two toroidal mirrors arranged in a Wolter-like configuration. The required field of view is 800 × 400 µm2, and the resolution should be better than 5 µm. In addition, we seek to estimate the spatial distribution of the temperature, which requires no spectral overlap of the different energy bands and a good spectral homogeneity of the image produced. The development of the multilayer coatings was performed in a two-step method. First, the coatings were optimized to obtain proper energy bands. Then, an x-ray tracing code was used to calculate the integrated optical response of each channel and adjust the response of the mirror to fulfill the requirements. To fulfill all the specifications, we propose an original design using a combination of two aperiodic coatings, one with a narrow bandwidth and the other one with a larger bandwidth.

hard x-rays↗

NASA NTRS1994

Bounds and Simulation Results of 32-ary and 64-ary Quadrature Amplitude Modulation for Broadband-ISDN via Satellite

Union bounds and Monte Carlo simulation Bit-Error-Rate (BER) performance results are presented for various 32-ary and 64-ary Quadrature Amplitude Modulation (QAM) schemes. Filtered and unfiltered modulation formats are compared for the best packing arrangement in peak power limited systems. It is verified that circular constellations which populate as many symbols as possible at the peak magnitude offer the best performance. For example: a 32-ary QAM scheme based on concentric circles offers about 1.05 dB better peak power improvement at a BER of 10(exp -6) over the scheme optimized for average power using triangular symbol packing. This peak power improvement increases to 1.25 dB for comparable 64-ary QAM schemes. This work serves as a precursor to determine the feasibility of a combined modem/codec that can accommodate Broadband Integrated Services Digital Network (B-ISDN) at a rate of 155.52 Mbps through typical transponder bandwidths of 36 MHz and 54 MHz.

Kifle, Muli↗

NASA NTRS2014

Design and Development of Aerogel-Based Antennas for Aerospace Applications: A Final Report to the NARI Seedling

As highly porous solids possessing low density and low dielectric permittivity combined with good mechanical properties, polyimide (PI) aerogels offer great promise as an enabling technology for lightweight aircraft antenna systems. While they have been aggressively explored for thermal insulation, barely any effort has been made to leverage these materials for antennas or other applications that take advantage of their aforementioned attributes. In Phase I of the NARI Seedling Project, we fabricated PI aerogels with properties tailored to enable new antenna concepts with performance characteristics (wide bandwidth and high gain) and material properties (low density, environmental stability, and robustness) superior to the state of practice (SOP). We characterized electromagnetic properties, including permittivity, reflectivity, and propagation losses for the aerogels. Simple, prototype planar printed circuit patch antennas from down-selected aerogel formulations were fabricated by molding the aerogels to net shapes and by gold-metalizing the pattern onto the templates via electron beam evaporation in a clean room environment. These aerogel based antennas were benchmarked against current antenna SOP, and exhibited both broader bandwidth and comparable or higher gain performance at appreciably lower mass. Phase II focused on the success of the Phase I results pushing the PI aerogel based antenna technology further by exploring alternative antenna design (i.e., slot coupled antennas) and by examining other techniques for fabricating the antennas including ink jet printing with the goal of optimizing antenna performance and simplifying production. We also examined new aerogel formulations with better moisture and solvent resistance to survive processing conditions. In addition, we investigated more complex antenna designs including passive phased arrays such as 2x4 and 4x8 element arrays to assess the scalability of the aerogel antenna concept. Furthermore, we explored the possibility of developing these arrays in thin, flexible form to make conformable antennas.

insulation↗

DOE OSTI2024

The 140 GHz notch filter development for millimeter-wave diagnostics protection on the stellarator Wendelstein 7-X

The notch filter plays a crucial role as a protective component in microwave diagnostics, primarily by addressing issues related to catastrophic interference. Designed for millimeter-wave diagnostics on the stellarator Wendelstein 7-X (W7-X), a WR-6 waveguide-based notch filter has been successfully developed to effectively isolate leakage from auxiliary heating gyrotrons operating at 140 GHz. The filter incorporates cylindrical cavities resonating at 140 GHz for the TE11p mode, with coupling structures that are designed and optimized for high-efficiency coupling. This configuration simplifies fabrication, thereby ensuring high-yield production. Experimental fabrication and in-house characterization confirm the notch filter's exceptional performance, with over 60 dB rejection in the vicinity of 140 GHz and low insertion loss (< 2 dB) above and below the notch frequency across a broad frequency bandwidth (121–138 GHz, 142–163 GHz). Furthermore, the utilization of this high-frequency structure fabrication technology can be applied to millimeter-wave diagnostics on other machines. In addition to the design elements of the notch filter, this paper also provides a detailed discussion of the fabrication process and methodology.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2020

A High-Throughput Solver for Marginalized Graph Kernels on GPU

Here, we present the design and optimization of a solver for efficient and high-throughput computation of the marginalized graph kernel on General Purpose GPUs. The graph kernel is computed using the conjugate gradient method to solve a generalized Laplacian of the tensor product between a pair of graphs. To cope with the large gap between the instruction throughput and the memory bandwidth of the GPUs, our solver forms the graph tensor product on-the-fly without storing it in memory. This is achieved by using threads in a warp cooperatively to stream the adjacency and edge label matrices of individual graphs by small square matrix blocks called tiles, which are then staged in registers and the shared memory for later reuse. Warps across a thread block can further share tiles via the shared memory to increase data reuse. We exploit the sparsity of the graphs hierarchically by storing only non-empty tiles using a coordinate format and nonzero elements within each tile using bitmaps. We propose a new partition-based reordering algorithm for aggregating nonzero elements of the graphs into fewer but denser tiles to further exploit sparsity. We carry out extensive theoretical analyses on the graph tensor product primitives for tiles of various density and evaluate their performance on synthetic and real-world datasets. Our solver delivers three to four orders of magnitude speedup over existing CPU-based solvers such as GraKeL and GraphKernels. The capability of the solver enables kernel-based learning tasks at unprecedented scales.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2012

Efficient Databases for MPC Microdata (Final Report)

The purpose of this grant was to develop the theory and practice of high-performance databases for massive streamed datasets. Over the last three years, we have developed fast indexing technology, that is, technology for rapidly ingesting data and storing that data so that it can be efficiently queried and analyzed. During this project we developed the technology so that high-bandwidth data streams can be indexed and queried efficiently. Our technology has been proven to work data sets composed of tens of billions of rows when the data streams arrives at over 40,000 rows per second. We achieved these numbers even on a single disk driven by two cores. Our work comprised (1) new write-optimized data structures with better asymptotic complexity than traditional structures, (2) implementation, and (3) benchmarking. We furthermore developed a prototype of TokuFS, a middleware layer that can handle microdata I/O packaged up in an MPI-IO abstraction.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2006

A High Efficiency Multiple-Anode 260-340 GHz Frequency Tripler

We report on the fabrication at the Jet Propulsion Laboratory of a fixed-tuned split-block waveguide balanced frequency tripler working in the 260-340 GHz band. This tripler will be the first stage of a x3x3x3 multiplier chain to 2.7 THz (the last stages of which are being fabricated at JPL) and is therefore optimized for high power operation. The multiplier features six GaAs Schottky planar diodes in a balanced configuration integrated on a GaAs membrane. Special attention was put on splitting the input power as evenly as possible among the diodes in order to ensure that no diode is overdriven. Preliminary RF tests indicate that the multiplier covers the expected bandwidth and that the efficiency is in the range 1.5-7.5 % with 100 mW of input power.

local oscillators↗

DOE OSTI2025

Noise limits for dc SQUID readout of high- Q resonators below 300 MHz

We present the limits on noise for the readout of cryogenic high-Q resonators using dc Superconducting Quantum Interference Devices (SQUIDs) below 300 MHz. This analysis uses realized first-stage SQUIDs (previously published), whose performance is well described by Tesche–Clarke (TC) theory, coupled directly to the resonators. We also present data from a prototype second-stage dc SQUID array designed to couple to this first-stage SQUID as a follow-on amplifier with high system bandwidth. This analysis is the first full consideration of dc SQUID noise performance referred to a high-Q resonator over this frequency range and is presented relative to the standard quantum limit. We include imprecision, backaction, and backaction–imprecision noise correlations from TC theory, the noise contributed by the second-stage SQUIDs, wiring, and preamplifiers, and optimizations for both on-resonance measurements and off-resonance scan sensitivity. This architecture has modern relevance due to the increased interest in axion searches and the requirements of the DMRadio-m 3 axion search, which uses dc SQUIDs in this frequency range.

Bosons↗

DOE OSTI2026

Towards a self-driving trigger at the LHC: adaptive response in real time

Real-time data filtering and selection—or trigger—systems at high-throughput scientific facilities such as the experiments at the Large Hadron Collider must process extremely high-rate data streams under stringent bandwidth, latency, and storage constraints. Yet these systems are typically designed as static, hand-tuned menus of selection criteria grounded in prior knowledge and simulation. In this work, we further explore the concept of a self-driving trigger, an autonomous data-filtering framework that reallocates resources and adjusts thresholds dynamically in real-time to optimize signal efficiency, rate stability, and computational cost as instrumentation and environmental conditions evolve. We introduce a benchmark ecosystem to emulate realistic collider scenarios and demonstrate real-time optimization of a menu including canonical energy sum triggers as well as modern anomaly-detection algorithms that target non-standard event topologies using machine learning. Using simulated data streams and publicly available collision data from the Compact Muon Solenoid experiment, we demonstrate the capability to dynamically and automatically optimize trigger performance under specific cost objectives without manual retuning. Our adaptive strategy shifts trigger design from static menus with heuristic tuning to intelligent, automated, data-driven control, unlocking greater flexibility and discovery potential in future high-energy physics analyses.

Emami, Shaghayegh [Michigan U.] (ORCID:00090007589↗

DOE OSTI2023

Software-Hardware Co-design of Heterogeneous SmartNIC System for Recommendation Models Inference and Training

Deep Learning Recommendation Models (DLRMs) are critical applications in various domains and have evolved as one of the single largest machine learning applications. Trillions of DLRM parameters exceed the on-chip memory capacity of GPUs. Large-scale multi-node systems are required for distributed DLRM inference and training, which suffer from the all-to-all communication bottleneck, mainly limiting the scalability of ever-growing DLRMs. In recent years, SmartNICs have evolved with coupled computation and communication capabilities providing opportunities for a powerful heterogeneous device in the system. However, there isn't such a distributed system that fully leverages the abundant smartNIC resources that resolve the scalability issue of DLRMs. In this work, we proposed a software-hardware co-design of a heterogeneous smartNIC system that resolves the communication bottleneck of distributed DLRMs, mitigates the memory bandwidth pressure, and improves computation efficiency. We provide a set of smartNIC designs of cache systems (including local cache and remote cache) and smartNIC computation kernels which reduce data movement, relieve memory lookup intensity, and improve the GPU's computation efficiency. In addition, we propose a graph algorithm that improves the data locality of queries within batches which optimizes the overall system performance with higher data reuse. Our evaluation shows that our system achieves 2.1x latency speedup for inference and 1.6x throughput speedup for training.

Guo, Anqi↗

NASA NTRS1984

Measured effects of wind turbine generation at the Block Island Power Company

Data measurements made on the NASA MOD-OA 200-kw wind-turbine generator (WTG) installed on a utility grid form the basis for an overall performance analysis. Fuel displacement/-savings, dynamic interactions, and WTG excitation (reactive-power) control effects are studied. Continuous recording of a large number of electrical and mechanical variables on FM magnetic tape permit evaluation and correlation of phenomena over a bandwidth of at least 20 Hz. Because the wind-power penetration reached peaks of 60 percent, the impact of wind fluctuation and wind-turbine/diesel-utility interaction is evaluated in a worst-case scenario. The speed-governor dynamics of the diesel units exhibited an underdamped response, and the utility operation procedures were not altered to optimize overall WTG/utility performance. Primary findings over the data collection period are: a calculated 6.7-percent reduction in fuel consumption while generating 11 percent of the total electrical energy; acceptable system voltage and frequency fluctuations with WTG connected; and applicability of WTG excitation schemes using voltage, power, or VARS as the controlled variable.

Wilreker, V. F.↗

NASA NTRS1999

Analog Module Architecture for Space-Qualified Field-Programmable Mixed-Signal Arrays

Spacecraft require all manner of both digital and analog circuits. Onboard digital systems are constructed almost exclusively from field-programmable gate array (FPGA) circuits providing numerous advantages over discrete design including high integration density, high reliability, fast turn-around design cycle time, lower mass, volume, and power consumption, and lower parts acquisition and flight qualification costs. Analog and mixed-signal circuits perform tasks ranging from housekeeping to signal conditioning and processing. These circuits are painstakingly designed and built using discrete components due to a lack of options for field-programmability. FPAA (Field-Programmable Analog Array) and FPMA (Field-Programmable Mixed-signal Array) parts exist but not in radiation-tolerant technology and not necessarily in an architecture optimal for the design of analog circuits for spaceflight applications. This paper outlines an architecture proposed for an FPAA fabricated in an existing commercial digital CMOS process used to make radiation-tolerant antifuse-based FPGA devices. The primary concerns are the impact of the technology and the overall array architecture on the flexibility of programming, the bandwidth available for high-speed analog circuits, and the accuracy of the components for high-performance applications.

Edwards, R. Timothy↗

NASA NTRS1990

Hybrid vision activities at NASA Johnson Space Center

NASA's Johnson Space Center in Houston, Texas, is active in several aspects of hybrid image processing. (The term hybrid image processing refers to a system that combines digital and photonic processing). The major thrusts are autonomous space operations such as planetary landing, servicing, and rendezvous and docking. By processing images in non-Cartesian geometries to achieve shift invariance to canonical distortions, researchers use certain aspects of the human visual system for machine vision. That technology flow is bidirectional; researchers are investigating the possible utility of video-rate coordinate transformations for human low-vision patients. Man-in-the-loop teleoperations are also supported by the use of video-rate image-coordinate transformations, as researchers plan to use bandwidth compression tailored to the varying spatial acuity of the human operator. Technological elements being developed in the program include upgraded spatial light modulators, real-time coordinate transformations in video imagery, synthetic filters that robustly allow estimation of object pose parameters, convolutionally blurred filters that have continuously selectable invariance to such image changes as magnification and rotation, and optimization of optical correlation done with spatial light modulators that have limited range and couple both phase and amplitude in their response.

Juday, Richard D.↗

NASA NTRS2001

Evolutionary Optimization of Yagi-Uda Antennas

Yagi-Uda antennas are known to be difficult to design and optimize due to their sensitivity at high gain, and the inclusion of numerous parasitic elements. We present a genetic algorithm-based automated antenna optimization system that uses a fixed Yagi-Uda topology and a byte-encoded antenna representation. The fitness calculation allows the implicit relationship between power gain and sidelobe/backlobe loss to emerge naturally, a technique that is less complex than previous approaches. The genetic operators used are also simpler. Our results include Yagi-Uda antennas that have excellent bandwidth and gain properties with very good impedance characteristics. Results exceeded previous Yagi-Uda antennas produced via evolutionary algorithms by at least 7.8% in mainlobe gain. We also present encouraging preliminary results where a coevolutionary genetic algorithm is used.

Lohn, Jason D.↗

DOE OSTI2023

Better Than Worst-Case Decoding for Quantum Error Correction

The overheads of classical decoding for quantum error correction in cryogenic quantum systems grow rapidly with the number of logical qubits and their correction code distance. Decoding at room temperature is bottlenecked by refrigerator I/O bandwidth while cryogenic on-chip decoding is limited by area/power/thermal budget. To overcome these overheads, we are motivated by the observation that in the common case (over 90% of the time), error correction 'syndromes' are fairly trivial with high redundancy / sparsity, since the error correction codes are over-provisioned to be able to correct for uncommon worst-case complex scenarios (to ensure substantially low logical error rates). If suitably exploited, these trivial scenarios can be handled with insignificant overhead, thereby alleviating any bottlenecks towards handling the worst-case scenarios by state-of-the-art means. Here, we propose Better Than Worst-Case Decoding for Quantum Error Correction, targeting cryogenic quantum systems and Surface Code, consisting of: On-chip Clique Decoder: An extremely lightweight decoder for correcting trivial common-case errors, designed for the cryogenic domain. The decoder is implemented and evaluated for SFQ logic. Statistical Off-chip Bandwidth Allocation: A statistical confidence-based technique for allocation of off-chip decoding bandwidth, to efficiently handle the rare complex decodes that are not covered by the Clique Decoder. Decode-Overflow Execution Stalling: A method to stall circuit execution, for the worst-case scenarios in which the provisioned off-chip bandwidth is insufficient to complete all requested off-chip decodes. In all, BTWC decoding achieves 70-99+% off-chip bandwidth elimination across a range of logical and physical error rates, without significantly sacrificing the accuracy of a state-of-the-art off-chip decoder. Further, it achieves 10-1000x bandwidth reduction over prior bandwidth reduction techniques, as well as 15-37x resource overhead reduction compared to prior on-chip decoding.

cryogenic optimization↗