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 条

[21] Finding all simple disjunctive decompositions using irredundant sum-of-products forms
Minato, S
De Micheli, G
1998 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN: DIGEST OF TECHNICAL PAPERS, 1998, : 111 - 117
[22] A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
Bader, David A.
Burkhardt, Paul
Journal of Graph Algorithms and Applications, 2022, 26 (04): : 577 - 588
[23] Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph
Nepomniaschaya, Anna
PARALLEL COMPUTING TECHNOLOGIES, 2011, 6873 : 182 - 191
[24] AN EFFICIENT MINIMIZING ALGORITHM FOR SUM OF DISJOINT PRODUCTS
ZHAO, LC
XU, JC
MICROELECTRONICS AND RELIABILITY, 1995, 35 (08): : 1157 - 1162
[25] An Efficient Approximate Algorithm for Disjoint QoS Routing
Yu, Zhanke
Ma, Feng
Liu, Jingxia
Hu, Bingxin
Zhang, Zhaodong
MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
[26] Efficient algorithms for finding the maximum number of disjoint paths in grids
Chan, WT
Chin, FYL
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 34 (02): : 337 - 369
[27] An algorithm for finding two edge-disjoint paths in tournaments
Nakayama, S
Masuyama, S
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (12) : 2672 - 2678
[28] A localized algorithm for finding disjoint paths in wireless sensor networks
Hou, Ronghui
Shi, Haoshan
IEEE COMMUNICATIONS LETTERS, 2006, 10 (12) : 807 - 809
[29] Efficient algorithm for transversal of disjoint convex polygons
Chin, FYL
Wang, FL
INFORMATION PROCESSING LETTERS, 2002, 83 (03) : 141 - 144
[30] A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths
Guo, Longkun
Deng, Yunyun
Liao, Kewen
He, Qiang
Sellis, Timos
Hu, Zheshan
PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 1456 - 1462

← 1 2 3 4 5 →