Quality of Minimal Sets of Prime Implicants of Boolean Functions

• Autorzy: Prasad V. C.

Identyfikatory

DOI

10.1515/eletel-2017-0022

• Języki publikacji: EN

Abstrakty

EN

Two new problems are posed and solved concerning minimal sets of prime implicants of Boolean functions. It is well known that the prime implicant set of a Boolean function should be minimal and have as few literals as possible. But it is not well known that min term repetitions should also be as few as possible to reduce power consumption. Determination of minimal sets of prime implicants is a well known problem. But nothing is known on the least number of (i) prime implicants (ii) literals and (iii) min term repetitions , any minimal set of prime implicants will have. These measures are useful to assess the quality of a minimal set. They are then extended to determine least number of prime implicants / implicates required to design a static hazard free circuit. The new technique tends to give smallest set of prime implicants for various objectives.

Słowa kluczowe

EN

logic circuits; digital circuits; Boolean functions; minimal sets

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2017
• Tom: Vol. 63, No. 2
• Strony: 165--169
• Opis fizyczny: Bibliogr. 6 poz.

Twórcy

autor

Prasad V. C.

• Dayalbagh Educational Institute, Dayalbagh, India (Retired from Indian Institute of Technology, Delhi)

Bibliografia

• [1] D. D. Givone, “Digital Principles and Design”, International Edition, Mc Graw-Hill, New York, 2003
• [2] Z. Kohavi and N. K. Jha,“Switching and Finite Automata Theory”, Cambridge University Press, New York, 2010, www.ambridge.org/9780521857482
• [3] A. B. Marcovitz, “Introduction to logic design”, International Edition, Mc Graw-Hill, New York, 2002.
• [4] S. Minato, “Fast generation of prime irredundant covers from Binary decision Diagrams”, IEICE Trans. Fundamentals, Vol. E 76 – A, No. 6, pp. 967-973, June 1993
• [5] V. C. Prasad, “Simplification of incompletely specified sequential machines”, Journal of Electrical Engineering and Electronic Technology (JEET), Vol. 4, doi: 10.4172/2325-9833, 1000114, Sept.,2015
• [6] V. C. Prasad, “Efficient minimization of Boolean functions”, International Journal Of Electrical Engineering Education, Vol. 45/4, pp. 321-327, Oct. 2008

Uwagi

PL

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).