|Table of Contents|

Research on Simplification Algorithm of Logical Functions with Computer(PDF)

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2003年04期
Page:
405-408
Research Field:
Publishing date:

Info

Title:
Research on Simplification Algorithm of Logical Functions with Computer
Author(s):
ZhuYoulian
Department of Electronic Information Engineering, Jiangsu Teachers College of Technology,Changzhou 213001
Keywords:
logic function simplificat ion prime implicantsminimal cover
PACS:
TP301
DOI:
-
Abstract:
Computer simplification of logic functions has shortcomings of complicated operation, large memory and low speed, etc. This paper uses an improved repetition-inclusion algorithm to find the essential prime implicants, to determine the minimal cover with the chooser principle, and to process the cyclical functions. Results show that new algorithm can reduce memory, accelerate speed, and increase the application range. The algorithm has a broad application in EDA.

References:

1 鲍家元. 数字逻辑[M] . 北京, 高等教育出版社, 1997. 68~ 87.
2 Victor P N. Digital logic circuit analysis and design[M] . 北京: 清华大学出版社, 1995. 68~ 87.
3 杨之廉. 超大规模集成电路设计方法学导论[M] . 北京: 清华大学出版社, 1999. 90~ 106.

Memo

Memo:
-
Last Update: 2013-03-17