Brian C. H. Turton. Extending Quine-McCluskey for Exclusive-Or Logic Synthesis. IEEE Transactions on Education, 39(1):81--85, February 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Towards Automated Evolutionary Design of Combinational.. - Coello, Christiansen.. (2001) (1 citation) (Correct)
.... Furthermore, once the prime implicants have been found, the algorithm needs to find the minimum set cover, which is known to be an NP complete problem [19] Also, although some authors have proposed extensions to the basic Quine McCluskey Procedure that allow to handle XOR gates (see for example [40]) in the original proposal (which we have used here) only the basic gates are allowed (AND, OR, NOT) and a human designer has to perform further refinements in order to introduce XOR gates into the circuit. Note that the algebraic simplification process depends entirely on one s familiarity ....
Brian C. H. Turton. Extending Quine-McCluskey for Exclusive-Or Logic Synthesis. IEEE Transactions on Education, 39(1):81--85, February 1996.
Use of Evolutionary Techniques to Automate the Design.. - Coello, Christiansen, .. (1999) (1 citation) (Correct)
....find multi level forms, but requires human guidance to do so effectively. 4 Input Output Figure 1: A gate in a two dimensional template, gets its second input from either one of two gates in the previous column. basic Quine McCluskey Procedure that allow to handle XOR gates (see for example [19]) in the original proposal (which we have used here) only the basic gates are allowed (AND, OR, NOT) and a human designer has to perform further refinements in order to introduce XOR gates into the circuit. Note that the algebraic simplification process depends entirely on one s familiarity ....
Turton, B. C. H. (1996) Extending Quine-McCluskey for Exclusive-Or Logic Synthesis. IEEE Transactions on Education, 39, No. 1, pp. 81--85. 21
Towards Automated Evolutionary Design of Combinational.. - Coello, Christiansen.. (2001) (1 citation) (Correct)
.... Furthermore, once the prime implicants have been found, the algorithm needs to find the minimum set cover, which is known to be an NP complete problem [15] Also, although some authors have proposed extensions to the basic Quine McCluskey Procedure that allow to handle XOR gates (see for example [31]) in the original proposal (which we have used here) only the basic gates are allowed (AND, OR, NOT) and a human designer has to perform further refinements in order to introduce XOR gates into the circuit. Note that the algebraic simplification process depends entirely on one s familiarity ....
Brian C. H. Turton. Extending Quine-McCluskey for Exclusive-Or Logic Synthesis. IEEE Transactions on Education, 39(1):81--85, February 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC