• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 1998.10a
• /
• pp.150-154
• /
• 1998

Database schema is designed to accumulate the literal information automatically such as reinforced concrete design specifications. Sentence of design knowledge with literal data, numerical data, and symbols have analyzed manually. Finally, the proposed method has been shown that by proper design of the database schema of knowledge information as a function of design rule.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.1
• /
• pp.101-108
• /
• 2017

As the quantum gate matrix is a $r^{n+1}{\times}r^{n+1}$ dimension when the radix is r, the number of control state vectors is n, and the number of target state vectors is one, the matrix dimension with increasing n is exponentially increasing. If the number of control state vectors is $2^n$, then the number of $2^n-1$ unit matrix operations preserves the output from the input, and only one can be performed the unitary operation to the target state vector. Therefore, this paper proposes a new method of function embedding that can replace $2^n-1$ times of unit matrix operations with deterministic contribution to matrix dimension by arithmetic power switch of the unitary gate. The proposed function embedding method uses a binary literal switch with a multivalued threshold, so that a general purpose hybrid MCU gate can be realized in a $r{\times}r$ unitary matrix.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2003.05a
• /
• pp.140-141
• /
• 2003

• Journal of IKEEE
• /
• v.1 no.1 s.1
• /
• pp.111-119
• /
• 1997

This paper presented a method of extracting algorithm for Edge Multiple-Valued Decision Diagrams(EMVDD), a new data structure, from Binary Decision Diagram(BDD) which is resently used in constructing the digital logic systems based on the graph theory. And we discussed the function minimization method of the n-variables multiple-valued functions. The proposed method has the visible, schematical and regular properties.

• The Journal of Korean Association of Computer Education
• /
• v.15 no.1
• /
• pp.65-72
• /
• 2012

Generally, a logic function has many factored forms. The problem of finding more compact factored form is one of the basic operations in logic synthesis. In this paper, we present a new method for factoring Boolean functions to assist in educational logic designs. Our method for factorization is to implement two-cube Boolean division with supports of an expression. The number of literals in a factored form is a good estimate of the complexity of a logic function. Our empirical evaluation shows the improvements in literal counts over previous other factorization methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.2
• /
• pp.124-136
• /
• 1990

This paper presents a catalog of AND-EXOR expressions for representative function of four-variable NP-equivalence classes. Minimality is defined as minimizing first the number of product terms and then the total number of literal in the expression. Also, the propoerties of minimum expressions are discussed. Using this as a base, We compare minimum expressions of AND-OR type two-variable circuit with minimum expressions of AND-EXOR type two-variable circuit which used algorithm in this paper. As a results it was found that in the case of AND-OR type minimum expressions, number of product terms is under 8, and in the case of AND-EXOR type minimum expressions all functions are formed in which number of product terms is under 6, and generally number of product term is considerably small to realize four-vaiable function toward ADN-EXOR type minimum expression circuit. Algorithm suggested in this paper are realized on Sun 3/50, and through this, logic function under four-variable can get minimum immedately by a catalog suggested in this paper. As for five-variale function, we can do shanon-development a part of the function with suitable variable, and by applying four-variable minimum of this paper on this, it can be possible to get minimum in a short time and it can be said that it is possible to apply this method to functions over 6 variable.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.863-868
• /
• 2013

In recently years, many digital logic systems based on graph theory are analyzed and synthesized. This paper presented a method of constructing the function using edge valued extension graph which is based on graph theory. The graph is applied to a new data structure. from binary graph which is recently used in constructing the digital logic systems based on the graph theory. We discuss the mathematical background of literal and reed-muller expansion, and we discuss the edge valued extension graph which is the key of this paper. Also, we propose the algorithms which is the function derivation based on the proposed edge valued extension graph. That is the function minimization method of the n-variables m-valued functions and showed that the algorithm had the regularity with module by which the same blocks were made concerning about the schematic property of the proposed algorithm.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.849-852
• /
• 2005

A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored from is a good estimate of the complexity of a logic function, and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to identify two-cube Boolean subexpression pairs from given expression. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Brayton's co-kernel cube matrix.

• Journal of the Korean Society of Industry Convergence
• /
• v.3 no.1
• /
• pp.17-27
• /
• 2000

A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored form is a good estimate of the complexity of a logic function. and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to build an extended co-kernel cube matrix using co-kernel/kernel pairs and kernel/kernel pairs together. The extended co-kernel cube matrix makes it possible to yield a Boolean factored form. We also propose a heuristic method for covering of the extended co-kernel cube matrix. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Brayton's co-kernel cube matrix.

• School Mathematics
• /
• v.1 no.1
• /
• pp.19-37
• /
• 1999

In this study, we examined some matters related to the learning of variable concept in school mathematics on the basis of the theoretical foundation from the previous studies(e.g. Davis, 1975; Rosnick, 1981; IK chemann, 1981; Wagner, 1983.) and practices on variable concept teaching by evaluating the current state of that. Matters be discussed are as follows; the use of symbol for place holders in elementary mathematics, the dealing with sets those elements are literals and operations of such sets, the teaching of dummy variable, the construction of literal expressions that contains variables, the labeling indeterminates as a constant, the change in the exact meaning of variable according to the function concept, the teaching of a generalization by means of variables. After considering on these matters that are connected with the teaching-learning of variable concept, we suggested the alternative proposal to the current state of variable concept teaching.