Search NASA⌕ Search

SEARCH · Search NASA

Results for “LOGIC”

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 1,099 records · Page 61

Knowledge represented using RDF semantic network in the concept of semantic web

The RDF(S) model has been declared as the basic model to capture knowledge of the semantic web. It provides a common and flexible way to decompose composed knowledge to elementary statements, which can be represented by RDF triples or by RDF graph vectors. From the logical point of view, elements of knowledge can be expressed using at most binary predicates, which can be converted to RDF-triples or graph vectors. However, it is not able to capture implicit knowledge representable by logical formulas. This contribution shows how existing approaches (semantic networks and clausal form logic) can be combined together with RDF to obtain RDF-compatible system with ability to represent implicit knowledge and inference over knowledge base.

97 MATHEMATICS AND COMPUTING↗

Voltage-controlled low-energy switching of nanomagnets through Ruderman-Kittel-Kasuya-Yosida interactions for magnetoelectric device applications

In this article, we consider through simulation low-energy switching of nanomagnets via electrostatically gated inter-magnet Ruderman-Kittel-Kasuya-Yosida (RKKY) interactions on the surface of three-dimensional topological insulators, for possible memory and nonvolatile logic applications. We model the possibility and dynamics of RKKY-based switching of one nanomagnet by coupling to one or more nanomagnets of set orientation. Potential applications to both memory and nonvolatile logic are illustrated. Sub-attojoule switching energies, far below conventional spin transfer torque (STT)-based memories and even below CMOS logic appear possible. Switching times on the order of a few nanoseconds, comparable to times for STT switching, are estimated for ferromagnetic nanomagnets, but the approach also appears compatible with the use of antiferromagnets which may allow for faster switching.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A 28 nm multiply-accumulate ASIC architecture for on-chip data compression in MHz frame rate X-ray and electron pixel detectors

Modern X-ray detector systems urgently require compact, efficient, and fast data compression schemes to handle the transmission of big data from pixel arrays, enabling frame rates in the MHz regime. Here, in this work, a data compression ASIC that implements a streaming fixed-length lossy compression scheme is introduced and analyzed, proving the feasibility and benefits of on-chip compression. The compression scheme utilizes a vector matrix product logic, which performs a number of floating-point multiplications, additions, and accumulations. The logic is verified, synthesized, and shown to fit in the area resource available for the X-ray detector under study, which comprises 192 × 168 pixels each of 12-bit width, and having a total area of 20 mm× 20 mm, about 2 mm× 20 mm of which are available for the digital logic. Several system architectures, precisions, and compression ratios ranging from 100 to 250 were analyzed to pave the way for on-chip fixed-length compression (e.g., principal component analysis, singular value decomposition) and data reduction (e.g., azimuthal integration) for X-ray and electron detectors.

Data compression↗

Fault-tolerant resource comparison of qudit and qubit encodings for diagonal quadratic operators

Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings, but their fault-tolerant advantage over qubit encodings remains unclear. We compare the non-Clifford cost of implementing quadratic diagonal evolutions, exemplified by 𝑈 = 𝑒$^{−𝑖⁢𝑡⁢𝜙^2_𝑥}$ in a uniform field-amplitude discretization of a real scalar field, using either one logical 𝑑-level qudit or 𝑛 𝑏 = ⌈log 2⁡ 𝑑⌉ logical qubits. We analyze two standard settings: product-formula simulation and linear combination of unitaries (LCU) per block encoding, taking the resource metric to be the number of non-Clifford gates after synthesis into a discrete logical gate set. Because tight synthesis bounds for general single-qudit rotations are not known, we express the qudit constructions in terms of embedded two-level SU⁡(2) rotations and derive explicit finite-𝑑 break-even conditions for their synthesis cost; these serve as compiler targets for when qudit encodings can outperform the qubit baseline. Within the constructive models studied here, product-formula implementations would require an exponentially stronger per-primitive synthesis advantage for qudits to win asymptotically, while in the LCU setting the qubit encoding is asymptotically cheaper in 𝑑. Nevertheless, the finite-𝑑 threshold analysis identifies low-dimensional regions in which qudits can yield meaningful constant-factor savings, particularly for LCU-based implementations. As a secondary analysis of the LCU construction, we use an idealized negligible-overhead qubit-qudit code-switching model to give an absolute 𝑇-count comparison and reinterpret the savings as an allowable per-switch overhead budget.

