The Experts below are selected from a list of 9726 Experts worldwide ranked by ideXlab platform
Sy-yen Kuo - One of the best experts on this subject based on the ideXlab platform.
-
improving Boolean Circuit testing by using quantum search
International Conference on Nanotechnology, 2008Co-Authors: Yao Hsin Chou, Sy-yen KuoAbstract:Given any classical Circuit, a minimum input quantum version of Boolean Circuit can be constructed with general CCN gates. Any quantum Boolean Circuit can be easily tested with one test pattern under stuck-at fault model. In this paper, we apply quantum search algorithm to Boolean logic testing problem and drastically decrease not only the number of test patterns but also the time and the number of bits we needed to find out the faulty wires.
-
qbist quantum built in self test for any Boolean Circuit
VLSI Test Symposium, 2008Co-Authors: Yao Hsin Chou, Sy-yen Kuo, I-ming TsaiAbstract:A systematic procedure was proposed to derive a minimum space quantum Circuit for any given classical logic with the generalized quantum Toffoli gate which is universal in Boolean logic. Since quantum computation is reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general CCN gates to make QILA 1-testable. That is, for any quantum Boolean Circuit, the number of test patterns is independent of both the size of the array and the length of the inputs. This property can be applied to perform the quantum built-in self-test (QBIST), which makes any Boolean Circuit 1-testable.
-
VTS - QBIST: Quantum Built-in Self-Test for any Boolean Circuit
26th IEEE VLSI Test Symposium (vts 2008), 2008Co-Authors: Yao Hsin Chou, Sy-yen Kuo, I-ming TsaiAbstract:A systematic procedure was proposed to derive a minimum space quantum Circuit for any given classical logic with the generalized quantum Toffoli gate which is universal in Boolean logic. Since quantum computation is reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general CCN gates to make QILA 1-testable. That is, for any quantum Boolean Circuit, the number of test patterns is independent of both the size of the array and the length of the inputs. This property can be applied to perform the quantum built-in self-test (QBIST), which makes any Boolean Circuit 1-testable.
-
Quantum Boolean Circuits are 1-Testable
IEEE Transactions on Nanotechnology, 2008Co-Authors: Yao Hsin Chou, I-ming Tsai, Sy-yen KuoAbstract:Recently, a systematic procedure was proposed to derive a minimum input quantum Circuit for any given classical logic with the generalized quantum Toffoli gate, which is universal in Boolean logic. Since quantum Boolean Circuits are reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general controlled-controlled not gates to make QILA 1-testable. That is, for any quantum Boolean Circuit, the number of test patterns is independent of both the size of the array and the length of the inputs.
-
Quantum Boolean Circuit is 1-testable
2007 7th IEEE Conference on Nanotechnology (IEEE NANO), 2007Co-Authors: Yao Hsin Chou, I-ming Tsai, Sy-yen KuoAbstract:Recently, a systematic procedure is proposed to derive a minimum space quantum Circuit for a given classical logic with the generalized quantum Toffoli gate which is universal in classical Boolean logic. Since quantum computation is reversible, we can use this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we apply Hadamard and general CCN gates on QILA Circuits to make them 1-testable. As a result, for quantum Boolean Circuits, the number of test patterns is independent of both the size of the array and the length of the inputs.
I-ming Tsai - One of the best experts on this subject based on the ideXlab platform.
-
qbist quantum built in self test for any Boolean Circuit
VLSI Test Symposium, 2008Co-Authors: Yao Hsin Chou, Sy-yen Kuo, I-ming TsaiAbstract:A systematic procedure was proposed to derive a minimum space quantum Circuit for any given classical logic with the generalized quantum Toffoli gate which is universal in Boolean logic. Since quantum computation is reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general CCN gates to make QILA 1-testable. That is, for any quantum Boolean Circuit, the number of test patterns is independent of both the size of the array and the length of the inputs. This property can be applied to perform the quantum built-in self-test (QBIST), which makes any Boolean Circuit 1-testable.
-
VTS - QBIST: Quantum Built-in Self-Test for any Boolean Circuit
26th IEEE VLSI Test Symposium (vts 2008), 2008Co-Authors: Yao Hsin Chou, Sy-yen Kuo, I-ming TsaiAbstract:A systematic procedure was proposed to derive a minimum space quantum Circuit for any given classical logic with the generalized quantum Toffoli gate which is universal in Boolean logic. Since quantum computation is reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general CCN gates to make QILA 1-testable. That is, for any quantum Boolean Circuit, the number of test patterns is independent of both the size of the array and the length of the inputs. This property can be applied to perform the quantum built-in self-test (QBIST), which makes any Boolean Circuit 1-testable.
-
Quantum Boolean Circuits are 1-Testable
IEEE Transactions on Nanotechnology, 2008Co-Authors: Yao Hsin Chou, I-ming Tsai, Sy-yen KuoAbstract:Recently, a systematic procedure was proposed to derive a minimum input quantum Circuit for any given classical logic with the generalized quantum Toffoli gate, which is universal in Boolean logic. Since quantum Boolean Circuits are reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general controlled-controlled not gates to make QILA 1-testable. That is, for any quantum Boolean Circuit, the number of test patterns is independent of both the size of the array and the length of the inputs.
-
Quantum Boolean Circuit is 1-testable
2007 7th IEEE Conference on Nanotechnology (IEEE NANO), 2007Co-Authors: Yao Hsin Chou, I-ming Tsai, Sy-yen KuoAbstract:Recently, a systematic procedure is proposed to derive a minimum space quantum Circuit for a given classical logic with the generalized quantum Toffoli gate which is universal in classical Boolean logic. Since quantum computation is reversible, we can use this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we apply Hadamard and general CCN gates on QILA Circuits to make them 1-testable. As a result, for quantum Boolean Circuits, the number of test patterns is independent of both the size of the array and the length of the inputs.
-
Quantum Boolean Circuit construction and layout under locality constraint
Proceedings of the 2001 1st IEEE Conference on Nanotechnology. IEEE-NANO 2001 (Cat. No.01EX516), 2001Co-Authors: I-ming Tsai, Sy-yen KuoAbstract:The discovery of Shor's prime factorization and Grover's fast database search algorithm have made quantum computing the most rapidly expanding research field recently. Nanotechnology, in particular silicon-based nanoscale devices, have been proposed as one of the candidates that can be used to implement a quantum computer. In this paper, we have derived a systematic procedure to realize any general m-to-n bit combinational Boolean logic using elementary quantum gates. The quantum Circuit layout under the locality constraint is then formulated, together with the gate count evaluation function, to reduce the total number of quantum gates required to implement the Circuit.
Ilkka Niemela - One of the best experts on this subject based on the ideXlab platform.
-
Computational Logic - Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Computational Logic — CL 2000, 2000Co-Authors: Tommi Junttila, Ilkka NiemelaAbstract:Boolean Circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiability problems for Boolean Circuits is devised. The method employs a direct cut rule combined with deterministic deduction rules. Simplification rules for Circuits and a search heuristic attempting to minimize the search space are developed. Experiments in symbolic model checking domain indicate that the method is competitive against state-of-the-art satisfiability checking techniques and a promising basis for further work.
-
towards an efficient tableau method for Boolean Circuit satisfiability checking
Lecture Notes in Computer Science, 2000Co-Authors: Tommi Junttila, Ilkka NiemelaAbstract:Boolean Circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiability problems for Boolean Circuits is devised. The method employs a direct cut rule combined with deterministic deduction rules. Simplification rules for Circuits and a search heuristic attempting to minimize the search space are developed. Experiments in symbolic model checking domain indicate that the method is competitive against state-of-the-art satisfiability checking techniques and a promising basis for further work.
Andrzej Lingas - One of the best experts on this subject based on the ideXlab platform.
-
Computational Complexity Conference - Small normalized Boolean Circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth
2018Co-Authors: Andrzej LingasAbstract:We consider normalized Boolean Circuits that use binary operations of disjunction and conjunction, and unary negation, with the restriction that negation can be only applied to input variables. We derive a lower bound trade-off between the size of normalized Boolean Circuits computing Boolean semi-disjoint bilinear forms and their conjunction-depth (i.e., the maximum number of and-gates on a directed path to an output gate). In particular, we show that any normalized Boolean Circuit of at most ϵlogn conjunction-depth computing the n-dimensional Boolean vector convolution has ω(n2−4ϵ) and-gates. Analogously, any normalized Boolean Circuit of at most ϵlogn conjunction-depth computing the n × n Boolean matrix product has ω(n3−4ϵ) and-gates. We complete our lower-bound trade-offs with upper-bound trade-offs of similar form yielded by the known fast algebraic algorithms.
-
towards an almost quadratic lower bound on the monotone Circuit complexity of the Boolean convolution
Theory and Applications of Models of Computation, 2017Co-Authors: Andrzej LingasAbstract:We study the monotone Circuit complexity of the so called semi-disjoint bilinear forms over the Boolean semi-ring, in particular the n-dimensional Boolean vector convolution. Besides the size of a monotone Boolean Circuit, we consider also the and-depth of the Circuit, i.e., the maximum number of and-gates on a path to an output gate, and the monom number of the Circuit which is the number of distinct subsets of input variables induced by monoms at the output gates. We show that any monotone Boolean Circuit of \(\epsilon \log n\)-bounded and-depth computing a Boolean semi-disjoint form with 2n input variables and q prime implicants has \(\varOmega (q/n^{2\epsilon })\) size. As a corollary, we obtain the \(\varOmega (n^{2-2\epsilon })\) lower bound on the size of any monotone Boolean Circuit of so bounded and-depth computing the n-dimensional Boolean vector convolution. Furthermore, we show that any monotone Boolean Circuit of \(2^{n^{\epsilon }}\)-bounded monom number, computing a Boolean semi-disjoint form on 2n variables, where each variable occurs in p prime implicants, has \(\varOmega (n^{1-2\epsilon }p)\) size. As a corollary, we obtain the \(\varOmega (n^{2-2\epsilon })\) lower bound on the size of any monotone Boolean Circuit of \(2^{n^{\epsilon }}\)-bounded monom number computing the n-dimensional Boolean vector convolution. Finally, we demonstrate that in any monotone Boolean Circuit for a semi-disjoint bilinear form with q prime implicants that has size substantially smaller than q, the majority of the terms at the output gates representing prime implicants have to have very large length (i.e., the number of variable occurrences). In particular, in any monotone Circuit for the n-dimensional Boolean vector convolution of size \(o(n^{2-4\epsilon }/\log n)\) almost all prime implicants of the convolution have to be represented by terms at the Circuit output gates of length at least \(n^{\epsilon }\).
Yao Hsin Chou - One of the best experts on this subject based on the ideXlab platform.
-
improving Boolean Circuit testing by using quantum search
International Conference on Nanotechnology, 2008Co-Authors: Yao Hsin Chou, Sy-yen KuoAbstract:Given any classical Circuit, a minimum input quantum version of Boolean Circuit can be constructed with general CCN gates. Any quantum Boolean Circuit can be easily tested with one test pattern under stuck-at fault model. In this paper, we apply quantum search algorithm to Boolean logic testing problem and drastically decrease not only the number of test patterns but also the time and the number of bits we needed to find out the faulty wires.
-
qbist quantum built in self test for any Boolean Circuit
VLSI Test Symposium, 2008Co-Authors: Yao Hsin Chou, Sy-yen Kuo, I-ming TsaiAbstract:A systematic procedure was proposed to derive a minimum space quantum Circuit for any given classical logic with the generalized quantum Toffoli gate which is universal in Boolean logic. Since quantum computation is reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general CCN gates to make QILA 1-testable. That is, for any quantum Boolean Circuit, the number of test patterns is independent of both the size of the array and the length of the inputs. This property can be applied to perform the quantum built-in self-test (QBIST), which makes any Boolean Circuit 1-testable.
-
VTS - QBIST: Quantum Built-in Self-Test for any Boolean Circuit
26th IEEE VLSI Test Symposium (vts 2008), 2008Co-Authors: Yao Hsin Chou, Sy-yen Kuo, I-ming TsaiAbstract:A systematic procedure was proposed to derive a minimum space quantum Circuit for any given classical logic with the generalized quantum Toffoli gate which is universal in Boolean logic. Since quantum computation is reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general CCN gates to make QILA 1-testable. That is, for any quantum Boolean Circuit, the number of test patterns is independent of both the size of the array and the length of the inputs. This property can be applied to perform the quantum built-in self-test (QBIST), which makes any Boolean Circuit 1-testable.
-
Quantum Boolean Circuits are 1-Testable
IEEE Transactions on Nanotechnology, 2008Co-Authors: Yao Hsin Chou, I-ming Tsai, Sy-yen KuoAbstract:Recently, a systematic procedure was proposed to derive a minimum input quantum Circuit for any given classical logic with the generalized quantum Toffoli gate, which is universal in Boolean logic. Since quantum Boolean Circuits are reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general controlled-controlled not gates to make QILA 1-testable. That is, for any quantum Boolean Circuit, the number of test patterns is independent of both the size of the array and the length of the inputs.
-
Quantum Boolean Circuit is 1-testable
2007 7th IEEE Conference on Nanotechnology (IEEE NANO), 2007Co-Authors: Yao Hsin Chou, I-ming Tsai, Sy-yen KuoAbstract:Recently, a systematic procedure is proposed to derive a minimum space quantum Circuit for a given classical logic with the generalized quantum Toffoli gate which is universal in classical Boolean logic. Since quantum computation is reversible, we can use this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we apply Hadamard and general CCN gates on QILA Circuits to make them 1-testable. As a result, for quantum Boolean Circuits, the number of test patterns is independent of both the size of the array and the length of the inputs.