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

Fingerprint

Binary decision diagrams
Decision Diagrams
Disjoint
Efficient Algorithms
Binary
Decomposition
Decompose
Logic Synthesis
Field Programmable Gate Array
Field programmable gate arrays (FPGA)

All Science Journal Classification (ASJC) codes

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

Cite this

@article{bae4649f4d4e4887b71a41f3a6b747d4,
title = "An efficient algorithm finding simple disjoint decompositions using BDDs",
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.",
author = "Yusuke Matsunaga",
year = "2002",
month = "1",
day = "1",
language = "English",
volume = "E85-A",
pages = "2715--2724",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - An efficient algorithm finding simple disjoint decompositions using BDDs

AU - Matsunaga, Yusuke

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0037001587&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037001587&partnerID=8YFLogxK

M3 - Article

VL - E85-A

SP - 2715

EP - 2724

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 12

ER -