BDD based decomposition of logic functions with application to FPGA synthesis

Yung Te Lai, Massoud Pedram, Sarma B.K. Vrudhula

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

71 Scopus citations

Abstract

This paper presents a theory for (disjunctive and nondisjunctive function decomposition using the BDD representation of Boolean functions. Incompletely specified as well as multi-output Boolean functions are addressed as part of the general theory. A novel algorithm (based on an EVBDD representation)for generating the set of all bound variable that make the function decomposable is also presented. We compared our BDD-based decomposition procedure with existing implementations of the Roth-Karp procedure and obtained significant speed-ups.

Original languageEnglish (US)
Title of host publicationProceedings - Design Automation Conference
PublisherPubl by IEEE
Pages642-647
Number of pages6
ISBN (Print)0897915771
StatePublished - Jan 1 1993
Externally publishedYes
EventProceedings of the 30th ACM/IEEE Design Automation Conference - Dallas, TX, USA
Duration: Jun 14 1993Jun 18 1993

Publication series

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

Other

OtherProceedings of the 30th ACM/IEEE Design Automation Conference
CityDallas, TX, USA
Period6/14/936/18/93

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'BDD based decomposition of logic functions with application to FPGA synthesis'. Together they form a unique fingerprint.

  • Cite this

    Lai, Y. T., Pedram, M., & Vrudhula, S. B. K. (1993). BDD based decomposition of logic functions with application to FPGA synthesis. In Proceedings - Design Automation Conference (pp. 642-647). (Proceedings - Design Automation Conference). Publ by IEEE.