Godwood, Samuel [Univ. of Liverpool (United Kingdo↗

Domain walls riding the wave.

Recent years have witnessed a rapid proliferation of electronic gadgets around the world. These devices are used for both communication and entertainment, and it is a fact that they account for a growing portion of household energy consumption and overall world consumption of electricity. Increasing the energy efficiency of these devices could have a far greater and immediate impact than a gradual switch to renewable energy sources. The advances in the area of spintronics are therefore very important, as gadgets are mostly comprised of memory and logic elements. Recent developments in controlled manipulation of magnetic domains in ferromagnet nanostructures have opened opportunities for novel device architectures. This new class of memories and logic gates could soon power millions of consumer electronic devices. The attractiveness of using domain-wall motion in electronics is due to its inherent reliability (no mechanical moving parts), scalability (3D scalable architectures such as in racetrack memory), and nonvolatility (retains information in the absence of power). The remaining obstacles in widespread use of 'racetrack-type' elements are the speed and the energy dissipation during the manipulation of domain walls. In their recent contribution to Physical Review Letters, Oleg Tretiakov, Yang Liu, and Artem Abanov from Texas A&M University in College Station, provide a theoretical description of domain-wall motion in nanoscale ferromagnets due to the spin-polarized currents. They find exact conditions for time-dependent resonant domain-wall movement, which could speed up the motion of domain walls while minimizing Ohmic losses. Movement of domain walls in ferromagnetic nanowires can be achieved by application of external magnetic fields or by passing a spin-polarized current through the nanowire itself. On the other hand, the readout of the domain state is done by measuring the resistance of the wire. Therefore, passing current through the ferromagnetic wire is the preferred method, as it combines manipulation and readout of the domain-wall state. The electrons that take part in the process of readout and manipulation of the domain-wall structure in the nanowire do so through the so-called spin transfer torque: When spin-polarized electrons in the ferromagnet nanowire pass through the domain wall they experience a nonuniform magnetization, and they try to align their spins with the local magnetic moments. The force that the electrons experience has a reaction force counterpart that 'pushes' the local magnetic moments, resulting in movement of the domain wall in the direction of the electron flow through the spin-transfer torque. The forces between the electrons and the local magnetic moments in the ferromagnet also create additional electrical resistance for the electrons passing through the domain wall. By measuring resistance across a segment of the nanowire, one determines if a domain wall is present; i.e., one can read the stored information. The interaction of the spin-polarized electrons with the domain wall in the ferromagnetic nanowire is not very efficient. Even for materials achieving high polarization of the free electrons, it is very difficult to move the magnetic domain wall. Several factors contribute to this problem, with imperfections of the ferromagnetic nanowire that cause domain-wall pinning being the dominant one. Permalloy nanowires, one of the best candidates for domain-wall-based memory and logic devices, require current densities of the order of 10{sup 8} A/cm{sup 2} in order to move a domain wall from a pinning well. Considering that this current has to pass through a relatively long wire, it is not very difficult to imagine that most of the energy will go to Joule heating. The efficiency of the process - the ratio of the energy converted to domain-wall motion to the total energy consumed - is comparable to that of an incandescent light bulb converting electricity to light. A step towards more efficient domain-wall-based memory devices is the advance of using alternating currents or current pulses to drive the domain walls. Injection of a spin-polarized current below the threshold value necessary to move the domain wall only causes oscillation of the domain wall inside the pinning potential. Exploiting the effect of resonance, one can apply a specific current waveform to drive the oscillations of the domain wall into resonance. Resonant amplification of domain-wall oscillations will free the domain wall from the pinning well at current levels that are a fraction of the dc threshold. Currents of an order of magnitude lower than before were shown to be sufficient to manipulate domain walls, thus reducing Joule heating 100 times. In their current paper, Tretiakov et al. provide a theoretical basis for the mechanism of resonant domain-wall motion in ferromagnetic nanowires.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Single-shot quantum error correction in intertwined toric codes

We construct a subsystem code in three dimensions that exhibits single-shot error correction in a user-friendly and transparent way. As this code is a subsystem version of coupled toric codes, we call it the intertwined toric code (ITC). Although previous codes share the property of single-shot error correction, the ITC is distinguished by its physically motivated origin, geometrically straightforward logical operators and errors, and a simple phase diagram. The code arises from three-dimensional (3D) stabilizer toric codes in a way that emphasizes the physical origin of the single-shot property. In particular, starting with two copies of the 3D toric code, we add check operators that provide for the confinement of pointlike excitations without condensing the loop excitations. Geometrically, the bare and dressed logical operators in the ITC derive from logical operators in the underlying toric codes, creating a clear relationship between errors and measurement outcomes. The syndromes of the ITC resemble the syndromes of the single-shot code by Kubica and Vasmer, allowing us to use their decoding schemes. We also extract the phase diagram corresponding to ITC and show that it contains the phases found in the Kubica-Vasmer code. Lastly, we suggest various connections to Walker-Wang models and measurement-based quantum computation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Fault-tolerant optical interconnects for neutral-atom arrays

We analyze the use of photonic links to enable large-scale fault-tolerant connectivity of locally error-corrected modules based on neutral atom arrays. Our approach makes use of recent theoretical results showing the robustness of surface codes to boundary noise and combines recent experimental advances in atom-array quantum computing with logical qubits with optical quantum networking techniques. We find the conditions for fault tolerance can be achieved with local two-qubit Rydberg gate and nonlocal Bell-pair errors below 1% and 10%, respectively, without requiring distillation or space-time overheads. Realizing the interconnects with a lens, a single optical cavity, or an array of cavities enables—with sufficient multiplexing—a Bell-pair generation rate in the 1–50 MHz range. When directly interfacing logical qubits, this rate translates to error-correction cycles in the 25–2000 kHz range, satisfying all requirements for fault tolerance and in the upper range fast enough for 100 kHz logical clock cycles. Published by the American Physical Society 2025

Sinclair, Josiah (ORCID:0000000215238295)↗

Quantum Circuits for S-Box Implementation without Ancilla Qubits

A method is presented for implementing substitutions (S-boxes) in the form of quantum circuits without ancilla qubits. Quantum circuits are presented that implement substitutions in the GOST R 34.12-2015 block cipher “Magma” on four logical qubits, and the descriptions of quantum circuits implementing AES and GOST R 34.12-2015 “Kuznechik” S-boxes on 8 logical qubits—quantum circuits with minimum number of logical qubits—are given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

LBNL Cell controller v1.0

Firmware and software of LBNL's Cell controller logic. Cell logic forms a high-speed data distribution network of FPGAs, transmitting data in a ring topology. This logic is used at ALS for the distribution of BPM data as part of the fast orbit feedback system.

Norum, William↗

Maximum Switching Throughput Density Estimator

SAND2024-11125O The Maximum Switching Throughput Density Estimator software performs a simple analysis that estimates the maximum logic switching throughput density that’s achieved in various CMOS technology nodes on the International Roadmap for Devices and Systems. This software utilizes simple device models and optimization techniques, performing a simple sweep over a range of possible logic supply voltages, and analytically calculating the maximum switching frequency for the given logic voltage that meets the power density constraint. It does this by using simple models of power dissipation in conventional and fully adiabatic switching. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Frank, Michael↗

Evaluation of the first version of the new RFPI system dedicated to PIP-II project accelerator

The Low-Level Radio Frequency (LLRF) control system is one of the most critical superconducting linac infrastructures responsible for the parameters of the beam acceleration. The LLRF system mainly focuses on the electromagnetic field parameters inside the cavity. While it incorporates fast feedback algorithms to optimize energy transfer to the passing particle beam it does not follow other cryomodule or cavity parameter changes. The Radio Frequency Protection Interlock (RFPI) system closely monitors various factors (like cryomodule vacuum, beamline vacuum, field emission probe current level, temperature, RF signal leakage, etc). Its simple but reliable logic has to provide an instant decision about the LLRF system or high-power amplifier output signal blocking in case of safety region excitation. This contribution presents a new version of the RFPI system which logic is implemented in the FPGA chip. The initial work on the prototype of the new system design resulted in the PoC (Proof of Concept) device. The PoC offers the possibility of various protection logic configurations, input signals parameters evaluation, and modularity aspects verification. The structure and test results from the device evaluation are summarized and discussed in this contribution.

43 PARTICLE ACCELERATORS↗

Revision of the DELFIC Particle Activity Module

The Defense Land Fallout Interpretive Code (DELFIC) was originally released in 1968 as a tool for modeling fallout patterns and for predicting exposure rates. Despite the continual advancement of knowledge of fission yields, decay behavior of fission products, and biological dosimetry, the decay data and logic of DELFIC have remained mostly unchanged since inception. Additionally, previous code revisions caused a loss of conservation of radioactive nuclides. In this report, a new revision of the decay database and the Particle Activity Module is introduced and explained. The database upgrades discussed are replacement of the fission yields with ENDF/B-VII data as formatted in the Oak Ridge Isotope Generation (ORIGEN) code, revised decay constants, revised exposure rate multipliers, revised decay modes and branching ratios, and revised boiling point data. Included decay logic upgrades represent a correction of a flaw in the treatment of the fission yields, extension of the logic to include more complex decay modes, conservation of nuclides (including stable nuclides) at all times, and conversion of key variables to double precision for nuclide conservation. Finally, recommended future work is discussed with an emphasis on completion of the overall radiation physics upgrade, particularly for dosimetry, induced activity, decay of the actinides, and fractionation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

RAVEN: Dynamic Event Tree Approach Level III Milestone

Conventional Event-Tree (ET) based methodologies are extensively used as tools to perform reliability and safety assessment of complex and critical engineering systems. One of the disadvantages of these methods is that timing/sequencing of events and system dynamics are not explicitly accounted for in the analysis. In order to overcome these limitations several techniques, also know as Dynamic Probabilistic Risk Assessment (DPRA), have been developed. Monte-Carlo (MC) and Dynamic Event Tree (DET) are two of the most widely used D-PRA methodologies to perform safety assessment of Nuclear Power Plants (NPP). In the past two years, the Idaho National Laboratory (INL) has developed its own tool to perform Dynamic PRA: RAVEN (Reactor Analysis and Virtual control ENvironment). RAVEN has been designed to perform two main tasks: 1) control logic driver for the new Thermo-Hydraulic code RELAP-7 and 2) post-processing tool. In the first task, RAVEN acts as a deterministic controller in which the set of control logic laws (user defined) monitors the RELAP-7 simulation and controls the activation of specific systems. Moreover, the control logic infrastructure is used to model stochastic events, such as components failures, and perform uncertainty propagation. Such stochastic modeling is deployed using both MC and DET algorithms. In the second task, RAVEN processes the large amount of data generated by RELAP-7 using data-mining based algorithms. This report focuses on the analysis of dynamic stochastic systems using the newly developed RAVEN DET capability. As an example, a DPRA analysis, using DET, of a simplified pressurized water reactor for a Station Black-Out (SBO) scenario is presented.

97 MATHEMATICS AND COMPUTING↗

RAVEN. Dynamic Event Tree Approach Level III Milestone

Conventional Event-Tree (ET) based methodologies are extensively used as tools to perform reliability and safety assessment of complex and critical engineering systems. One of the disadvantages of these methods is that timing/sequencing of events and system dynamics are not explicitly accounted for in the analysis. In order to overcome these limitations several techniques, also know as Dynamic Probabilistic Risk Assessment (DPRA), have been developed. Monte-Carlo (MC) and Dynamic Event Tree (DET) are two of the most widely used D-PRA methodologies to perform safety assessment of Nuclear Power Plants (NPP). In the past two years, the Idaho National Laboratory (INL) has developed its own tool to perform Dynamic PRA: RAVEN (Reactor Analysis and Virtual control ENvironment). RAVEN has been designed to perform two main tasks: 1) control logic driver for the new Thermo-Hydraulic code RELAP-7 and 2) post-processing tool. In the first task, RAVEN acts as a deterministic controller in which the set of control logic laws (user defined) monitors the RELAP-7 simulation and controls the activation of specific systems. Moreover, the control logic infrastructure is used to model stochastic events, such as components failures, and perform uncertainty propagation. Such stochastic modeling is deployed using both MC and DET algorithms. In the second task, RAVEN processes the large amount of data generated by RELAP-7 using data-mining based algorithms. This report focuses on the analysis of dynamic stochastic systems using the newly developed RAVEN DET capability. As an example, a DPRA analysis, using DET, of a simplified pressurized water reactor for a Station Black-Out (SBO) scenario is presented.

42 ENGINEERING↗

Fully-Coupled Thermo-Electrical Modeling and Simulation of Transition Metal Oxide Memristors

Transition metal oxide (TMO) memristors have recently attracted special attention from the semiconductor industry and academia. Memristors are one of the strongest candidates to replace flash memory, and possibly DRAM and SRAM in the near future. Moreover, memristors have a high potential to enable beyond-CMOS technology advances in novel architectures for high performance computing (HPC). The utility of memristors has been demonstrated in reprogrammable logic (cross-bar switches), brain-inspired computing and in non-CMOS complementary logic. Indeed, the potential use of memristors as logic devices is especially important considering the inevitable end of CMOS technology scaling that is anticipated by 2025. In order to aid the on-going Sandia memristor fabrication effort with a memristor design tool and establish a clear physical picture of resistance switching in TMO memristors, we have created and validated with experimental data a simulation tool we name the Memristor Charge Transport (MCT) Simulator.

97 MATHEMATICS AND COMPUTING↗

Graph Theory and IC Component Design Analysis

Graph analysis in large integrated circuit (IC) designs is an essential tool for verifying design logic and timing via dynamic timing analysis (DTA). IC designs resemble graphs with each logic gate as a vertex and the conductive connections between gates as edges. Using DTA digital statistical correlations, graph condensation, and graph partitioning, it is possible to identify high-entropy component centers and paths within an IC design. Identification of high-entropy component centers (HECC) enables focused DTA, effectively lowering the computational complexity of DTA on large integrated circuit graphs. In this paper, a devised methodology termed IC layout subgraph component center identification (CCI) is used to identify described. CCI lowers DTA computationally complexity by condensing IC graphs into reduced subgraphs in which dominant logic functions are verified.

