A recursive paradigm to solve Boolean relations

被引：8
|
作者：
Bañeres, D [1 ]
Cortadella, J [1 ]
Kishinevsky, M [1 ]
机构：
[1] Univ Politecn Cataluna, Barcelona, Spain
来源：
41ST DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2004 | 2004年
关键词：
Boolean relations; decomposition; logic design;
D O I：
10.1145/996566.996687
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The experimental results show the applicability of the method and tangible improvements with regard to previous heuristic approaches.
引用
收藏
页码：416 / 421
页数：6
相关论文
共 50 条
12345