The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
기능 분해는 로직 합성의 필수 기술이며 특히 FPGA 설계에 중요합니다. Bertacco와 Damiani는 BDD(Binary Decision Diagram)를 사용하여 단순 분리 분해를 찾는 효율적인 알고리즘을 제안했습니다. 그러나 해당 알고리즘은 완전하지 않으며 모든 분해를 찾지 못합니다. 본 논문은 단순 분리 분해(simple disjoint decomposition)의 완전한 이론을 제시하고 BDD를 사용한 효율적인 알고리즘을 설명합니다.
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.
부
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
부
@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},}
부
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 -