This book provides broad and comprehensive coverage of the entire EDA flow. EDA/VLSI practitioners and researchers in need of fluency in an" adjacent" field will find this an …
We present a collection of modular open source C++ libraries for the development of logic synthesis applications. These libraries can be used to develop applications for the design of …
We propose effective algorithms for exact synthesis of Boolean logic networks using satisfiability modulo theories (SMTs) solvers. Since exact synthesis is a difficult problem, it …
S Carpov, P Dubrulle, R Sirdey - … of the 3rd International Workshop on …, 2015 - dl.acm.org
In this work we present Armadillo a compilation chain used for compiling applications written in a high-level language (C++) to work on encrypted data. The back-end of the compilation …
H Riener, W Haaswijk, A Mishchenko… - … , Automation & Test …, 2019 - ieeexplore.ieee.org
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 …
Given a set of logic primitives and a Boolean function, exact synthesis finds the optimum representation (eg, depth or size) of the function in terms of the primitives. Due to its high …
A Mishchenko, R Brayton, JHR Jiang… - ACM Transactions on …, 2011 - dl.acm.org
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability. The proposed resynthesis (a) is capable of substantial logic …
Y Zha, J Li - 2020 ACM/IEEE 47th Annual International …, 2020 - ieeexplore.ieee.org
Associative processing (AP) is a promising PIM paradigm that overcomes the von Neumann bottleneck (memory wall) by virtue of a radically different execution model. By decomposing …
Secure two-party computation has witnessed significant efficiency improvements in the recent years. Current implementations of protocols with security against passive adversaries …