Exact SAT-based Toffoli Network Synthesis
|
|
- Noreen Holland
- 5 years ago
- Views:
Transcription
1 Eact SAT-based Toffoli Network Synthesis ABSTRACT Daniel Große Institute of Computer Science University of Bremen Bremen, Germany Gerhard W. Dueck Faculty of Computer Science University of New Brunswick Fredericton, NB, Canada E3B 5A3 Compact realizations of reversible logic functions are of interest in the design of quantum computers. Such reversible functions are realized as a cascade of Toffoli gates. In this paper, we present the first eact synthesis algorithm for reversible functions using generalized Toffoli gates. Our iterative algorithm formulates the synthesis problem with d Toffoli gates as a sequence of Boolean Satisfiability (SAT) instances. Such an instance is satisfiable iff there eists a network representation with d gates. Thus, we can guarantee minimality. In addition to fully specified reversible functions, the algorithm can be applied to incompletely specified functions. For a set of benchmarks eperimental results are given. Categories and Subject Descriptors B6.3 [Design Aids]: Automatic synthesis General Terms Design, Theory Keywords Reversible Logic, Quantum Circuits, Synthesis, Minimization, Boolean Satisfiability 1. INTRODUCTION Reversible logic attracted high attention in the area of low-power design, optical computing and quantum comput- This work was done while Gerhard W. Dueck was visiting the University of Bremen. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. GLSVLSI 7, March 11 13, 27, Stresa-Lago Maggiore, Italy. Copyright 27 ACM /7/3...$5.. Xiaobo Chen Institute of Computer Science University of Bremen Bremen, Germany shoppo@informatik.unibremen.de Rolf Drechsler Institute of Computer Science University of Bremen Bremen, Germany drechsle@informatik.unibremen.de ing. Hence synthesis of reversible logic has become a very important research topic in the last years. In contrast to synthesis with traditional irreversible gates there are two main restrictions for reversible gates: fan-out and feed-back are not allowed. Consequently a network for reversible logic consists of a cascade of reversible gates. The most frequently used gate type is the Toffoli gate [14] which will also be used in this paper. The idea of this gate is to invert one input line (the target line) if the product of a set of control lines evaluates to true. For the synthesis of reversible logic several approaches have been proposed. In [13] the authors presented an approach based on enumeration and using network equivalences to rewrite a limited set of gates. Other synthesis procedures use heuristics like e.g. spectral techniques [1], positive polarity Reed-Muller epansions [4], or transformation based synthesis [11]. In [9] the authors propose a method that synthesizes the reversible function in a first step and then based on transformations (using so called templates) a realization with fewer gates is computed. An eact synthesis method based on reachability analysis is described in [5]. However, this procedure is geared towards quantum gates, not Toffoli gates. In this paper we present the first eact algorithm for Toffoli synthesis of a reversible function 1. Our method uses an iterative algorithm that is based on Boolean Satisfiability (SAT). Hence we can compute a minimal solution in the sense that we can prove that there is no network realization with fewer gates. The rest of the paper is structured as follows. Section 2 presents the background on reversible logic and Toffoli gates. Furthermore SAT is briefly reviewed. In Section 3 the eact synthesis algorithm is introduced. Eperimental results are provided in Section 4. Finally, the paper is summarized. 2. PRELIMINARIES 2.1 Reversible Logic A reversible logic gate is a n-input n-output function that maps each possible input vector to a unique output vector. 1 Preliminary results have been presented in [3].
2 Figure 1: Toffoli gate eample In other words this function is a bijection. Many reversible gates have been studied. Generalized Toffoli gates [14] are widely used. In the rest of this paper we only consider Toffoli gates that are defined as follows: Definition 1. Let X := { 1,..., n} be the set of domain variables. A generalized Toffoli gate has the form T OF (C, t), where C = { i1,..., ik } X is the set of control lines and t = { j} with C t = is the target line. The gate maps ( 1,..., n) to ( 1,..., j 1, j i1... ik, j+1,..., n). An eample for the Toffoli gate T OF ({ 1, 2}, { 4}) is shown in Figure 1. This gate maps ( 1, 2, 3, 4) to ( 1, 2, 3, 4 1 2). The network is drawn in standard notation (see e.g. [12]). Due to restrictions in quantum mechanics as network topology only a cascade structure can be used. This structure is simply a number of Toffoli gates in a cascade. Definition 2. The reversible cost (or simply, cost) of an implementation of a reversible function f is defined as the number of gates in the network representation that realizes f. The goal of this paper is to provide an algorithm for optimal synthesis of a reversible function, i.e. computing the minimal number of gates for a reversible function. The proposed approach is based on Boolean Satisfiability which is described in the following. 2.2 SAT The Boolean Satisfiability problem (SAT) is defined as follows: Definition 3. Let h be a Boolean function in Conjunctive Normal Form (CNF), i.e. a product-of-sum representation. Then the SAT problem is to determine whether there eists an assignment to the variables of h such that h evaluates to true or to prove that no such assignment eists. SAT is one of the central NP-complete problems. In fact, it was the first known NP-complete problem which was proven by Cook in 1971 [1]. Today SAT is not only used in theorem proving, but in many application domains like automatic test pattern generation, logic synthesis, and verification. In the last ten years significant improvements have been made in the area of SAT solvers. Several powerful tools have been developed that make use of Boolean constraint propagation and efficient learning techniques to speed up the proof process (see e.g. [2]). Here we briefly review the terms that are used in the contet of SAT. A literal is a either a variable or its negation. A clause is a disjunction of literals and a CNF consists of a conjunction of clauses. depth w 1 1 w Figure 2: Variables in S 2 with n = 3, d = 2 and i = Eample 1. Let h = ( )( 1 + 3)( 2 + 3). Then 1 = 1, 2 = 1 and 3 = 1 is a satisfying assignment for h. The values of 1 and 2 ensure that the first clause becomes 1 while 3 ensures this for the remaining two clauses. 3. EXACT SYNTHESIS ALGORITHM In this section we present the eact synthesis algorithm for reversible logic based on SAT. The basic idea is to check if there eists a Toffoli gate representation for the function with d gates, where d is increased in the net iteration if no realization is found. We first describe a formulation of the synthesis problem with d gates as a Boolean formula. Then, we provide the steps for the transformation of the Boolean formula info a CNF representation. Finally the overall flow of the eact algorithm is presented in detail. 3.1 Boolean Formulation For a reversible function the synthesis problem is epressed as a Boolean function S d that is satisfiable iff there eists a Toffoli gate network representation of size d. Before the details for the function S d are provided the following definitions are given: Definition 4. Let f : B n B n be a reversible function. Then two variable vectors are defined: 1. k i = ( k in k i(n 1)... k i1) with i 2 n 1 and k d is a Boolean vector representing the input, temporary, or output variables at depth k for line i of the truth-table of f. The left side of the truth-table corresponds to the vector i, the right side to the vector d i, respectively. 2. w k = (w k log 2 (g)... w k 1 ) with k d 1 is a Boolean vector representing the chosen Toffoli gate at depth k. Here g denotes the number of different Toffoli gates in n variables. As an eample the variables in the Boolean formulation S d are shown for the parameters n = 3, d = 2 and i = in Figure 2. In this eample the reversible function has 3 input and 3 output variables, the truth-table has 2 3 = 8 lines and we are looking for realizations with d = 2 Toffoli gates. Remember that the figure only shows the variables for one line of the truth-table (here i = ). Furthermore the possible positions for the Toffoli gates are marked with dashed rectangles. In the following theorem the number of Toffoli gates in n variables is determined
3 Theorem 1. For a reversible function with n variables there eist n 2 n 1 different Toffoli gates. Proof. Since a Toffoli gate has eactly one target line there are n 1 lines left as possible control lines. Obviously each possible combination of control lines can be enumerated using the power set of {1,..., n 1}. In total there are n lines for a reversible function with n variables. So we get n 2 n 1 different Toffoli gates. Based on the previous definitions and considerations the Boolean formulation S d for the synthesis of the reversible function f : B n B n consists of the conjunction of the following three formulas 2 : 1. The input-/output constraints set the input/output pair of each line of the truth-table given by the reversible function f: 2 n 1 i= i = i d i = f(i) 2. The functional constraints for possible Toffoli gates that are chosen by an assignment to w k are: d 1 g 1 2 n 1 k= j= i= ( w k = j) ( k+1 i = t( k i, j)) These constraints ensure that if at depth k the Toffoli gate j is selected in line i the variables at depth k + 1 are computed from the variables at depth k with the Toffoli gate function t( k i, j). The function t( k i, j) is defined by enumerating all possible Toffoli gates with n variables. 3. The eclusion constraints ensure that illegal assignments to w k are ecluded since not all values of w k are necessary to enumerate all possible Toffoli gates: d 1 k= w k < g Obviously we have found a Boolean formulation for the synthesis problem of the reversible function f : B n B n with d generalized Toffoli gates that is satisfiable iff a network realization for f eists with eactly d gates. 3.2 CNF Formulation For the SAT-based synthesis algorithm we epress the Boolean formulation in terms of a CNF. In the following we discuss the construction of the three constraints as a CNF separately: 1. The input/output constraints can be mapped directly by the use of unit clauses, i.e. the the binary encoding for the value of each input/output vector is used to generate the corresponding clauses. 2. It is well known that by the introduction of new variables the CNF form for any Boolean formula can be produced in time and space linear in the size of the 2 For simplicity, natural numbers are identified with their corresponding binary encoding. (1) eactsynthesis(f : B n B n ) (2) /* f is given in form of a truth-table */ (3) found = false; (4) d = 1; (5) while (found == false) do (6) C = constructcnf(f, d); (7) r = callsatsolver(c); (8) if (r == satisfiable) then (9) /* synthesis result with cost d found */ (1) A = getassignment(); (11) EtractNetworkFromAssignment(A); (12) found = true; (13) else (14) /* no synthesis result with cost d */ (15) d = d + 1; (16) end if (17) end while Figure 3: Overall flow of eact synthesis algorithm original Boolean formula [6]. For the construction algorithm we first define methods for the simple logic functions like AND, OR, etc. that generate the corresponding clauses. Then we etended this scheme for more comple logic like equality of Boolean vectors. Based on a method that enumerates the different Toffoli gates, the functional constraints can be formulated in CNF. 3. The illegal assignments to w k are epressed by eplicitly enumerating all values that are not allowed in form of a blocking clause. E.g. if n = 3 we have = 3 4 = 12 different Toffoli gates. The vector w k has the length log 2(12) = 4. However for w k the values 12, 13, 14, 15 are illegal. E.g. for w we add the blocking clause (w 4 + w 3 + w2 + w1) to eclude the value 12 since this clause evaluates to false for the assignment w4 = 1, w3 = 1, w2 =, w1 =. 3.3 SAT-based Algorithm Based on the CNF formulation for the synthesis problem described in the previous section the overall algorithm is shown in Figure 3. The input for the algorithm is the reversible function f as a truth-table. At first the algorithm starts to find a network representation for f with cost 1, since d is initialized to 1. Then, in the while-loop for the current value of d the CNF C is constructed as described above. This CNF is given to a SAT solver an checked for satisfiability. If there eists a satisfying assignment for C a network representing f has been found. This network a cascade of Toffoli gates is etracted from the variables of w k and found is set to true to abort the main loop. If the CNF C is unsatisfiable d is increased which results in a new search with one more Toffoli gate. 3.4 Incompletely Specified Functions It is well known that many practical logic functions contain don t care conditions. That is, the output for certain input combination is irrelevant. Most traditional minimization algorithms take advantage of this condition. In order to make a function reversible, it is often necessary to add constant inputs and garbage outputs [8]. The garbage outputs are by definition don t cares.
4 Table 1: Embedding f = a b in a reversible function. c a b f g 1 g Table 2: Function f = a b with don t cares. c a b f g 1 g Eample 2. Consider the function f = a b. To make it reversible, we have to add a constant input c and two garbage outputs g 1 and g 2. A possible assignment is shown in Table 1. This is the optimal assignment, since it can be realized with a single Toffoli gate, namely T OF ({a, b}, {c}). However, not all functions are so easily embedded into a reversible function. It is advantageous to leave the don t care conditions unspecified as shown in Table 2. Given a non-reversible function with i input variables and o outputs, that is embedded in a reversible function with c constant inputs and g garbage outputs, then the number of unspecified entries in the truth-table is given by the following formula: (2 n 2 i ) n + g 2 i where n = i + c = g + o. For eample, the parameters for a full adder (listed as rd32 in Table 7 are: i = 3, o = 2, c = 1, and g = 2. The number of unspecified entries in the truth table are ( ) = 48. That is, 48 of the 64 entries in the truth table are don t cares. Clearly, the full adder is embedded in many different 4-input reversible function. Choosing the optimal embedding is nontrivial. Most algorithms that have been proposed for reversible logic synthesis start with a fully specified reversible function. No solution to the problem of finding an optimal or near-optimal embedding of a non-reversible function into a reversible one has been proposed. In our SAT-based procedure the finding of a proper embedding is not necessary the don t care outputs can be left unspecified. Table 3: Small eample b a b a Table 4: Synthesis results for small eample depth variables clauses time result UNSAT SAT UNSAT ,14.1 SAT ,376.1 SAT 6 5 1,648.1 SAT periments have been carried out on an AMD Athlon 35+ with 1 GB of main memory. In a first eperiment we tested our synthesis algorithm for a very small eample. The truth table of the reversible function is shown in Table 3. The function maps (b, a) to (a b, b). The result of our iterative SAT-based synthesis algorithm 3 is shown in Table 4. The first column gives the depth d for which the CNF is constructed and afterwards the SAT solver is called. The net two columns provide information on the variables and clauses used in the CNF formulation. In column time the CPU time for the current iteration in seconds is reported. Then, in the last column it is shown whether the CNF is satisfiable or not. As can be seen for this eample several SAT solutions have been found, i.e. there eists Toffoli networks with 2, 4, 5 and 6 gates. The different solutions are shown in Figure 4. For this simple eample it is remarkable that there eists a network realization with 2 gates but no realization with 3 gates. This eample already shows that in our SAT-based algorithm it is necessary to make a full search by incrementing the depth starting from 1. Starting with a large d and proving that there is no solution with d gates, we can not conclude that there is no solution with less than d gates. In a second eperiment we applied our synthesis algorithm to a number of benchmarks. First, we studied completely specified functions. The results are shown in Table 5. The first column provides the name of the reversible func- 3 For this eample we modified the algorithm to compute solutions up to depth EXPERIMENTAL RESULTS We have implemented the presented synthesis algorithm in C++. As a SAT solver we use MiniSat v1.14 [2]. All e- Figure 4: eample Different network realizations for small
5 Table 5: Results for complete specified functions name d vars clauses time res ham ,524.1 U 2 1,232 5,.2 U 3 1,836 7,476.6 U 4 2,44 9, U 5 3,44 12, S ,524.1 U 2 1,232 5,.2 U 3 1,836 7,476.7 U 4 2,44 9, U 5 3,44 12, U 6 3,648 14,94.46 S hwb4 1 3,91 17,632.3 U 2 7,756 35, U 3 11,62 52,64.28 U 4 15,448 7, U 5 19,294 87, U 6 23,14 15, U 7 26, , U 8 3,832 14, U 9 34, , U 1 38, , U 11 42,37 192, S mod5d1 1 22,47 15,88.22 U 2 44, , U 3 66,91 316, U 4 89, , U 5 111, , U 6 133, , U 7 155, , S graycode6 1 12, ,4 2.8 U 2 241,552 1,181, U 3 362,136 1,771, U 4 482,72 2,361, U 5 63,34 2,952, S tion. In column d the current depth is given. Again, in the following columns the information on the SAT instance, i.e. number of clauses and variables, are shown. The needed run time for each iteration in CPU seconds is reported in column time. Finally, in the last column it is shown whether the SAT instance is satisfiable or not. We provide a short description for each benchmark presented in the table. ham3 is a hamming optimal coding function. The specification of 3 17 can be found on [7]. hwb4 is the hidden weighted bit function of size 4. The mod5d1 function realizes the Grover s oracle and graycode6 computes the gray code. As can be seen for many of the benchmarks Toffoli networks of minimal size can be found fast. Since reversible functions have different levels of compleity and due to the heuristic nature of SAT solvers the run times for the benchmarks differ. From the perspective of SAT we can see that we have some hard SAT instances. E.g. for the satisfiable solution of the instance of hwb4 with depth 11 the run time of the SAT solver was very high. In contrast the result for graycode6 was computed very fast. The results for incompletely specified functions are shown in Table 6. Several options for embedding these functions Table 6: Results for incomplete specified functions name d vars clauses time res decod24-v 1 3,91 17,584.8 U 2 7,756 35,88.22 U 3 11,62 52, U 4 15,448 7, U 5 19,294 87,6 3.4 U 6 23,14 15, S decod24-v1 1 3,91 17,584.3 U 2 7,756 35,88.11 U 3 11,62 52, U 4 15,448 7,96.74 U 5 19,294 87,6 2.4 U 6 23,14 15, S decod24-v2 1 3,91 17,584.4 U 2 7,756 35,88.11 U 3 11,62 52, U 4 15,448 7,96.66 U 5 19,294 87, U 6 23,14 15, S decod24-v3 1 3,91 17,584.3 U 2 7,756 35,88.1 U 3 11,62 52, U 4 15,448 7,96.46 U 5 19,294 87, U 6 23,14 15, U 7 26, , S rd32a 1 3,91 17,584.8 U 2 7,756 35,88.22 U 3 11,62 52, U 4 15,448 7, S rd32b 1 3,91 17,584.3 U 2 7,756 35,88.11 U 3 11,62 52,592.4 U 4 15,448 7, U 5 19,294 87, S majority ,58.1 U 2 1,232 4,984.2 U 3 1,836 7,46.5 S 4mod5a 1 22,47 15, U 2 44, , U 3 66,91 316, U 4 89, , U 5 111, , S 4mod5b 1 22,47 15, U 2 44, , U 3 66,91 316, U 4 89, , U 5 111, , S ALUc 1 22,47 15,68.51 U 2 44, , U 3 66,91 316, U 4 89, , U 5 111, , U 6 133, , S into reversible ones are available. First, one can chose how to set the constant inputs. Second, there may be a choice
6 Table 7: Cost comparison of synthesis results function in c out g old src. SAT rd [9] 4 ham [9] [9] 6 hwb [7] 11 mod5d [7] 7 4mod [7] 5 decode [4] 6 graycode [4] 5 alu [4] 6 Figure 5: Realization of alu from [4] Figure 6: SAT optimized alu realization in where to place the garbage outputs. For eample, for the function decod24 [4] we can chose the values for the constant inputs from {, 1, 1, 11}. The results are shown as decod24-v to decod24-v3 in Table 6. It is apparent, that all four functions ehibit very similar properties, but for one the minimal Toffoli realization requires one more gate. It is therefore important to consider all possible assignments for the constant inputs. For the full adder rd32 we show the two eperiments where the constant was set to zero and one, respectively. As eplained it was not necessary to specify values for the garbage outputs since these are handled as don t cares. Due to page limitation we only show the eperiment for the best result obtained for alu (specification see [4]). For all benchmark results we give a comparison to the results reported in literature (see e.g. [9]). The comparison is shown in Table 7. The first column provides the name of the function. Columns labeled in and out give the number of inputs and outputs, respectively. Columns labeled c and g specify the number or constant inputs and garbage outputs (if the given function is reversible, then there are no garbage outputs). Column old gives the number of Toffoli gates in the previously best known result; the source is given in the net column. Finally, we show the size of our SAT-based result in the last column. We can prove that for some benchmarks minimal Toffoli gate networks have previously been found. For three functions we found a better solution than previously known; two of them are significantly better. The function mod5d1 (taken from [7]) does not have garbage outputs and the four inputs are also available as outputs. For this function the size of the network was reduced by one compared to the best known realization. For the benchmark functions decode42 and alu we achieved a reduction of 45% and 67%, respectively. This is due to two factors. First, we are able to find the minimal result. Second, there is no need to embed the non-reversible function in a reversible one. The second point seems to offer significant advantages. The two networks for alu are shown in Figure 5 and 6 (g denotes the garbage output). 5. CONCLUSIONS In this paper we presented an eact synthesis algorithm using generalized Toffoli gates for reversible logic functions. Our algorithm uses SAT techniques to find a network realization for the reversible function. We have demonstrated our synthesis algorithm on a set of benchmarks. On the one hand we were able to prove that synthesis results reported in literature are minimal in the number of Toffoli gates. On the other hand we showed that there eist network realizations with fewer gates for some functions. The algorithm takes full advantage of don t care conditions. 6. REFERENCES [1] S. Cook. The compleity of theorem proving procedures. In 3. ACM Symposium on Theory of Computing, pages , [2] N. Eén and N. Sörensson. An etensible SAT solver. In SAT 23, volume 2919 of LNCS, pages , 24. [3] D. Große, X. Chen, and R. Drechsler. Eact toffoli network synthesis of reversible logic using boolean satisfiability. In IEEE Dallas/CAS Workshop, pages 51 54, 26. [4] P. Gupta, A. Agrawal, and N. Jha. An algorithm for synthesis of reversible logic circuits. IEEE Trans. on CAD of Integrated Circuits and Systems, 25(11): , 26. [5] W. Hung, X. Song, G. Yang, J. Yang, and M. Perkowski. Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. on CAD of Integrated Circuits and Systems, 25(9): , 26. [6] T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Trans. on CAD, 11:4 15, [7] D. Maslov. Reversible Logic Synthesis Benchmarks Page. dmaslov/. [8] D. Maslov and G. W. Dueck. Reversible cascades with minimal garbage. IEEE Trans. on CAD of Integrated Circuits and Systems, 23(11): , 23. [9] D. Maslov, G. W. Dueck, and D. M. Miller. Toffoli network synthesis with templates. IEEE Trans. on CAD of Integrated Circuits and Systems, 24(6):87 817, 25. [1] D. M. Miller and G. W. Dueck. Spectral techniques for reversible logic synthesis. In 6th International Symposium on Representations and Methodology of Future Computing Technology, pages 56 62, 23. [11] D. M. Miller, D. Maslov, and G. W. Dueck. A transformation based algorithm for reversible logic synthesis. In Design Automation Conf., pages , 23. [12] M. A. Nielsen and I. Chuang. Quantum computation and quantum information. Cambridge University Press, 2. [13] V. Shende, A. Prasad, I. Markov, and J. Hayes. Reversible logic circuit synthesis. In Int l Conf. on CAD, pages pp , 22. [14] T. Toffoli. Reversible computing. In W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, page 632. Springer, 198. Technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci.
Reversible Logic Synthesis with Output Permutation
Please note: Methods introduced in this paper are availabe at www.revkit.org. Reversible Logic Synthesis with Output Permutation Robert Wille 1 Daniel Große 1 Gerhard W. Dueck 2 Rolf Drechsler 1 1 Institute
More informationQuantified Synthesis of Reversible Logic
Quantified Synthesis of Reversible Logic Robert Wille 1 Hoang M. Le 1 Gerhard W. Dueck 2 Daniel Große 1 1 Group for Computer Architecture (Prof. Dr. Rolf Drechsler) University of Bremen, 28359 Bremen,
More informationEquivalence Checking of Reversible Circuits
Please note: Methods introduced in this paper are availabe at wwwrevkitorg Equivalence Checking of Reversible Circuits Robert Wille Daniel Große D Michael Miller 2 Rolf Drechsler Institute of Computer
More informationSynthesizing Reversible Circuits for Irreversible Functions
Synthesizing Reversible Circuits for Irreversible Functions D. Michael Miller 1 Robert Wille 2 Gerhard W. Dueck 3 1 Department of Computer Science, University of Victoria, Canada 2 Group for Computer Architecture
More informationSynthesis of Fredkin-Toffoli Reversible Networks
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL.???, NO.???,??? 2004 1 Synthesis of Fredkin-Toffoli Reversible Networks Dmitri Maslov, Gerhard W. Dueck, Member, IEEE, and D. Michael
More informationReversible Function Synthesis with Minimum Garbage Outputs
Reversible Function Synthesis with Minimum Garbage Outputs Gerhard W. Dueck and Dmitri Maslov Faculty of Computer Science University of New Brunswick Fredericton, N.B. E3B 5A3 CANADA Abstract Reversible
More informationTwo-Qubit Quantum Gates to Reduce the Quantum Cost of Reversible Circuit
11 41st IEEE International Symposium on Multiple-Valued Logic Two-Qubit Quantum Gates to Reduce the Quantum Cost of Reversible Circuit Md. Mazder Rahman, Anindita Banerjee, Gerhard W. Dueck, and Anirban
More informationExploiting Reversibility in the Complete Simulation of Reversible Circuits
Exploiting Reversibility in the Complete Simulation of Reversible Circuits Robert Wille Simon Stelter Rolf Drechsler Institute of Computer Science, University of Bremen, 28359 Bremen, Germany Cyber-Physical
More informationImproved ESOP-based Synthesis of Reversible Logic
Improved ESOP-based Synthesis of Reversible Logic N. M. Nayeem Dept. of Math & Computer Science University of Lethbridge Lethbridge, AB, Canada noor.nayeem@uleth.ca J. E. Rice Dept. of Math & Computer
More informationA Compact and Efficient SAT Encoding for Quantum Circuits
A Compact and Efficient SAT Encoding for Quantum Circuits Robert Wille Nils Przigoda Rolf Drechsler Institute of Computer Science University of Bremen 8359 Bremen Germany Cyber-Physical Systems DFKI Gmb
More informationAutomatic Design of Low-Power Encoders Using Reversible Circuit Synthesis
Automatic Design of Low-Power Encoders Using Reversible Circuit Synthesis Robert Wille 1 Rolf Drechsler 1,2 Christof Osewold 3 Alberto Garcia-Ortiz 3,4 1 Institute of Computer Science, University of Bremen,
More informationReversible Circuit Synthesis of Symmetric Functions Using a Simple Regular Structure
Reversible Circuit Synthesis of Symmetric Functions Using a Simple Regular Structure Arighna Deb 1, Debesh K. Das 1, Hafizur Rahaman 2, Bhargab B. Bhattacharya 3, Robert Wille 4, Rolf Drechsler 4 1 Computer
More informationA Shared-cube Approach to ESOP-based Synthesis of Reversible Logic
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 16, April 24, xx-xx A Shared-cube Approach to ESOP-based Synthesis of Reversible Logic N. M. Nayeem and J. E. Rice Abstract: Reversible logic is being
More informationENERGY loss is an important consideration in digital design.
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 23, NO. 11, NOVEMBER 2004 1497 Reversible Cascades With Minimal Garbage Dmitri Maslov Gerhard W. Dueck, Member, IEEE
More informationTemplates for Positive and Negative Control Toffoli Networks
Templates for Positive and Negative Control Toffoli Networks Md Zamilur Rahman and Jacqueline E. Rice Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB, Canada {mdzamilur.rahman,j.rice}@uleth.ca
More informationSynthesis of Reversible Circuits for Large Reversible Functions
Portland State University PDXScholar Electrical and Computer Engineering Faculty Publications and Presentations Electrical and Computer Engineering 12-2010 Synthesis of Reversible Circuits for Large Reversible
More informationChecking Reversibility of Boolean Functions
Checking Reversibility of Boolean Functions Robert Wille 1,2, Aaron Lye 3, and Philipp Niemann 3 1 Institute for Integrated Circuits, Johannes Kepler University, A-4040 Linz, Austria 2 Cyber-Physical Systems,
More informationTechnical Report: Projects & Background in Reversible Logic
Technical Report: Projects & Background in Reversible Logic TR-CSJR1-2005 J. E. Rice University of Lethbridge j.rice@uleth.ca 1 Introduction - What is Reversible Logic? In order to discuss new trends and
More informationUSING AUTOCORRELATION COEFFICIENT-BASED COST FUNCTIONS IN ESOP-BASED TOFFOLOI GATE CASCADE GENERATION
USING AUTOCORRELATION COEFFICIENT-BASED COST FUNCTIONS IN ESOP-BASED TOFFOLOI GATE CASCADE GENERATION J. E. Rice University of Lethbridge Department of Mathematics & Computer Science Lethbridge, Alberta,
More informationOptimized Reversible Programmable Logic Array (PLA)
Journal of Advances in Computer Research Quarterly ISSN: 28-6148 Sari Branch, Islamic Azad University, Sari, I.R.Iran (Vol. 4, No. 1, February 213), Pages: 81-88 www.jacr.iausari.ac.ir Optimized Reversible
More informationIntegrated Synthesis of Linear Nearest Neighbor Ancilla-Free MCT Circuits
Integrated Synthesis of Linear Nearest Neighbor Ancilla-Free MCT Circuits Md Mazder Rahman 1, Gerhard W. Dueck 1, Anupam Chattopadhyay 2 and Robert Wille 3 1 Faculty of Computer Science, University of
More informationUSING SAT FOR COMBINATIONAL IMPLEMENTATION CHECKING. Liudmila Cheremisinova, Dmitry Novikov
International Book Series "Information Science and Computing" 203 USING SAT FOR COMBINATIONAL IMPLEMENTATION CHECKING Liudmila Cheremisinova, Dmitry Novikov Abstract. The problem of checking whether a
More informationGroup Theory Based Synthesis of Binary Reversible Circuits
Group Theory Based Synthesis of Binary Reversible Circuits Guowu Yang 1,XiaoyuSong 2, William N.N. Hung 2,FeiXie 1, and Marek A. Perkowski 2 1 Dept. of Computer Science, Portland State University, Portland,
More informationPropositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173
Propositional Logic CSC 17 Propositional logic mathematical model (or algebra) for reasoning about the truth of logical expressions (propositions) Logical expressions propositional variables or logical
More informationOn Application of Output Masking to Undetectable Faults in Synchronous Sequential Circuits with Design-for-Testability Logic
On Application of Output Masking to Undetectable Faults in Synchronous Sequential Circuits with Design-for-Testability Logic Irith Pomeranz 1 and Sudhakar M. Reddy 2 School of Electrical & Computer Eng.
More informationRealization of 2:4 reversible decoder and its applications
Realization of 2:4 reversible decoder and its applications Neeta Pandey n66pandey@rediffmail.com Nalin Dadhich dadhich.nalin@gmail.com Mohd. Zubair Talha zubair.talha2010@gmail.com Abstract In this paper
More informationSelf-Inverse Functions and Palindromic Circuits
Self-Inverse Functions and Palindromic Circuits Mathias Soeken 1,2 Michael Kirkedal Thomsen 1 Gerhard W. Dueck 3 D. Michael Miller 4 1 Department of Mathematics and Computer Science, University of Bremen,
More informationDesign of an Online Testable Ternary Circuit from the Truth Table
Design of an Online Testable Ternary Circuit from the Truth Table N. M. Nayeem and J. E. Rice Dept. of Math & Computer Science University of Lethbridge, Lethbridge, Canada {noor.nayeem,j.rice}@uleth.ca
More informationTutorial 1: Modern SMT Solvers and Verification
University of Illinois at Urbana-Champaign Tutorial 1: Modern SMT Solvers and Verification Sayan Mitra Electrical & Computer Engineering Coordinated Science Laboratory University of Illinois at Urbana
More informationarxiv:quant-ph/ v1 24 Jul 2006
Techniques for the Synthesis of Reversible Toffoli Networks arxiv:quant-ph/0607166v1 24 Jul 2006 D. Maslov D. M. Miller G. W. Dueck Dept. of Combinatorics and Optimization Dept. of Computer Science Faculty
More informationAn Algorithm for Minimization of Quantum Cost
Appl. Math. Inf. Sci. 6, No. 1, 157-165 (2012) 157 Applied Mathematics & Information Sciences An International Journal An Algorithm for Minimization of Quantum Cost Anindita Banerjee and Anirban Pathak
More informationOn Universality of Ternary Reversible Logic Gates
On Universality of Ternary Reversible Logic Gates Pawel Kerntopf*, Marek A. Perkowski**, Mozammel H. A. Khan*** *Institute of Computer Science, Department of Electronics and Information Technology, Warsaw
More informationHigh Speed Time Efficient Reversible ALU Based Logic Gate Structure on Vertex Family
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 11, Issue 04 (April 2015), PP.72-77 High Speed Time Efficient Reversible ALU Based
More informationCS/EE 181a 2008/09 Lecture 4
CS/EE 181a 28/9 Lecture 4 General topic of today s lecture: Logic Optimization Karnaugh maps. Quine-McCluskey tabulation method (not in detail). Non series-parallel networks (some care is required). Reference
More informationFast Equivalence-checking for Quantum Circuits
Fast Equivalence-checking for Quantum Circuits Shigeru Yamashita Ritsumeikan University 1-1-1 Noji igashi, Kusatsu, Shiga 525-8577, Japan Email: ger@cs.ritsumei.ac.jp Igor L. Markov University of Michigan
More informationLOGIC PROPOSITIONAL REASONING
LOGIC PROPOSITIONAL REASONING WS 2017/2018 (342.208) Armin Biere Martina Seidl biere@jku.at martina.seidl@jku.at Institute for Formal Models and Verification Johannes Kepler Universität Linz Version 2018.1
More informationAlgorithms for ATPG under Leakage Constraints
Algorithms for ATPG under Leakage Constraints Görschwin Fey fey@informatik.uni-bremen.de Institute of Computer Science, University of Bremen, 28359 Bremen, Germany Abstract Measuring the steady state leakage
More informationCHAPTER 2 AN ALGORITHM FOR OPTIMIZATION OF QUANTUM COST. 2.1 Introduction
CHAPTER 2 AN ALGORITHM FOR OPTIMIZATION OF QUANTUM COST Quantum cost is already introduced in Subsection 1.3.3. It is an important measure of quality of reversible and quantum circuits. This cost metric
More informationFPGA-Based Circuit Model Emulation of Quantum Algorithms
FPGA-Based Circuit Model Emulation of Quantum Algorithms Mahdi Aminian, Mehdi Saeedi, Morteza Saheb Zamani, Mehdi Sedighi Quantum Design Automation Lab Computer Engineering Department, Amirkabir niversity
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active
More informationSum-of-Generalized Products Expressions Applications and Minimization
Sum-of-Generalized Products Epressions Applications and Minimization Tsutomu Sasao Department of Computer Science and Electronics Kyushu Institute of Technology Iizuka 80-850 Japan Abstract This paper
More informationTechnology Mapping of Reversible Circuits to Clifford+T Quantum Circuits
echnology Mapping of Reversible Circuits to Clifford+ Quantum Circuits Nabila Abdessaied Matthew Amy Mathias Soeken Rolf Drechsler Cyber-Physical Systems, DFKI Gmb, Bremen, Germany Department of Computer
More informationIntroduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010
Introduction to Artificial Intelligence Propositional Logic & SAT Solving UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Today Representation in Propositional Logic Semantics & Deduction
More informationFPGA IMPLEMENTATION OF BASIC ADDER CIRCUITS USING REVERSIBLE LOGIC GATES
FPGA IMPLEMENTATION OF BASIC ADDER CIRCUITS USING REVERSIBLE LOGIC GATES B.Ravichandra 1, R. Kumar Aswamy 2 1,2 Assistant Professor, Dept of ECE, VITS College of Engineering, Visakhapatnam (India) ABSTRACT
More informationVariable Reordering for Reversible Wave Cascades - PRELIMINARY VERSION
Variable Reordering for Reversible Wave Cascades - PRELIMINARY VERSION Dimitrios Voudouris, Marinos Sampson and George Papakonstantinou National Technical University of Athens, Greece. Abstract In this
More informationISSN Vol.03, Issue.03, June-2015, Pages:
ISSN 2322-0929 Vol.03, Issue.03, June-2015, Pages:0271-0276 www.ijvdcs.org Design of Low Power Arithmetic and Logic Unit using Reversible Logic Gates LAKSHMIKANTHA MN 1, ANURADHA MG 2 1 Dept of ECE (VLSI
More informationMONSOON: SAT-based ATPG for Path Delay Faults Using Multiple-Valued Logics
Journal of Electronic Testing - Theory and Applications manuscript No. (will be inserted by the editor) MONSOON: SAT-based ATPG for Path Delay Faults Using Multiple-Valued Logics Stephan Eggersglüß Görschwin
More informationSynthesis of Quantum Circuit for FULL ADDER Using KHAN Gate
Synthesis of Quantum Circuit for FULL ADDER Using KHAN Gate Madhumita Mazumder West Bengal University of Technology, West Bengal ABSTRACT Reversible and Quantum logic circuits have more advantages than
More informationAnalysis of Multiplier Circuit Using Reversible Logic
IJIRST International Journal for Innovative Research in Science & Technology Volume 1 Issue 6 November 2014 ISSN (online): 2349-6010 Analysis of Multiplier Circuit Using Reversible Logic Vijay K Panchal
More informationPropositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.
Propositional Logic Winter 2012 Propositional Logic: Section 1.1 Proposition A proposition is a declarative sentence that is either true or false. Which ones of the following sentences are propositions?
More informationVLSI CAD: Lecture 4.1. Logic to Layout. Computational Boolean Algebra Representations: Satisfiability (SAT), Part 1
VLSI CAD: Logic to Layout Rob A. Rutenbar University of Illinois Lecture 4.1 Computational Boolean Algebra Representations: Satisfiability (SAT), Part 1 Some Terminology Satisfiability (called SAT for
More informationOn the Analysis of Reversible Booth s Multiplier
2015 28th International Conference 2015 on 28th VLSI International Design and Conference 2015 14th International VLSI Design Conference on Embedded Systems On the Analysis of Reversible Booth s Multiplier
More informationPropositional Logic: Evaluating the Formulas
Institute for Formal Models and Verification Johannes Kepler University Linz VL Logik (LVA-Nr. 342208) Winter Semester 2015/2016 Propositional Logic: Evaluating the Formulas Version 2015.2 Armin Biere
More informationAn Approach to Simplify Reversible Logic Circuits
An Approach to Simplify Reversible Logic Circuits Pabitra Roy 1, Subrata Das 2, Samar Sensarma 3 Department of Information Technology, Academy of Technology, Hooghly, India 1,2 Department of Computer Science
More informationDesign of a Compact Reversible Random Access Memory
Design of a Compact Reversible Random Access Memory Farah Sharmin, Md. Masbaul Alam Polash, Md. Shamsujjoha, Lafifa Jamal, Hafiz Md. Hasan Babu Dept. of Computer Science & Engineering, University of Dhaka,
More informationAn Optimized BCD Adder Using Reversible Logic Gates
Vol.2, Issue.6, Nov-Dec. 2012 pp-4527-4531 ISSN: 2249-6645 An Optimized BCD Adder Using Reversible Logic Gates K.Rajesh 1, D A Tatajee 2 1, 2 Department of ECE, A I E T, Visakhapatnam, India, ABSTRACT:
More informationOptimized Nanometric Fault Tolerant Reversible BCD Adder
Research Journal of pplied Sciences, Engineering and Technology 4(9): 167-172, 212 ISSN: 24-7467 Maxwell Scientific Organizational, 212 Submitted: October 31, 211 ccepted: December 9, 211 Published: May
More informationA brief introduction to Logic. (slides from
A brief introduction to Logic (slides from http://www.decision-procedures.org/) 1 A Brief Introduction to Logic - Outline Propositional Logic :Syntax Propositional Logic :Semantics Satisfiability and validity
More information1 Algebraic Methods. 1.1 Gröbner Bases Applied to SAT
1 Algebraic Methods In an algebraic system Boolean constraints are expressed as a system of algebraic equations or inequalities which has a solution if and only if the constraints are satisfiable. Equations
More informationLecture 9: The Splitting Method for SAT
Lecture 9: The Splitting Method for SAT 1 Importance of SAT Cook-Levin Theorem: SAT is NP-complete. The reason why SAT is an important problem can be summarized as below: 1. A natural NP-Complete problem.
More informationDesign of a compact reversible binary coded decimal adder circuit
Journal of Systems Architecture 52 (2006) 272 282 www.elsevier.com/locate/sysarc Design of a compact reversible binary coded decimal adder circuit Hafiz Md. Hasan Babu *, Ahsan Raja Chowdhury Department
More informationSequential Equivalence Checking without State Space Traversal
Sequential Equivalence Checking without State Space Traversal C.A.J. van Eijk Design Automation Section, Eindhoven University of Technology P.O.Box 53, 5600 MB Eindhoven, The Netherlands e-mail: C.A.J.v.Eijk@ele.tue.nl
More informationImplementation of Reversible Control and Full Adder Unit Using HNG Reversible Logic Gate
Implementation of Reversible Control and Full Adder Unit Using HNG Reversible Logic Gate Naresh Chandra Agrawal 1, Anil Kumar 2, A. K. Jaiswal 3 1 Research scholar, 2 Assistant Professor, 3 Professor,
More informationAn Efficient Reversible Design of BCD Adder
An Efficient Reversible Design of BCD Adder T.S.R.Krishna Prasad 1, Y.Satyadev 2 1 Associate Professor in Gudlavalleru Engineering College Department of ECE, e-mail: ad2prasad@gmail.com 2 Student of Gudlavalleru
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationDecision Procedures for Satisfiability and Validity in Propositional Logic
Decision Procedures for Satisfiability and Validity in Propositional Logic Meghdad Ghari Institute for Research in Fundamental Sciences (IPM) School of Mathematics-Isfahan Branch Logic Group http://math.ipm.ac.ir/isfahan/logic-group.htm
More informationDesign of 16 Bit Adder Subtractor with PFAG and TG Gates Using Verilog HDL
International Journal of Engineering Science and Generic Research (IJESAR) Available Online at www.ijesar.in Journal Index In ICI World of Journals - ICV 2016 68.35 Volume 4; Issue 5; September-October;
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationSAT-Solving: From Davis- Putnam to Zchaff and Beyond Day 3: Recent Developments. Lintao Zhang
SAT-Solving: From Davis- Putnam to Zchaff and Beyond Day 3: Recent Developments Requirements for SAT solvers in the Real World Fast & Robust Given a problem instance, we want to solve it quickly Reliable
More informationA NEW APPROACH TO DESIGN BCD ADDER AND CARRY SKIPBCD ADDER
A NEW APPROACH TO DESIGN BCD ADDER AND CARRY SKIPBCD ADDER K.Boopathi Raja 1, LavanyaS.R 2, Mithra.V 3, Karthikeyan.N 4 1,2,3,4 Department of Electronics and communication Engineering, SNS college of technology,
More informationCardinality Networks: a Theoretical and Empirical Study
Constraints manuscript No. (will be inserted by the editor) Cardinality Networks: a Theoretical and Empirical Study Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell Received:
More informationCOMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
More informationCombinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan
Combinational Logic Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan Classification. Combinational no memory outputs depends on only the present inputs expressed by Boolean functions 2. Sequential
More informationDatabase Manipulation Operations on Quantum Systems
Quant Inf Rev, No, 9-7 (203) 9 Quantum Information Review An International Journal http://dxdoiorg/02785/qir/0002 Database Manipulation Operations on Quantum Systems Ahmed Younes Department of Mathematics
More informationTest Generation for Designs with Multiple Clocks
39.1 Test Generation for Designs with Multiple Clocks Xijiang Lin and Rob Thompson Mentor Graphics Corp. 8005 SW Boeckman Rd. Wilsonville, OR 97070 Abstract To improve the system performance, designs with
More informationDESIGN OF A COMPACT REVERSIBLE READ- ONLY-MEMORY WITH MOS TRANSISTORS
DESIGN OF A COMPACT REVERSIBLE READ- ONLY-MEMORY WITH MOS TRANSISTORS Sadia Nowrin, Papiya Nazneen and Lafifa Jamal Department of Computer Science and Engineering, University of Dhaka, Bangladesh ABSTRACT
More informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
More informationLast update: March 4, Logical agents. CMSC 421: Chapter 7. CMSC 421: Chapter 7 1
Last update: March 4, 00 Logical agents CMSC 4: Chapter 7 CMSC 4: Chapter 7 Outline Knowledge-based agents Wumpus world Logic in general models and entailment Propositional (oolean) logic Equivalence,
More informationFormal Verification Methods 1: Propositional Logic
Formal Verification Methods 1: Propositional Logic John Harrison Intel Corporation Course overview Propositional logic A resurgence of interest Logic and circuits Normal forms The Davis-Putnam procedure
More informationA Novel Design for carry skip adder using purity preserving reversible logic gates
A Novel Design for carry skip adder using purity preserving reversible logic gates Abstract: The reversible logic is a most popular and emerging field in low power consideration. It will be having many
More information2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
More informationNP and Computational Intractability
NP and Computational Intractability 1 Polynomial-Time Reduction Desiderata'. Suppose we could solve X in polynomial-time. What else could we solve in polynomial time? don't confuse with reduces from Reduction.
More informationOptimized design of BCD adder and Carry skip BCD adder using reversible logic gates
Optimized design of BCD adder and Carry skip BCD adder using reversible logic gates H R Bhagyalakshmi E&C Department BMS College of Engineering, Bangalore, Karnataka, India M K Venkatesha E&C Department
More informationFrom SAT To SMT: Part 1. Vijay Ganesh MIT
From SAT To SMT: Part 1 Vijay Ganesh MIT Software Engineering & SMT Solvers An Indispensable Tactic for Any Strategy Formal Methods Program Analysis SE Goal: Reliable/Secure Software Automatic Testing
More informationDirect Design of Reversible Combinational and Sequential Circuits Using PSDRM Expressions
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Print): 2320-9356 Volume 3 Issue 11 ǁ November. 2015 ǁ PP.59-67 Direct Design of Reversible Combinational
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationFast DQBF Refutation
Fast DQBF Refutation Bernd Finkbeiner and Leander Tentrup Saarland University Abstract. Dependency Quantified Boolean Formulas (DQBF) extend QBF with Henkin quantifiers, which allow for non-linear dependencies
More informationAutomated Program Verification and Testing 15414/15614 Fall 2016 Lecture 3: Practical SAT Solving
Automated Program Verification and Testing 15414/15614 Fall 2016 Lecture 3: Practical SAT Solving Matt Fredrikson mfredrik@cs.cmu.edu October 17, 2016 Matt Fredrikson SAT Solving 1 / 36 Review: Propositional
More informationMajority-Based Reversible Logic Gate
Maority-Based Reversible Logic Gate Guowu Yang, William N. N. Hung *, Xiaoyu Song and Mare Perowsi Portland State University, Portland, Oregon, USA ABSTRAT Reversible logic plays an important role in application
More informationThe Calculus of Computation: Decision Procedures with Applications to Verification. Part I: FOUNDATIONS. by Aaron Bradley Zohar Manna
The Calculus of Computation: Decision Procedures with Applications to Verification Part I: FOUNDATIONS by Aaron Bradley Zohar Manna 1. Propositional Logic(PL) Springer 2007 1-1 1-2 Propositional Logic(PL)
More informationDetermining Appropriate Precisions for Signals in Fixed-Point IIR Filters
38.3 Determining Appropriate Precisions for Signals in Fixed-Point IIR Filters Joan Carletta Akron, OH 4435-3904 + 330 97-5993 Robert Veillette Akron, OH 4435-3904 + 330 97-5403 Frederick Krach Akron,
More informationMaximum 3-SAT as QUBO
Maximum 3-SAT as QUBO Michael J. Dinneen 1 Semester 2, 2016 1/15 1 Slides mostly based on Alex Fowler s and Rong (Richard) Wang s notes. Boolean Formula 2/15 A Boolean variable is a variable that can take
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationDesign and Optimization of Reversible BCD Adder/Subtractor Circuit for Quantum and Nanotechnology Based Systems
World pplied Sciences Journal 4 (6): 787-792, 2008 ISSN 1818-4952 IDOSI Publications, 2008 Design and Optimization of Reversible CD dder/subtractor Circuit for Quantum and Nanotechnology ased Systems 1
More informationFault Testing for Reversible Circuits
Fault Testing for Reversible Circuits arxiv:quant-ph/0404003v Apr 2004 Ketan N. Patel, John P. Hayes and Igor L. Markov University of Michigan, Ann Arbor 4809-222 {knpatel,jhayes,imarkov}@eecs.umich.edu
More informationUniversity of Technology
University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year معالجات دقيقة المرحلة الرابعة ھندسة الليزر والبصريات االلكترونية Lecture 3 & 4 Boolean Algebra and Logic Gates
More informationTransformation Rules for Designing CNOT-based Quantum Circuits
Transformation Rules for Designing CNOT-based Quantum Circuits Kazuo Iwama Sch. of Inform., Kyoto Univ. QCI, ERATO, JST iwama@kuis.kyoto-u.ac.jp Yahiko Kambayashi Sch. of Inform., Kyoto Univ. yahiko@i.kyoto-u.ac.jp
More informationLNN Reversible Circuit Realization Using Fast Harmony Search Based Heuristic 1
LNN Reversible Circuit Realization Using Fast Harmony Search Based Heuristic 1 Mohammad AlFailakawi a*, Imtiaz Ahmad a, & Suha Hamdan a a Computer Engineering Department, College of Computing Sciences
More informationCS Lecture 28 P, NP, and NP-Completeness. Fall 2008
CS 301 - Lecture 28 P, NP, and NP-Completeness Fall 2008 Review Languages and Grammars Alphabets, strings, languages Regular Languages Deterministic Finite and Nondeterministic Automata Equivalence of
More informationChapter 4: Classical Propositional Semantics
Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical
More information