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 条

[1] Disjoint support decompositions from BDDs through symbolic kernels
Plaza, Stephen
Bertacco, Valeria
ASP-DAC 2005: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2005, : 276 - 279
[2] An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments
Li, Nan
Jiang, Bo
Li, Nannan
PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND APPLICATION ENGINEERING (CSAE2018), 2018,
[3] A simple, efficient algorithm for maximum finding on rings
Higham, L
Przytycka, T
INFORMATION PROCESSING LETTERS, 1996, 58 (06) : 319 - 324
[4] A SIMPLE, EFFICIENT ALGORITHM FOR MAXIMUM FINDING ON RINGS
HIGHAM, L
PRZYTYCKA, T
DISTRIBUTED ALGORITHMS, 1993, 725 : 249 - 263
[5] Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks
Zhang, Kejia
Gao, Hong
INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2013, 13 (03) : 173 - 184
[6] A simple and efficient RWA algorithm based on priority of edge disjoint paths
Yim, Soon-Bin
Chung, Min Young
Choo, Hyunseung
Lee, Tae-Jin
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 2, 2006, 3981 : 1121 - 1130
[7] Finding compact BDDs using genetic programming
Kuehne, Ulrich
Drechsler, Nicole
APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2006, 3907 : 308 - 319
[8] AN EFFICIENT ALGORITHM FOR FINDING THE CSG REPRESENTATION OF A SIMPLE POLYGON
DOBKIN, D
GUIBAS, L
HERSHBERGER, J
SNOEYINK, J
ALGORITHMICA, 1993, 10 (01) : 1 - 23
[9] A simple linear-time algorithm for finding path-decompositions of small width
Cattell, K
Dinneen, MJ
Fellows, MR
INFORMATION PROCESSING LETTERS, 1996, 57 (04) : 197 - 203
[10] A faster algorithm for finding disjoint paths in grids
Chan, WT
Chin, FYL
Ting, HF
ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 393 - 402

← 1 2 3 4 5 →