42 ENGINEERING↗

Basic Energy Sciences Roundtable: Opportunities for Quantum Computing in Chemical and Materials Sciences

Fundamental transformations in the basic logic of computing are few and far between. Since the invention of digital computers in the early 1940s, the logic underlying computation has remained the same, even as computing hardware evolved from vacuum tubes to silicon transistors. With the advent of quantum computation, a fundamental transformation is near. Quantum computation is based on a different type of logic: rather than being in one of the two states of a classical bit, a quantum bit or qubit can be in a superposition of two states simultaneously. Operations and measurements on these qubits obey the constraints of quantum mechanics. It is now understood that quantum computers have great power in principle to go beyond classical computers, but that not every application is well suited to implementation on quantum computers. For reasons explained in more detail in the Introduction, scientific problems in chemical and materials sciences are uniquely suited to take advantage of quantum computing in the relatively near future. Indeed, quantum computing offers the best hope to solve many of the most important and difficult problems in this field. For example, quantum materials, such as superconductors and complex magnetic materials, show novel kinds of ordered phases that are natural from the point of view of quantum mechanics but difficult to access via computation on classical computers. Quantum sensors based on solid materials are already widely used but could be greatly improved with insight from quantum computations, as could materials for information technologies. Quantum chemical dynamics is another example of a problem that is intrinsically well suited to studies on quantum computers. Applications of quantum chemical dynamics include catalysis, artificial photosynthesis, and other industrially important processes. Quantum computers exist in the laboratory and are beginning to exceed 50 qubits, which is roughly the size beyond which their behavior cannot be predicted or emulated on present-day classical supercomputers. While a quantum computer of 50 qubits is almost certainly not powerful enough to tackle the major scientific challenges in chemical and materials sciences, some of these major challenges start to become accessible with a few hundred qubits if error rates can be kept small. This roundtable was convened to ask how emerging quantum computers can be applied to major scientific problems in chemical and materials sciences, in light of Basic Energy Sciences’s leading role in these fields and the Department of Energy’s leading role in high-performance scientific computation more generally. The main outcome of the roundtable was a consensus that there are scientific problems of great importance on which emerging quantum computers have the potential for disruptive impact, and where comparable progress is unlikely to occur by other means.

36 MATERIALS SCIENCE↗

Parsimonious Inference Information-Theoretic Foundations for a Complete Theory of Machine Learning (CIS-LDRD Project 218313 Final Technical Report)

This work examines how we may cast machine learning within a complete Bayesian framework to quantify and suppress explanatory complexity from first principles. Our investigation into both the philosophy and mathematics of rational belief leads us to emphasize the critical role of Bayesian inference in learning well-justified predictions within a rigorous and complete extended logic. The Bayesian framework allows us to coherently account for evidence in the learned plausibility of potential explanations. As an extended logic, the Bayesian paradigm regards probability as a notion of degrees of truth. In order to satisfy critical properties of probability as a coherent measure, as well as maintain consistency with binary propositional logic, we arrive at Bayes' Theorem as the only justifiable mechanism to update our beliefs to account for empiracle evidence. Yet, in the machine learning paradigm, where explanations are unconstrained algorithmic abstractions, we arrive at a critical challenge: Bayesian inference requires prior belief. Conventional approaches fail to yield a consistent framework in which we could compare prior plausibility among the infinities of potential choices in learning architectures. The difficulty of articulating well-justified prior belief over abstract models is the provinence of memorization in traditional machine learning training practices. This becomes exceptionally problematic in the context of limited datasets, when we wish to learn justifiable predictions from only a small amount of data.

97 MATHEMATICS AND COMPUTING↗