An efficient algorithm finding simple disjoint decompositions using BDDs

被引：0

作者：

Matsunaga, Y ^{[1
]}

机构：

[1] Kyushu Univ, Grad Sch Informat Sci & Elect Engn, Dept Comp Sci & Commun Engn, Kasuga, Fukuoka 8168580, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2002年 / E85A卷 / 12期

关键词：

functional decomposition; BDDs; logic synthesis; FPGA;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：2715 / 2724

页数：10

共 50 条

[31] Finding Good Linear Codes Using a Simple Extension Algorithm
Han, Sunghyu
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (10) : 6729 - 6733
[32] Efficient combinational verification using BDDs and a hash table
Mukherjee, R
Jain, J
Takayama, K
Fujita, M
Abraham, JA
Fussell, DS
ISCAS '97 - PROCEEDINGS OF 1997 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I - IV: CIRCUITS AND SYSTEMS IN THE INFORMATION AGE, 1997, : 1025 - 1028
[33] Evaluating Abductive Hypotheses using an EM Algorithm on BDDs
Inoue, Katsumi
Sato, Taisuke
Ishihata, Masakazu
Kameya, Yoshitaka
Nabeshima, Hidetomo
21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 810 - 815
[34] Simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations
Univ of Electro-Communications, Chofu, Japan
Systems and Computers in Japan, 1997, 28 (05) : 60 - 67
[35] Finding unusual correlation using matrix decompositions
Skillicorn, DB
INTELLIGENCE AND SECURITY INFORMATICS, PROCEEDINGS, 2004, 3073 : 83 - 99
[36] An evidential clustering algorithm by finding belief-peaks and disjoint neighborhoods
Gong, Chaoyu
Su, Zhi-gang
Wang, Pei-hong
Wang, Qian
PATTERN RECOGNITION, 2021, 113
[37] An algorithm for finding two node-disjoint paths in arbitrary graphs
Karaata M.H.
Journal of Computing and Information Technology, 2019, 27 (03) : 1 - 14
[38] An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube
Qiu, Ke
PROCEEDINGS OF THE 2008 14TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, : 43 - 47
[39] A GPU parallel algorithm for finding a negative subset disjoint cycle in a graph
Sielski, Piotr
Corduk, Akif
Linsenmaier, Hugo
Fender, Alex
2023 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE, HPEC, 2023,
[40] An Optimal Algorithm for Finding Disjoint Rectangles and Its Application to PCB Routing
Kong, Hui
Ma, Qiang
Yan, Tan
Wong, Martin D. F.
PROCEEDINGS OF THE 47TH DESIGN AUTOMATION CONFERENCE, 2010, : 212 - 217

← 1 2 3 4 5 →