Loading...
Please wait, while we are loading the content...
Similar Documents
Zastosowanie hipergrafów w procesie selekcji implikantów prostych
| Content Provider | Semantic Scholar |
|---|---|
| Author | Wisniewski, Remigiusz Stefanowicz, Łukasz |
| Copyright Year | 2013 |
| Abstract | In the paper a new idea for the selection of prime implicants is proposed. The method is based on the two-level minimization process of the Boolean functions, according to the Quine-McCluskey approach. Initially, the set of prime implicants for the logic function ought to be calculated. Next, the selection process is applied to achieve the minimal formula. Such an operation is a typical covering problem and in general case it has exponential computational complexity. In the paper we propose a new prime implicants selection method. An idea is based on the hypergraph theory. The prime implicants table is formed as a selection hypergraph. If the selection hypergraph belongs to the Exact Transversal Hypergraph class (xt-class), the solution may be obtained in a polynomial time, which is not possible in a general case. The proposed method is illustrated by an example. All necessary steps are shown in order to apply the proposed selection algorithm to minimize an exemplary Boolean function. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.baztech-afe24be2-6da2-4248-b356-b1ba0e0055cf/c/Wisniewski_zastosowanie_PAK_11_2013.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
