CMOS Logic Gates Based on the Minimum Theoretical Number of Transistor in Series

Schneider, Felipe Ribeiro; Reis, André I.; Ribas, Renato P.

doi:10.1109/norchp.2006.329250

Cited by 1 publication

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Experiments have been carried out to evaluate the efficiency of the proposed FC-MDC method to compute MDCs (compared to QMC-MDC [7][8]). The algorithms have been developed in C++ programming language, and test platform used was a Core2Duo 2.4 GHz with 4 GB RAM.…”

Section: Resultsmentioning

confidence: 99%

“…The FC-MDC method is compared to QMC-MDC method [7][8], which is a slightly modified version of the well-known QuineMcCluskey algorithm [9]. The QMC-MDC method presents some limitations related to the number of prime implicants of the functions, as it has to compute nearly all prime implicants, making it quite computing expensive in some cases.…”

Section: Discussionmentioning

confidence: 99%

“…This modification of the QMC was proposed by Schneider et al [7][8] and we will refer to this algorithm as the QMC-MDC [7][8]. It is important to notice that the QMC-MDC method will not return any kind of expression.…”

Section: Qmc-mdc Proceduresmentioning

confidence: 99%

“…The MDC of a logic function is related to the number of transistors in series in switch networks that implement the logic function. Schneider et al [7][8] have presented a method to compute MDCs, based on a modification of the Quine-McCluskey algorithm [9]. In the remaining of this paper, we will refer to this algorithm as the QMC-MDC [7][8].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient method to compute minimum decision chains of Boolean functions

Martins

Callegaro

Ribas

et al. 2011

Proceedings of the 21st Edition of the Great Lakes Symposium on Great Lakes Symposium on VLSI

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Resultsmentioning

confidence: 99%