Skip to main navigation Skip to search Skip to main content

Characterization of boolean functions for rapid matching in EPGA technology mapping

  • Technical University of Munich

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

This paper introduces characteristic signatures for Boolean functions. The signatures do not exhibit sensitivity to permutations of input variables. We use these signatures to develop a method of rapidly matching subcircuits with cells in a (large) library. The procedure is analogous to hashing. This approach promises significant improvements for library matching with large libraries, for example in EPGA technology mapping.

Original languageEnglish
Title of host publicationProceedings - Design Automation Conference
PublisherPubl by IEEE
Pages374-379
Number of pages6
ISBN (Print)0818628227
StatePublished - 1992
EventProceedings of the 29th ACM/IEEE Design Automation Conference - Anaheim, CA, USA
Duration: 8 Jun 199212 Jun 1992

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0146-7123

Conference

ConferenceProceedings of the 29th ACM/IEEE Design Automation Conference
CityAnaheim, CA, USA
Period8/06/9212/06/92

Fingerprint

Dive into the research topics of 'Characterization of boolean functions for rapid matching in EPGA technology mapping'. Together they form a unique fingerprint.

Cite this