• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3227-3233
• /
• 2009

A method for performing Boolean resubstitution is proposed. This method is efficiently implemented using division matrix. It begins by creating an algebraic division matrix from given two logic expressions. By introducing Boolean properties and adding literals into the algebraic division matrix, we make the Boolean division matrix. Using this extended division matrix, Boolean substituted expressions are found. Experimental results show the improvements in the literal counts over well-known logic synthesis tools for some benchmark circuits.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.11
• /
• pp.4597-4603
• /
• 2010

A factorization is a very important part of multi-level logic synthesis. The number of literals in a factored form is an 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 nonkernel Boolean pairs from given expression. Experimental results on various benchmark circuits show the improvements in literal counts over previous other factorization methods.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.1
• /
• pp.119-126
• /
• 2003

The problem of tracking moving objects in a video stream is discussed in this pa-per. We discussed the popular technique of optical flow for moving object detection. Optical flow finds the velocity vectors at each pixel in the entire video scene. However, optical flow based methods require complex computations and are sensitive to noise. In this paper, we proposed a new method based on the Hough transform and on voting accumulation for improving the accuracy and reducing the computation time. Further, we applied the Boo-lean based edge detector for edge detection. Edge detection and segmentation are used to extract the moving objects in the image sequences and reduce the computation time of the CHT. The Boolean based edge detector provides accurate and very thin edges. The difference of the two edge maps with thin edges gives better localization of moving objects. The simulation results show that the proposed method improves the accuracy of finding the optical flow vectors and more accurately extracts moving objects' information. The process of edge detection and segmentation accurately find the location and areas of the real moving objects, and hence extracting moving information is very easy and accurate. The Combinatorial Hough Transform and voting accumulation based optical flow measures optical flow vectors accurately. The direction of moving objects is also accurately measured.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.465-486
• /
• 2005

We study the relationship between intuitionistic fuzzy ideals and intuitionistic fuzzy congruences on a distributive lattice. And we prove that the lattice of intuitionistic fuzzy ideals is isomorphic to the lattice of intuitionistic fuzzy congruences on a generalized Boolean algebra.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.339-343
• /
• 2005

Boolean networks(BN) construction is one of the commonly used methods for building gene networks from time series microarray data. However, BN has two major drawbacks. First, it requires heavy computing times. Second, the binary transformation of the microarray data may cause a loss of information. This paper propose two methods using liner regression to construct gene regulatory networks. The first proposed method uses regression based BN variable selection method, which reduces the computing time significantly in the BN construction. The second method is the regression based network method that can flexibly incorporate the interaction of the genes using continuous gene expression data. We construct the network structure from the simulated data to compare the computing times between Boolean networks and the proposed method. The regression based network method is evaluated using a microarray data of cell cycle in Caulobacter crescentus.

• 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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.7
• /
• pp.3251-3257
• /
• 2011

This paper presents a new Boolean extraction technique for logic synthesis. This method extracts kernel-kernel pairs as well as cokernel-kernel pairs. The given logic expressions can be translated into Boolean divisors and quotients with kernel-kernel pairs. Next, kernel intersection method provides the common sub-expressions for several logic expressions. Experimental results show the improvement in literal count over previous other extraction methods.

• Journal of Ocean Engineering and Technology
• /
• v.25 no.3
• /
• pp.47-52
• /
• 2011

3D geometric modeling has a lot of advantages in the field of design and manufacturing. Many manufacturing processes and production lines are using 3D geometric modeling technique. These help reduce the cost and time for manufacturing. The purpose of this study is the realization of a 3D cutting shape for an H-Beam used in ships and ocean plants. The complex 3D cutting shapes could be represented by using the boolean operation of basic figures. Graphic functions with parameters were used to simply define the basic figures. The developed system can show the complex cutting shape of an H-beam simply and quickly. This system can be utilized for the automatic cutting system for an H-beam.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3715-3722
• /
• 2011

This paper presents a new Boolean extraction technique for logic synthesis. This method first calculates divisor/2-cube quotients, 2-cube quotient pairs, and 2-cube quotient matrices. Then we find candidates, which can be common sub-expressions, from 2-cube quotients and matrices. Next, candidate intersection provides the common sub-expressions for several logic expressions. Experimental results show the improvements in literal counts over the previous methods.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1965-1966
• /
• 2008

The manipulation of Boolean functions is a fundamental part of computer science, and many problems in the design and testing of digital systems can be expressed as a sequence of operations. It is mainly a paper of our research on the techniques of Boolean function manipulation using Binary Decision Diagram(BDDs) and their applications for VLSI CAD System. In many practical applications related to digital system design, it is a basic technique to use ternary-valued functions. In this paper, we discuss the methods for representing logical values.