Fast analysis of the minimal decision algorithm from non-unate loops of the Karnaugh map

Extending to multiple-output logic functions, the similarity between the two-input MUX network and the binary decision tree and progressively analysing the pairs of loops created by splitting the Karnaugh map, leads to a simple expression for the number of tests at any level. This number is related...

Full description

Saved in:
Bibliographic Details
Published in:International journal of electronics 1985-07, Vol.59 (1), p.97-105
Main Authors: KHALID-NACIRI, A., BECHAR, H., LOTFI, Z., TOSSER, A. J.
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Extending to multiple-output logic functions, the similarity between the two-input MUX network and the binary decision tree and progressively analysing the pairs of loops created by splitting the Karnaugh map, leads to a simple expression for the number of tests at any level. This number is related to the number of non-unate loops, i.e. the loops receiving different states, that appear at any step of the splitting procedure; duplicates are also identified on the Karnaugh map and a graphical criterion for the minimal number of tests is found. Examples are presented.
ISSN:0020-7217
1362-3060
DOI:10.1080/00207218508920682