An efficient algorithm finding simple disjoint decompositions using BDDs

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Functional decomposition is an essential technique of logic synthesis and is important especially for FPGA design. Bertacco and Damiani proposed an efficient algorithm finding simple disjoint decomposition using Binary Decision Diagrams (BDDs). However, their algorithm is not complete and does not find all the decompositions. This paper presents a complete theory of simple disjoint decomposition and describes an efficient algorithm using BDDs.

Original languageEnglish
Pages (from-to)2715-2724
Number of pages10
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE85-A
Issue number12
Publication statusPublished - Jan 1 2002

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'An efficient algorithm finding simple disjoint decompositions using BDDs'. Together they form a unique fingerprint.

  • Cite this