Concept
Table de Karnaugh
Publications associées (31)
Scalable Logic Rewriting Using Don’t Cares
Giovanni De Micheli, Alessandro Tempia Calvino
Logic rewriting is a powerful optimization technique that replaces small sections of a Boolean network with better implementations. Typically, exact synthesis is used to compute optimum replacement on-the-fly, with possible support for Boolean don't cares. ...
2024DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis
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 ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022On-the-fly and DAG-aware: Rewriting Boolean Networks with Exact Synthesis
Giovanni De Micheli, Mathias Soeken, Heinz Riener, Winston Jason Haaswijk
The paper presents a generalization of DAG-aware AIG rewriting for k-feasible Boolean networks, whose nodes are k-input lookup tables (k-LUTs). We introduce a high-effort DAG-aware rewriting algorithm, called cut rewriting, which uses exact synthesis to co ...
IEEE2019Spherical Network Visualizations
Data visualization is a recent domain that founds his roots in the eighties, but its history dates back to more ancient times in other representations such as diagrams, drawings, or maps. In particular, data visualization is hard to take advantage of the h ...
2019