On the Complexity of the Port Assignment Problem for Binary Commutative Operators in High-Level Synthesis

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

A shortcut model is a low-order model that provides a simplified representation of a complex process, thereby enabling faster and more efficient analysis, design and optimization without the computational intensity of a full-scale model. For continuous dis ...

Synthesizability in generative molecular design remains a pressing challenge. Existing methods to assess synthesizability include heuristics-based metrics or retrosynthesis models which predict a synthetic pathway. By contrast, an explicit approach anchors ...

Integer linear programming (ILP) is an elegant approach to solve linear optimization problems, naturally described using integer decision variables. Within the context of physics-inspired machine learning (ML) applied to chemistry, we demonstrate the relev ...

Electronic devices play an irreplaceable role in our lives. With the tightening time to market, exploding demand for computing power, and continuous desire for smaller, faster, less energy-consuming, and lower-cost chips, computer-aided design for electron ...

Rapid single-flux quantum (RSFQ) is one of the most advanced and promising superconducting logic families, offering exceptional energy efficiency and speed. RSFQ technology requires delay registers (DFFs) and splitter cells to satisfy the path-balancing an ...

Today, the design of electronic systems is largely automated. The practice of using software automation technologies for the design of electronic hardware is commonly referred to as Electronic Design Automation (EDA). EDA comprises a large set of tools, fr ...

Reducing the number of AND gates plays a central role in many cryptography and security applications. We propose a logic synthesis algorithm and tool to minimize the number of AND gates in a logic network composed of AND, XOR, and inverter gates. Our appro ...

We develop a principled approach to end-to-end learning in stochastic optimization. First, we show that the standard end-to-end learning algorithm admits a Bayesian interpretation and trains a posterior Bayes action map. Building on the insights of this an ...

The study of the complexity of Boolean functions has recently found applications in logic synthesis and optimization algorithms, as for instance in logic rewriting. Previous works have focused on the minimum length of Boolean chains for functions up to 5 i ...

We present a synthesis framework to map logic networks into quantum circuits for quantum computing. The synthesis framework is based on lookup-table (urn networks, which play a key role in conventional logic synthesis. Establishing a connection between LUT ...

Today's rapid advances in quantum computing hardware call for scalable synthesis methods to map combinational logic represented as multi-level Boolean networks (e.g., an and inverter graph, AIG) to quantum circuits. Such synthesis process must yield revers ...

In this paper, we discuss recent advances in exact synthesis, considering both their efficient implementation and various applications in which they can he employed. We emphasize on solving exact synthesis through Boolean satisfiability (SAT) encodings. Di ...

Approximate logic synthesis is an emerging field that tolerates errors in the synthesized logic circuits for better optimization quality. Indeed, in many computing problems, the requirement of preserving the exact functionality either results in unnecessar ...

We present a multi-level logic refactoring algorithm based on exclusive sum-of-product (ESOP) expressions. ESOP expressions are two-level logic representation forms, similar to sum of -product (SOP) expressions. However, ESOPs use EXOR instead of OR operat ...

Logic synthesis is an important part of electronic design automation (EDA) flows, which enable the implementation of digital systems. As the design size and complexity increase, the data structures and algorithms for logic synthesis must adapt and improve ...

A central task in high-level synthesis is scheduling: the allocation of operations to clock cycles. The classic approach to scheduling is static, in which each operation is mapped to a clock cycle at compile-time, but recent years have seen the emergence o ...

One of the main goal of Artificial Intelligence is to develop models capable of providing valuable predictions in real-world environments. In particular, Machine Learning (ML) seeks to design such models by learning from examples coming from this same envi ...

In-memory computing devices, such as resistive RAMs, natively implement material implication or a variant of the majority-of-three operation called RM3. This operation generalizes material implication and has been used as target operation in sev ...

Herein we report a multi-zone, heating, ventilation and air-conditioning (HVAC) control case study of an industrial plant responsible for cooling a hospital surgery center. The adopted approach to guaranteeing thermal comfort and reducing electrical energy ...

Exact synthesis is the problem of finding logic networks that represent given Boolean functions and respect given constraints. With exact synthesis it is possible to find optimum networks, e.g., in size or depth; consequently, it primarily finds applicatio ...

On the Complexity of the Port Assignment Problem for Binary Commutative Operators in High-Level Synthesis

Chattez avec Graph Search

A shortcut model for batch distillation columns using pertinent effective factors

Directly optimizing for synthesizability in generative molecular design using retrosynthesis models

Integer Linear Programming for Unsupervised Training Set Selection in Molecular Machine Learning

Contemporary Logic Synthesis: with an Application to AQFP Circuit Optimization

Algebraic and Boolean Methods for SFQ Superconducting Circuits

SAT-Based Exact Synthesis for Multi-Level Logic Networks

Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications

End-to-End Learning for Stochastic Optimization: A Bayesian Perspective

The Complexity of Self-Dual Monotone 7-Input Functions

LUT-Based Hierarchical Reversible Logic Synthesis

Scaling-up ESOP Synthesis for Quantum Compilation

Practical Exact Synthesis

Logic Synthesis From Incomplete Specifications Using Disjoint Support Decomposition

Integrated ESOP Refactoring for Industrial Designs

Exploiting Satisfiability Solvers for Efficient Logic Synthesis

DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis

Predicting in Uncertain Environments: Methods for Robust Machine Learning

RM3 based logic synthesis

Experimental data-driven model predictive control of a hospital HVAC system during regular use

Exact Synthesis for Logic Synthesis Applications with Complex Constraints