• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.561-574
• /
• 2023

In this paper, we focus on establishing the MacWilliams-type identities on vectorial Boolean functions with bent component functions. As their applications, we provide a bound for the non-existence of vectorial dual-bent functions with prescribed minimum degree, and several Gleason-type theorems are presented as well.

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

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.833-835
• /
• 2002

In this paper, we propose multi-resolutional representation of B-rep solid models using the selective Boolean operations on non-manifold geometric models. Since the union and subtraction operations of the selective Boolean operations are commutative, the integrity of the model is guaranteed for reordering design features. A multi-resolution representation is established using a non-manifold merged set model and a feature modeling tree reordered according to some criterion of level of detail (LOD). Then, a solid model for a specified LOD can be extracted from this multi-resolution model using the selective Boolean operations.

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

• Journal of the Korea Computer Industry Society
• /
• v.7 no.4
• /
• pp.293-298
• /
• 2006

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 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 Bryton's co-kernel cube matrix.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.2001-2011
• /
• 2013

Cho and Kim [4] have introduced the concept of the competition index of a digraph. Similarly, the competition index of an $n{\times}n$ Boolean matrix A is the smallest positive integer q such that $A^{q+i}(A^T)^{q+i}=A^{q+r+i}(A^T)^{q+r+i}$ for some positive integer r and every nonnegative integer i, where $A^T$ denotes the transpose of A. In this paper, we study the upper bound of the competition index of a Boolean matrix. Using the concept of Boolean rank, we determine the upper bound of the competition index of a nearly reducible Boolean matrix.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.293-300
• /
• 2000

The non-manifold geometric modeling technique is to improve design process and to Integrate design, analysis, and manufacturing by handling mixture of wireframe model, surface model, and solid model in a single data structure. For the non-manifold geometric modeling, Euler operators and other high level modeling methods are necessary. Boolean operation is one of the representative modeling method for the non-manifold geometric modeling. This thesis studies Boolean operations of non-manifold model with the data structure of selective storage. The data structure of selective storage is improved non-manifold data structure in that existing non-manifold data structures using ordered topological representation method always store non-manifold information even if edges and vortices are in the manifold situation. To implement Boolean operations for non-manifold model, intersection algorithm for topological cells of three different dimensions, merging and selection algorithm for three dimensional model, and Open Inventor(tm), a 3D toolkit from SGI, are used.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.13 no.6
• /
• pp.20-23
• /
• 1976

A boolean algebra method for computing the reliability in a communication network is prosented. Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by the Boolean operation which is named parallel operation. The method seems to be promising for both oriented and nonoriented network.

• The Pure and Applied Mathematics
• /
• v.6 no.2
• /
• pp.79-86
• /
• 1999

A Boolean function generates a binary sequence which is frequently used in a stream cipher. There are number of critical concepts which a Boolean function, as a key stream generator in a stream cipher, satisfies. These are nonlinearity, correlation immunity, balancedness, SAC (strictly avalanche criterion), PC (propagation criterion) and so on. In this paper we construct an algorithm for finding the correlation immune order of a Boolean function, and check how long to find the correlation immune order of a given Boolean function in our algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.4
• /
• pp.49-59
• /
• 2004

Boolean function synthesize problem is to find a boolean expression with in/outputs of original function. This problem can be modeled into a 0-1 integer programming. In this paper, we find a boolean expressions of S-boxes of DES for an example, whose algebraic structure has been unknown for many years. The results of this paper can be used for efficient hardware implementation of a function and cryptanalysis using algebraic structure of a block cipher.