SEARCH · Engineering Papers

Results for “hardware algorithms”

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 1,603 records · Page 89

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Error mitigation, optimization, and extrapolation on a trapped-ion testbed

Current noisy intermediate-scale quantum (NISQ) trapped-ion devices are subject to errors which can significantly impact the accuracy of calculations if left unchecked. A form of error mitigation called zero noise extrapolation (ZNE) can decrease an algorithm’s sensitivity to these errors without increasing the number of required qubits. Here we explore different methods for integrating this error mitigation technique into the Variational Quantum Eigensolver (VQE) algorithm for calculating the ground state of the HeH + molecule at 0.8 Å in the presence of experimental noise. Using the Quantum Scientific Computing Open User Testbed (QSCOUT) trapped-ion device, we test three methods of scaling noise for extrapolation: time stretching the two-qubit gates, scaling the sideband detuning parameter, and inserting two-qubit gate identity operations into the ansatz circuit. We find that time stretching and sideband detuning scaling fail to scale the noise on our particular hardware in a way that can be extrapolated to zero noise. Scaling our noise with global gate identity insertions and extrapolating after variational optimization, we achieve error suppression of 96.8%, resulting in an energy estimate within –0.004 ± 0.04 hartree of the ground state energy. This is an improvement, but still outside the chemical accuracy threshold of 0.0016 hartree. Furthermore, our results show that the efficacy of this error mitigation technique depends on choosing the correct implementation for a given device architecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Gauge-fixing quantum density operators at scale

We provide a theory, algorithms, and simulations of nonequilibrium quantum systems using a one-dimensional (1D) completely positive (CP), matrix-product (MP) density-operator (𝜌) representation. By generalizing the matrix product state's orthogonality center, to additionally store positive classical mixture correlations, the MP⁢𝜌 factorization naturally emerges. In this setting, we analytically and numerically examine the virtual gauge freedoms associated with the representation of quantum density operators. Based on this perspective, we simplify algorithms in certain limits to speed up the integration of the canonical-form master-equation dynamics. This enables us to quickly evolve under the dynamics of two-body quantum channels without resorting to optimization-based methods. In addition to this technical advance, we also scale up numerical examples and discuss implications for accurately modeling hardware architectures and predicting their performance in the near term. This includes an example of the quantum to classical transition of informationally leaky, i.e., decohering, qubits. In this setting, because of loss from environmental interactions, nonlocal complex coherence correlations are converted into global incoherent classical statistical mixture correlations. Lastly, the representation of both global and local correlations is discussed. We expect this work to have applications in additional nonequilibrium settings, beyond qubit engineering.

Gangapuram, Amit Jamadagni [Oak Ridge National Lab↗

DOE OSTI2023

TiltEM User Manual

The ability to automate the scanning transmission electron microscope (S/TEM) is tantamount to addressing next generation artificial intelligence, machine learning, and materials modeling capabilities. Constant utilization of these high-end capital equipment purchases also serves the requirements of the Department of Energy (DOE) to be fiscally responsible to the public. The development of an automated multi-modal tilt series algorithm for dark field/bright field S/TEM imaging plus chemical identification with energy dispersive x-ray spectroscopy has been achieved at PNNL. A tilt series workflow has now been generated which allows for autonomous collection of imaging and compositional information simultaneously. This advancement is due in large part to a transition from the rigid and microscope specific JEOL hardware environment, to the more adaptable GMS environment. This has thereby led to a greater degree of flexibility in the application of this method across platforms in addition to substantial time savings to the user.

47 OTHER INSTRUMENTATION↗

DOE OSTI2025

Data Structure Alchemy

In an increasingly more data-driven world, the project set out to uncover the first principles of data-structure design, chart the immense design space they form, and build automation that can synthesize an optimal structure, or even a whole storage engine, for any given workload, hardware platform, and cost target. Data structures are at the center of every computational system and are directly responsible for its performance. Two core technical thrusts were defined: 1) Mapping design spaces for key data-centric abstractions (filters, hash functions, storage-engine layouts, neural-network topologies, blockchain protocols, image layouts, etc.). 2) Developing search & synthesis algorithms, initially analytical cost models, later neural-guided bi-level optimisers that navigate sextillions of candidate designs in seconds and materialise the best one as ready‐to-run code. This report distills the key insights, accomplishments, and impact.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1991

