Computing Minimum Decision Chains of Boolean Functions

Mayler G. A. MartinsVinicius CallegaroRenato P. RibasAndré I. Reis

Every Boolean function has a unique property called Minimum Decision Chain (MDC). This paperproposes 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.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: