Abstract
An efficient algorithm for searching for functional cells based on Boolean matching in a large library is presented. Redundant variables and permutation of inputs are considered in this algorithm. The algorithm does a search in constant time independent of the size of the library.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors |
Editors | Anon |
Publisher | IEEE Computer Society |
Pages | 36-39 |
Number of pages | 4 |
State | Published - 1994 |
Externally published | Yes |
Event | Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors - Cambridge, MA, USA Duration: Oct 10 1994 → Oct 12 1994 |
Other
Other | Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors |
---|---|
City | Cambridge, MA, USA |
Period | 10/10/94 → 10/12/94 |
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering