Restructuring logic representations with easily detectable simple disjunctive decompositions

Authors:
H. Sawada;S. Yamashita;A. Nagoya
Affiliations:
NTT Communication Science Laboratories, 2-2 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-02, JAPAN;NTT Communication Science Laboratories, 2-2 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-02, JAPAN;NTT Communication Science Laboratories, 2-2 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-02, JAPAN
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
1998

Citing 6
Cited 3

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
BDD based decomposition of logic functions with application to FPGA synthesis

DAC '93 Proceedings of the 30th international Design Automation Conference
Detection of symmetry of Boolean functions represented by ROBDDs

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Technology Mapping via Transformations of Function Graphs

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Restricted Simple Disjunctive Decompositions Based on Grouping Symmetric Variables

GLS '97 Proceedings of the 7th Great Lakes Symposium on VLSI

Constructive library-aware synthesis using symmetries

DATE '00 Proceedings of the conference on Design, automation and test in Europe
An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
A BDD-based fast heuristic algorithm for disjoint decomposition

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced variable. This paper presents that many simple disjunctive decompositions can be found easily by detecting symmetric variables or checking variable cofactors. We also propose an algorithm that constructs a new logic representation for a simple disjunctive decomposition by assigning constant values to variables in the original representation. The algorithm enables us to apply the decomposition with keeping good structures of the original representation. We have performed experiments to restructure fanout free cones of multi-level logic circuits, and obtained better results than when not restructuring them.