Efficient method to compute minimum decision chains of Boolean functions

Authors:
Mayler G.A. Martins;Vinicius Callegaro;Renato P. Ribas;Andre I. Reis
Affiliations:
UFRGS, Porto Alegre - RS, Brazil;UFRGS, Porto Alegre - RS, Brazil;UFRGS, Porto Alegre - RS, Brazil;UFRGS, Porto Alegre - RS, Brazil
Venue:
Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
Year:
2011

Citing 5
Cited 1

Factoring and recognition of read-once functions using cographs and normality

Proceedings of the 38th annual Design Automation Conference
BOOM: a heuristic boolean minimizer

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Exact lower bound for the number of switches in series to implement a combinational logic cell

ICCD '05 Proceedings of the 2005 International Conference on Computer Design
DAG based library-free technology mapping

Proceedings of the 17th ACM Great Lakes symposium on VLSI
An improvement on the complexity of factoring read-once Boolean functions

Discrete Applied Mathematics

Efficient transistor-level design of CMOS gates

Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI

Quantified Score

Hi-index	0.00

Visualization

Abstract

Every Boolean function has a unique property called Minimum Decision Chain (MDC). This paper proposes an effective way to compute this property for arbitrary functions. The proposed method is very efficient when compared to a more direct and intuitive approach, that is used as the reference for performance analysis. Different examples have been evaluated, and the results are discussed. The proposed method is able to compute the MDC value in order of milliseconds, allowing the use of MDC computation to guide logic synthesis algorithms.