IEICE TRANSACTIONS on Fundamentals
An Efficient Algorithm Finding Simple Disjoint Decompositions Using BDDs
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.12 pp.2715-2724
- Publication Date
- 2002/12/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
- Category
- Logic Synthesis
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yusuke MATSUNAGA, "An Efficient Algorithm Finding Simple Disjoint Decompositions Using BDDs" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 12, pp. 2715-2724, December 2002, doi: .
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_12_2715/_p
Copy
@ARTICLE{e85-a_12_2715,
author={Yusuke MATSUNAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Algorithm Finding Simple Disjoint Decompositions Using BDDs},
year={2002},
volume={E85-A},
number={12},
pages={2715-2724},
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.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - An Efficient Algorithm Finding Simple Disjoint Decompositions Using BDDs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2715
EP - 2724
AU - Yusuke MATSUNAGA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2002
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.
ER -
English
