ATPG-based logic synthesis: an overview
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
SPFD-based effective one-to-many rewiring (OMR) for delay reduction of LUT-based FPGA circuits
Proceedings of the 14th ACM Great Lakes symposium on VLSI
A transduction-based framework to synthesize RSFQ circuits
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Minimizing FPGA Reconfiguration Data at Logic Level
ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
Logic synthesis and circuit customization using extensive external don't-cares
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Customizing IP cores for system-on-chip designs using extensive external don't-cares
Proceedings of the Conference on Design, Automation and Test in Europe
Sequential logic rectifications with approximate SPFDs
Proceedings of the Conference on Design, Automation and Test in Europe
A fast SPFD-based rewiring technique
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Improvements on efficiency and efficacy of SPFD-based rewiring for LUT-based circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.03 |
In this paper, we propose a unique way to express functional flexibility by using sets of pairs of functions called “Sets of Pairs of Functions to be Distinguished” (SPFDs) rather than traditional incompletely specified functions. This method was very naturally derived from a unique concept for distinguishing two logic functions, which we explain in detail in this paper. The flexibility represented by an SPFD assumes that the internal logic of a node in a circuit can be freely changed, SPFDs make good use of this assumption, and they can express larger flexibility than incompletely specified functions in some cases. Although the main subject of this paper is to explain the concept of SPFDs, we also present an efficient method for calculating the functional flexibilities by SPFDs because the concept becomes useful only if there is an efficient calculation method for it. Moreover, we present a method to use SPFDs for circuit transformation along with a proof of the correctness of the method, We further make a comparison between SPFDs and compatible sets of permissible functions (CSPFs), which express functional flexibility by incompletely specified functions. As an application of SPFDs, we show a method to optimize LUT (look-up table) networks and experimental results