Using a focal-plane array to estimate antenna pointing errors

The use of extra collecting horns in the focal plane of an antenna as a means of determining the Direction of Arrival (DOA) of the signal impinging on it, provided it is within the antenna beam, is considered. Our analysis yields a relatively simple algorithm to extract the DOA from the horns' outputs. An algorithm which, in effect, measures the thermal noise of the horns' signals and determines its effect on the uncertainty of the extracted DOA parameters is developed. Both algorithms were implemented in software and tested in simulated data. Based on these tests, it is concluded that this is a viable approach to the DOA determination. Though the results obtained are of general applicability, the particular motivation for the present work is their application to the pointing of a mechanically deformed antenna. It is anticipated that the pointing algorithm developed for a deformed antenna could be obtained as a small perturbation of the algorithm developed for an undeformed antenna. In this context, it should be pointed out that, with a deformed antenna, the array of horns and its associated circuitry constitute the main part of the deformation-compensation system. In this case, the pointing system proposed may be viewed as an additional task carried out by the deformation-compensation hardware.

Zohar, S.↗

NASA NTRS1994

Technology transfer and evaluation for Space Station telerobotics

The international space station (SS) must take advantage of advanced telerobotics in order to maximize productivity and safety and to reduce maintenance costs. The Automation and Robotics Division at the NASA Lyndon B. Johnson Space Center (JSC) has designed, developed, and constructed the Automated Robotics Maintenance of Space Station (ARMSS) facility for the purpose of transferring and evaluating robotic technology that will reduce SS operation costs. Additionally, JSC had developed a process for expediting the transfer of technology from NASA research centers and evaluating these technologies in SS applications. Software and hardware system developed at the research centers and NASA sponsored universities are currently being transferred to JSC and integrated into the ARMSS for flight crew personnel testing. These technologies will be assessed relative to the SS baseline, and, after refinements, those technologies that provide significant performance improvements will be recommended as upgrades to the SS. Proximity sensors, vision algorithms, and manipulator controllers are among the systems scheduled for evaluation.

Price, Charles R.↗

NASA NTRS2005

Adaptable Constrained Genetic Programming: Extensions and Applications

An evolutionary algorithm applies evolution-based principles to problem solving. To solve a problem, the user defines the space of potential solutions, the representation space. Sample solutions are encoded in a chromosome-like structure. The algorithm maintains a population of such samples, which undergo simulated evolution by means of mutation, crossover, and survival of the fittest principles. Genetic Programming (GP) uses tree-like chromosomes, providing very rich representation suitable for many problems of interest. GP has been successfully applied to a number of practical problems such as learning Boolean functions and designing hardware circuits. To apply GP to a problem, the user needs to define the actual representation space, by defining the atomic functions and terminals labeling the actual trees. The sufficiency principle requires that the label set be sufficient to build the desired solution trees. The closure principle allows the labels to mix in any arity-consistent manner. To satisfy both principles, the user is often forced to provide a large label set, with ad hoc interpretations or penalties to deal with undesired local contexts. This unfortunately enlarges the actual representation space, and thus usually slows down the search. In the past few years, three different methodologies have been proposed to allow the user to alleviate the closure principle by providing means to define, and to process, constraints on mixing the labels in the trees. Last summer we proposed a new methodology to further alleviate the problem by discovering local heuristics for building quality solution trees. A pilot system was implemented last summer and tested throughout the year. This summer we have implemented a new revision, and produced a User's Manual so that the pilot system can be made available to other practitioners and researchers. We have also designed, and partly implemented, a larger system capable of dealing with much more powerful heuristics.

Janikow, Cezary Z.↗

NASA NTRS2007

Low-Thrust Control of a Lunar Mapping Orbit

