DocumentCode
1118742
Title
Minimization of Switching Functions—A Fast Technique
Author
Sureshchander
Author_Institution
Department of Electrical Engineering, Pant College of Technology
Issue
7
fYear
1975
fDate
7/1/1975 12:00:00 AM
Firstpage
753
Lastpage
756
Abstract
An algorithm is presented in this correspondence which will generate only those prime implicants (PI´s) which are essential or necessary for a minimal sum of products (the technique can be extended for product of sums form also) of a given switching function —iven all the minterms. This algorithm eliminates the neces-sity of finding out all the PI´s.
Keywords
Consensus, DON´T CARE term, literal, minimal sum, minterm, prime implicant, product-i, product-0, subcube.; Minimization methods; Consensus, DON´T CARE term, literal, minimal sum, minterm, prime implicant, product-i, product-0, subcube.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1975.224298
Filename
1672891
Link To Document