Heuristic algorithm for the minimisation of generalised boolean functions
作者:
G.Caruso,
期刊:
IEE Proceedings E (Computers and Digital Techniques)
(IET Available online 1988)
卷期:
Volume 135,
issue 2
页码: 108-116
年代: 1988
DOI:10.1049/ip-e.1988.0015
出版商: IEE
数据来源: IET
摘要:
Generalised Boolean functions are useful in the design of programmable logic arrays. In this paper a heuristic algorithm suitable to minimise such functions is presented. The algorithm generates an irredundant cover by using a local approach to select generalised prime implicants. A benefit of such a method is that the preliminary generation of the set of all the generalised prime implicants is not required. Experimental results are presented, showing a favourable comparison with an already established minimisation algorithm as far as computing speed is concerned.
点击下载:
PDF
(1076KB)
返 回