Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “bit error”

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 595 records · Page 33

Modeling Entanglement-Based Quantum Key Distribution for the NASA Quantum Communications Analysis Suite

One of the most practical, and sought after, applications of quantum mechanics in the field of information science is the use of entanglement distribution to communicate quantum information effectively. Similar to the continued improvements of functional quantum computers over the past decade, advances in demonstrations of entanglement distribution over long distances may enable new applications in aeronautics and space communications. The existing NASA Quantum Communications Analysis Suite (NQCAS) software models such applications, but limited experimental data exists to verify the model’s theoretical results. There is, however, a large body of experimental data in the relevant literature for entanglement-based quantum key distribution (QKD). This paper details a Monte Carlo based QKD model that uses NQCAS input parameters to generate an estimated QKD link budget for verification of NQCAS. The model generates link budget statistics like key rates, error rates, and S values that can then be compared to the experimental values in the literature. Preliminary comparisons show many similarities between the simulated and experimental data, supporting the model’s validity. A verified NQCAS model will inform experimental work conducted in Glenn Research Center’s (GRC) NASA Quantum Metrology Laboratory (NQML), supporting the United States Quantum Initiative and potential NASA missions.

NASA Quantum Communications Analysis Suite↗

Automating Genetic Algorithm Mutations for Molecules Using a Masked Language Model

Inspired by the evolution of biological systems, genetic algorithms have been applied to generate solutions for optimization problems in a variety of scientific and engineering disciplines. For a given problem, a suitable genome representation must be defined along with a mutation operator to generate subsequent generations. Unlike natural systems which display a variety of complex rearrangements (e.g. mobile genetic elements), mutation for genetic algorithms commonly utilizes only random point-wise changes. Furthermore, generalizing beyond point-wise mutations poses a key difficulty as useful genome rearrangements depend on the representation and problem domain. To move beyond the limitations of manually defined point-wise changes, here we propose the use of techniques from masked language models to automatically generate mutations. As a first step, common subsequences within a given population are used to generate a vocabulary. The vocabulary is then used to tokenize each genome. A masked language model is trained on the tokenized data in order to generate possible rearrangements (i.e. mutations). In order to illustrate the proposed strategy, we use string representations of molecules and use a genetic algorithm to optimize for drug-likeness and synthesizability. Finally, our results show that moving beyond random point-wise mutations accelerates genetic algorithm optimization.

59 BASIC BIOLOGICAL SCIENCES↗

Resiliency in numerical algorithm design for extreme scale simulations

Here this work is based on the seminar titled ‘Resiliency in Numerical Algorithm Design for Extreme Scale Simulations’ held March 1–6, 2020, at Schloss Dagstuhl, that was attended by all the authors. Advanced supercomputing is characterized by very high computation speeds at the cost of involving an enormous amount of resources and costs. A typical large-scale computation running for 48 h on a system consuming 20 MW, as predicted for exascale systems, would consume a million kWh, corresponding to about 100k Euro in energy cost for executing 10 23 floating-point operations. It is clearly unacceptable to lose the whole computation if any of the several million parallel processes fails during the execution. Moreover, if a single operation suffers from a bit-flip error, should the whole computation be declared invalid? What about the notion of reproducibility itself: should this core paradigm of science be revised and refined for results that are obtained by large-scale simulation? Naive versions of conventional resilience techniques will not scale to the exascale regime: with a main memory footprint of tens of Petabytes, synchronously writing checkpoint data all the way to background storage at frequent intervals will create intolerable overheads in runtime and energy consumption. Forecasts show that the mean time between failures could be lower than the time to recover from such a checkpoint, so that large calculations at scale might not make any progress if robust alternatives are not investigated. More advanced resilience techniques must be devised. The key may lie in exploiting both advanced system features as well as specific application knowledge. Research will face two essential questions: (1) what are the reliability requirements for a particular computation and (2) how do we best design the algorithms and software to meet these requirements? While the analysis of use cases can help understand the particular reliability requirements, the construction of remedies is currently wide open. One avenue would be to refine and improve on system- or application-level checkpointing and rollback strategies in the case an error is detected. Developers might use fault notification interfaces and flexible runtime systems to respond to node failures in an application-dependent fashion. Novel numerical algorithms or more stochastic computational approaches may be required to meet accuracy requirements in the face of undetectable soft errors. These ideas constituted an essential topic of the seminar. The goal of this Dagstuhl Seminar was to bring together a diverse group of scientists with expertise in exascale computing to discuss novel ways to make applications resilient against detected and undetected faults. In particular, participants explored the role that algorithms and applications play in the holistic approach needed to tackle this challenge. This article gathers a broad range of perspectives on the role of algorithms, applications and systems in achieving resilience for extreme scale simulations. The ultimate goal is to spark novel ideas and encourage the development of concrete solutions for achieving such resilience holistically.

79 ASTRONOMY AND ASTROPHYSICS↗

Increasing Radon Daughter Plate-out onto Superconducting Qubits

Radon daughter plate-out may pose a fundamental limitation to realizing large-scale superconducting quantum computers. Radon daughters plated-out onto a superconducting qubit chip can decay, releasing energy into the substrate, producing phonons. Phonon induced quasiparticles generate bit flip errors and reduce coherence times. We seek to increase plate-out on chips to enable future study of the impact of Radon on coherence times. In this project, we utilize COMSOL Multiphysics simulations to finalize design for a device to increase radon plate-out.

Kay, Dax [Northwestern U.]↗

A parametric study of the complexity of sequential decoders, volume 2

Plots are presented of complexity versus required signal energy per bit/single-sided noise spectral density to obtain an output probability of error per bit of 0.0001 for an ideal coherent PSK demodulation. Transfer function of convolutional codes and techniques of branch and reference phase synchronization are considered.

Huth, G. K.↗

Modeling of a bubble-memory organization with self-checking translators to achieve high reliability.

Study of the design and modeling of a highly reliable bubble-memory system that has the capabilities of: (1) correcting a single 16-adjacent bit-group error resulting from failures in a single basic storage module (BSM), and (2) detecting with a probability greater than 0.99 any double errors resulting from failures in BSM's. The results of the study justify the design philosophy adopted of employing memory data encoding and a translator to correct single group errors and detect double group errors to enhance the overall system reliability.

Bouricius, W. G.↗

Shuttle orbiter Ku-band radar/communications system design evaluation. Ku band bent-pipe channel performance evaluation

Because of difficulties with the bit detector of the SPA mode 1 channel 3 input port, a new bit synchronizer was required. The two prime candidate designs are described and analyzed. The selected design is a modification of one which utilizes a phase frequency detector to track the received data clock frequency and a mid-bit transition point sample detector to generate a bit timing error (phase error) signal to control the relative phase between the local clock and the local data stream. The model used to calculate the effects of cable attenuation and rise time degradation is discussed.

Holmes, J. K.↗

An interferometer-based phase control system

A system for focusing and pointing the SPS power beam is discussed. The system is ground based and closed loop. One receiving antenna is required on earth. A conventional uplinked data channel transmits an 8-bit phase error correction back to the SPS for sequential calibration of each power module. Beam pointing resolution is better than 140 meters at the rectenna.

Ott, J. H.↗

An interferometer-based phase control system

A system for focusing and pointing the SPS power beam is discussed. The system is ground based and closed loop. One receiving antenna is required on Earth. A conventional uplink data channel transmits an 8-bit phase error correlation back to the SPS for sequential calibration of each power module. Beam pointing resolution is better than 140 meters at the Rectenna.

Ott, J. H.↗

An interferometer based phase control system

An interferometer based phase control system for focusing and pointing the solar power satellite (SPS) power beam is discussed. The system is ground based and closed loop. One receiving antenna is required on Earth. A conventional uplink data channel transmits an 8 bit phase error correction back to the SPS for sequential calibration of each power module. Beam pointing resolution is better than 140 meters at the rectenna.

Ott, J. H.↗

Adaptive Quantizer for Burst Synthetic-Aperture Radar

Adaptive quantizer for burst-mode synthetic-aperture radar reduces data rate of return signal. Device, called block floating-point quantizer (BFPQ) basically analog-to-digital converter that covers wide dynamic range and discards appropriate lower order bits. BFPQ is, in effect, digital approximator with automatic gain control. Moves floatingpoint marker binary representation of signal data in accordance with perceived dynamic range. Available step sizes thus limited to multiples of underlying smallest quantization step (represented by lowest order bit). Retains only first K most significant bits of signal; (L,K) BFPQ is one that does K-bit quantization of signal originally quantized to L bits. Quantization error simply difference between actual signal level and its binary approximation. Other potential applications for BFPQ include speech compression and picture data compression.

Joo, T. H.↗

Iterative demodulation and decoding of coded non-square QAM

Simulation results show that, with iterative demodulation and decoding, coded NS-8QAM performs 0.5 dB better than standard 8QAM and 0.7 dB better than 8PSK at BER= 10(sup -5), when the FEC code is the (15, 11) Hamming code concatenated with a rate-1 accumulator code, while coded NS-32QAM performs 0.25 dB better than standard 32QAM.

iterative decoding QAM bit error rate capacity↗