A method is presented for generating and maintaining a lunar mapping orbit using continuous low-thrust hardware. Optimal control theory is used to maintain a lunar orbit that is low-altitude, near-polar, and Sun-synchronous; three typical requirements for a successful lunar mapping mission. The analysis of the optimal control problem leads to the commonly seen two-point boundary value problem, which is solved using a simple indirect shooting algorithm. Simulations are presented for a 50-day mapping duration, in which it is shown that a very tight control is achieved with thrust levels below 1 N for a 1000 kg spacecraft. A straightforward approach for using the method presented to compute missions of any duration is also discussed.

Harl, Nathan↗

DOE OSTI2023

Quantum simulations of SO(5) many-fermion systems using qudits

The structure and dynamics of many-body systems are the result of a delicate interplay between underlying interactions. Fermionic pairing, for example, plays a central role in various physical systems, ranging from condensed matter to nuclear systems, where it can lead to collective phenomena such as superconductivity and superfluidity. In atomic nuclei, the interplay between pairing and particle-hole interactions leads to a high degree of complexity and intricate entanglement structures. Despite this apparent complexity, symmetries emerge and manifest themselves in observable regular patterns. These symmetries and their breakings have long been used to determine relevant degrees of freedom and simplify classical descriptions of many-body systems. Here, this work explores the potential utility of quantum computers with arrays of qudits in simulating interacting fermionic systems, when the qudits can naturally map the relevant degrees of freedom determined by an underlying symmetry group. The Agassi model of fermions interacting via particle-hole and pairing interactions is based on an underlying so(5) algebra. Such systems can intuitively be partitioned into pairs of modes with five basis states, which thus naturally map to arrays of d = 5 qudits (qu5its). Classical noiseless simulations of the time evolution of systems with up to twelve qu5its are performed, by implementing quantum circuits that are developed herein, using PYTHON codes invoking Google's CIRQ software. The resource requirements of the qu5it circuits are analyzed and compared with two different mappings to qubit systems: a physics-aware Jordan-Wigner mapping requiring four qubits per mode pair and a state-to-state mapping requiring three qubits per mode pair. While the dimensionality of Hilbert spaces in mappings to qu5it systems are less than those for the corresponding qubit systems, the number of entangling operations, depending on the available hardware, can either be greater or smaller than for the physics-aware Jordan-Wigner mapping. The state-to-state mapping, while having a smaller Hilbert space than Jordan-Wigner mappings, appears to be the least efficient in gate counts. Further, a previously unknown sign problem has been identified from Trotterization errors in time evolving high-energy excitations. There appear to be advantages in employing quantum computers with arrays of qudits to perform simulations of many-body dynamics that exploit the role of underlying symmetries, specifically in lowering the required quantum resources and in reducing anticipated errors that take the simulation out of the physical space. If the necessary entangling gates are not directly supported by the hardware, physics-aware mappings to qubits may, however, be advantageous for other aspects.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS2016

Performance Analysis of a Hardware Implemented Complex Signal Kurtosis Radio-Frequency Interference Detector

In the field of microwave radiometry, Radio Frequency Interference (RFI) consistently degrades the value of scientific results. Through the use of digital receivers and signal processing, the effects of RFI on scientific measurements can be reduced depending on certain circumstances. As technology allows us to implement wider band digital receivers for radiometry, the problem of RFI mitigation changes. Our work focuses on finding a detector that outperforms real kurtosis in wide band scenarios. The algorithm implemented is a complex signal kurtosis detector which was modeled and simulated. The performance of both complex and real signal kurtosis is evaluated for continuous wave, pulsed continuous wave, and wide band quadrature phase shift keying (QPSK) modulations. The use of complex signal kurtosis increased the detectability of interference.

microwaves↗

DOE OSTI2023

Comparative study of adaptive variational quantum eigensolvers for multi-orbital impurity models

Hybrid quantum-classical embedding methods for correlated materials simulations provide a path towards potential quantum advantage. However, the required quantum resources arising from the multi-band nature of d and f electron materials remain largely unexplored. Here we compare the performance of different variational quantum eigensolvers in ground state preparation for interacting multi-orbital embedding impurity models, which is the computationally most demanding step in quantum embedding theories. Focusing on adaptive algorithms and models with 8 spin-orbitals, we show that state preparation with fidelities better than 99.9% can be achieved using about 2 14 shots per measurement circuit. When including gate noise, we observe that parameter optimizations can still be performed if the two-qubit gate error lies below 10 -3 , which is slightly smaller than current hardware levels. Finally, we measure the ground state energy on IBM and Quantinuum hardware using a converged adaptive ansatz and obtain a relative error of 0.7%.

42 ENGINEERING↗

DOE OSTI2021

Coding the Computing Continuum: Fluid Function Execution in Heterogeneous Computing Environments

Advances in network technologies have greatly decreased barriers to accessing physically distributed computers. This newfound accessibility coincides with increasing hardware specialization, creating exciting new opportunities to dispatch workloads to the best resource for a specific purpose, rather than those that are closest or most easily accessible. We present Delta, a service designed to intelligently schedule function-based workloads across a distributed set of heterogeneous computing resources. Delta implements an extensible architecture in which different predictors and scheduling algorithms can be integrated to provide dynamically evolving estimates of function execution times on different resources-estimates that can be used to determine the most appropriate location for execution. We describe predictors for function runtime, data transfer time, and cold-start resource provisioning and configuration delay; dynamic learning methods that update predictor models over time; and scheduling strategies that take into account both function and endpoint information. We show that these methods can halve workload makespan when compared with a strategy that selects the fastest resource, and decrease makespan by a factor of five when compared to a round robin strategy, when deployed on a heterogeneous testbed with resources ranging from a Raspberry Pi to a GPU node in an academic cloud.

Computing continuum↗

NASA NTRS1977

The robot's eyes - Stereo vision system for automated scene analysis

Attention is given to the robot stereo vision system which maintains the image produced by solid-state detector television cameras in a dynamic random access memory called RAPID. The imaging hardware consists of sensors (two solid-state image arrays using a charge injection technique), a video-rate analog-to-digital converter, the RAPID memory, and various types of computer-controlled displays, and preprocessing equipment (for reflexive actions, processing aids, and object detection). The software is aimed at locating objects and transversibility. An object-tracking algorithm is discussed and it is noted that tracking speed is in the 50-75 pixels/s range.

Williams, D. S.↗

NASA NTRS1994

Local performance optimization for a class of redundant eight-degree-of-freedom manipulators

Local performance optimization for joint limit avoidance and manipulability maximization (singularity avoidance) is obtained by using the Jacobian matrix pseudoinverse and by projecting the gradient of an objective function into the Jacobian null space. Real-time redundancy optimization control is achieved for an eight-joint redundant manipulator having a three-axis spherical shoulder, a single elbow joint, and a four-axis spherical wrist. Symbolic solutions are used for both full-Jacobian and wrist-partitioned pseudoinverses, partitioned null-space projection matrices, and all objective function gradients. A kinematic limitation of this class of manipulators and the limitation's effect on redundancy resolution are discussed. Results obtained with graphical simulation are presented to demonstrate the effectiveness of local redundant manipulator performance optimization. Actual hardware experiments performed to verify the simulated results are also discussed. A major result is that the partitioned solution is desirable because of low computation requirements. The partitioned solution is suboptimal compared with the full solution because translational and rotational terms are optimized separately; however, the results show that the difference is not significant. Singularity analysis reveals that no algorithmic singularities exist for the partitioned solution. The partitioned and full solutions share the same physical manipulator singular conditions. When compared with the full solution, the partitioned solution is shown to be ill-conditioned in smaller neighborhoods of the shared singularities.

Williams, Robert L., II↗

NASA NTRS2019

Software and System Health Management with R2U2

R2U2 (Realizable, Responsive, Unobtrusive Unit) is a hardware-supported tool and framework for the real-time system and software health management of cyber-physical systems. R2U2 continuously monitors properties about safety, performance, and security of the vehicle and can perform diagnostic reasoning. Efficient observers for past-time and future-time Metric Temporal Logic, reasoners for Bayesian Networks, and model-based prognostics algorithms are major components of R2U2. Their combination makes it possible to design powerful models for system runtime monitoring, diagnostics, software health management, prognostics, and security monitoring. The R2U2 monitoring engine is designed for minimal runtime overhead and is available as Simulink block or as a software component for integration into the flight software stack, and enables R2U2 to monitor complex cyber-physical systems without any instrumentation of the flight software. In this presentation, we give an overview of R2U2 architecture and reasoning algorithms, present its features, and give a life demo of the tool.

Schumann, Johann↗

NASA NTRS2002

On Polymorphic Circuits and Their Design Using Evolutionary Algorithms

This paper introduces the concept of polymorphic electronics (polytronics) - referring to electronics with superimposed built-in functionality. A function change does not require switches/reconfiguration as in traditional approaches. Instead the change comes from modifications in the characteristics of devices involved in the circuit, in response to controls such as temperature, power supply voltage (VDD), control signals, light, etc. The paper illustrates polytronic circuits in which the control is done by temperature, morphing signals, and VDD respectively. Polytronic circuits are obtained by evolutionary design/evolvable hardware techniques. These techniques are ideal for the polytronics design, a new area that lacks design guidelines, know-how,- yet the requirements/objectives are easy to specify and test. The circuits are evolved/synthesized in two different modes. The first mode explores an unstructured space, in which transistors can be interconnected freely in any arrangement (in simulations only). The second mode uses a Field Programmable Transistor Array (FPTA) model, and the circuit topology is sought as a mapping onto a programmable architecture (these experiments are performed both in simulations and on FPTA chips). The experiments demonstrated the synthesis. of polytronic circuits by evolution. The capacity of storing/hiding "extra" functions provides for watermark/invisible functionality, thus polytronics may find uses in intelligence/security applications.

Stoica, Adrian↗

DOE OSTI2021

Optimized AC/DC Dual Active Bridge Converter using Monolithic SiC Bidirectional FET (BiDFET) for Solar PV Applications

Grid interface power conversion systems for commercial, industrial and residential solar power generation are becoming ubiquitous due to the competitive cost of solar energy. The AC/DC dual active bridge (DAB) converter is an upcoming topology in industrial PV energy and energy storage applications, providing bidirectional power transfer and galvanic isolation. In this paper, the properties of a DAB-type converter are leveraged to propose a design optimization process. It can optimize the high-frequency RMS current, size of magnetic elements and zero-voltage-switching (ZVS) region of the converter. The resulting design is compared against that derived from a conventional approach. In addition, an algorithm to compute the harmonic currents at the DC and line frequency AC ports of the system is proposed, and the respective filter designs are presented. The optimized design of the AC/DC DAB converter is implemented using the newly developed, 1200 V, 46 mΩ, four quadrant, SiC-based monolithic bidirectional FETs (BiDFET). Experimental results from the 2.3 kW, 400V/277VRMS hardware prototype are finally presented to verify the design process.

Bidirectional isolated AC-DC conversion, solar ene↗

NASA NTRS1999

Optical Properties of Aerosols from Long Term Ground-Based Aeronet Measurements

AERONET is an optical ground-based aerosol monitoring network and data archive supported by NASA's Earth Observing System and expanded by federation with many non-NASA institutions including AEROCAN (AERONET CANada) and PHOTON (PHOtometrie pour le Traiteinent Operatonnel de Normalisation Satellitaire). The network hardware consists of identical automatic sun-sky scanning spectral radiometers owned by national agencies and universities purchased for their own monitoring and research objectives. Data are transmitted hourly through the data collection system (DCS) on board the geostationary meteorological satellites GMS, GOES and METEOSAT and received in a common archive for daily processing utilizing a peer reviewed series of algorithms thus imposing a standardization and quality control of the product data base. Data from this collaboration provides globally distributed near real time observations of aerosol spectral optical depths, aerosol size distributions, and precipitable water in diverse aerosol regimes. Access to the AERONET data base has shifted from the interactive program 'demonstrat' (reserved for PI's) to the AERONET homepage allowing faster access and greater development for GIS object oriented retrievals and analysis with companion geocoded data sets from satellites, LIDAR and solar flux measurements for example. We feel that a significant yet under utilized component of the AERONET data base are inversion products made from hourly principal plane and almucanter measurements. The current inversions have been shown to retrieve aerosol volume size distributions. A significant enhancement to the inversion code has been developed and is presented in these proceedings.

Holben, B. N.↗