Efficient boolean matching algorithm for cell libraries

Qinghong Wu, Chien Yi Roger Chen, John M. Acken

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations

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 languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors
Editors Anon
PublisherIEEE Computer Society
Pages36-39
Number of pages4
StatePublished - 1994
Externally publishedYes
EventProceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors - Cambridge, MA, USA
Duration: Oct 10 1994Oct 12 1994

Other

OtherProceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors
CityCambridge, MA, USA
Period10/10/9410/12/94

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Wu, Q., Chen, C. Y. R., & Acken, J. M. (1994). Efficient boolean matching algorithm for cell libraries. In Anon (Ed.), Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors (pp. 36-39). IEEE Computer Society.