Simplification of Switching Functions Involving a very Large Number of ‘Don't Care’ States†
作者:
SUNILRANJAN DAS,
K. K. ROY,
A. K. CHOUDHURY,
期刊:
International Journal of Control
(Taylor Available online 1966)
卷期:
Volume 3,
issue 1
页码: 17-28
ISSN:0020-7179
年代: 1966
DOI:10.1080/00207176608921362
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
A method of simplification of switching functions involving a very large number of ‘ don't care’ states is suggested in the present paper. First a tabular technique is suggested which generates all the prime implicants starting from the maxterm type expressions of switching functions, avoiding generation of the prime implicants formed of ‘don't care’ states only. The technique presented is simple and iterative. Next it is suggested how the knowledge of the sets of prime implicants thus obtained can be utilized for finding minimal or other irredundant sums of switching functions.
点击下载:
PDF (226KB)
返 回