Algebraic and Boolean Methods for SFQ Superconducting Circuits

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Collective spin excitations can propagate in magnetically ordered materials in the form of waves. These so-called spin waves (SWs) or magnons are promising for low-power beyond-CMOS information processing, which does not rely anymore on the lossy movement ...

The paper presents a novel DAG-aware Boolean rewriting algorithm for restructuring combinational logic before technology mapping. The algorithm, called window rewriting, repeatedly selects small parts of the logic and replaces them with more compact implem ...

In recent years, Boolean methods in logic synthesis have been drawing the attention of EDA researchers due to the continuous push to advance quality of results. Boolean methods require high computational cost, as they rely on complete functional properties ...

Logic synthesis is a key component of digital design and modern EDA tools; it is thus an essential instrument for the design of leading-edge chips and to push the limits of their performance. In the last decades, the electronic circuits community has evolv ...

Emerging reconfigurable nanotechnologies allow the implementation of self-dual functions with a fewer number of transistors as compared to traditional CMOS technologies. To achieve better area results for Reconfigurable Field-Effect Transistors (RFET)-base ...

Logic synthesis is a fundamental step in the realization of modern integrated circuits. It has traditionally been employed for the optimization of CMOS-based designs, as well as for emerging technologies and quantum computing. Recently, it found applicatio ...

Adiabatic quantum-flux-parametron (AQFP) circuits are a family of superconducting electronic (SCE) circuits that have recently gained growing interest due to their low-energy consumption, and may serve as alternative technology to overcome the down-scaling ...

Exact synthesis is a versatile logic synthesis technique with applications to logic optimization, technology mapping, synthesis for emerging technologies, and cryptography. In recent years, advances in SAT solving have lead to a heightened research effort ...

Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused ...

The growing importance of applications based on machine learning is driving the need to develop dedicated, energy-efficient electronic hardware. Compared with von Neumann architectures, which have separate processing and storage units, brain-inspired in-me ...

The increasing luminosity in HEP (High Energy Physics) colliders demands trigger systems to be more selective. First, more information from the detector is routed to the trigger system. Second, larger parts of this information are processed together. These ...

Harnessing quantum randomness for the generation of random numbers is an important concept crucial for information security and many other computer-related applications. Quantum random number generators (QRNGs) are evolving from bulky, slow, and expensive ...

Gallium Nitride (GaN) is one of the most promising materials for high frequency power switching due to its exceptional properties such as large saturation velocity, high carrier mobility, and high breakdown field strength. The high switching frequency of G ...

SAT-sweeping is a powerful method for simplifying logic networks. It consists of merging gates that are proven equivalent (up to complementation) by running simulation and SAT solving in synergy. SAT-sweeping is used in both verification and synthesis appl ...

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Chat with Graph Search

Magnonic crystals with reconfigurable magnetic defects for spin-based microwave electronics

Boolean Rewriting Strikes Back: Reconvergence- Driven Windowing meets Resynthesis

Extending Boolean Methods for Scalable Logic Synthesis

Data Structures and Algorithms for Logic Synthesis in Advanced Technologies

Preserving Self-Duality During Logic Synthesis for Emerging Reconfigurable Nanotechnologies

A Logic Synthesis Toolbox for Reducing the Multiplicative Complexity in Logic Networks

Algebraic and Boolean Optimization Methods for AQFP Superconducting Circuits

SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism

Three-Input Gates for Logic Synthesis

Logic-in-memory based on an atomically thin semiconductor

Low-Latency High-Bandwidth Circuit and System Design for Trigger Systems in High Energy Physics

Random flip-flop: adding quantum randomness to digital circuits for improved cyber security, artificial intelligence and more

Enhancement Mode Tri-gate GaN Power Devices and Logic Circuits

SAT-Sweeping Enhanced for Logic Synthesis