PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Morreale E. Recursive operators for prime implicant and irredundant normal form determination. In: IEEE Transactions on Computers, vol. 19 pp. 504 - 509. 1970.
 
 
Abstract
(English)
A common recursive formulation is presented for determining: 1) all the prime implicants, and 2) an irredundant normal form of any completely or incompletely specified Boolean function given in canonical form. Formulas for specific operators Pi and lrr2 solving these problems are given and recursive partitioned list algorithms are described for them. The solution of both of the above problems through recursive partitioned list algorithms is significantly faster than through the corresponding nonrecursive algorithms.
Subject Boolean functions
incompletely specified
irredundant normal form
minimization
multioutput functions


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional