Loading...
Please wait, while we are loading the content...
Similar Documents
Minimization of Switching Functions using Quine-McCluskey Method
| Content Provider | Semantic Scholar |
|---|---|
| Author | Manojlovic, Vladislav |
| Copyright Year | 2013 |
| Abstract | The minimization of switching functions is important to reduce the original number of logic gates required to implement digital logic circuits. Quine-McCluskey algorithm is classical method for simplifying these functions which can handle any number of variables. This paper presents Quine-McCluskey algorithm for minimizing switching functions, with additional specific elements, such as starting part (that is decoding DNF form) and cost of circuit. An example of implementation of the algorithm is given too. |
| Starting Page | 12 |
| Ending Page | 16 |
| Page Count | 5 |
| File Format | PDF HTM / HTML |
| DOI | 10.5120/14103-2127 |
| Volume Number | 82 |
| Alternate Webpage(s) | https://www.ijcaonline.org/archives/volume82/number4/14103-2127?format=pdf |
| Alternate Webpage(s) | http://research.ijcaonline.org/volume82/number4/pxc3892127.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |