Title of article :
An Algorithm for Minimizing of Boolean Functions Based on Graph DS
Author/Authors :
Nosrati، Masoud نويسنده Young Researchers Club, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran Nosrati, Masoud , Hariri، Mehdi نويسنده Department of Law, Eslam Abad Gharb Branch, Islamic Azad University, Eslam Abad Gharb, Iran Hariri, Mehdi
Issue Information :
روزنامه با شماره پیاپی سال 2011
Pages :
6
From page :
209
To page :
214
Abstract :
In this paper, we intend to introduce a new heuristic algorithm to apply maximum minimization to Boolean functions with normal SOP form. To implement the proposed algorithm, we use the graph data structure and define the adjacencies. Also, we demonstrate some conditions to achieve the maximum minimization. Through this paper, the problem of shared vertices in more than one adjacency is talked, and the solution is presented. Karnaugh map is used to clarify the matter.
Journal title :
World Applied Programming
Serial Year :
2011
Journal title :
World Applied Programming
Record number :
683347
Link To Document :
بازگشت