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

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.9-16
• /
• 2008

This paper presents a new Boolean extraction technique for logic synthesis. This method extracts two-cube Boolean subexpression pairs from each logic expression. It begins by creating two-cube array, which is extended and compressed with complements of two-cube Boolean subexpressions. Next, the compressed two-cube array is analyzed to extract common subexpressions for several logic expressions. The method is greedy and extracts the best common subexpression. 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.15 no.9
• /
• pp.5744-5749
• /
• 2014

An extraction technique for a common logic expression is an extremely important part of multiple-output logic synthesis. This paper presents a new Boolean extraction technique using an exclusive-OR logic synthesis principle. The logic circuits produced only have AND, OR and NOT gates. Heuristic methods can also be applied to reduce the execution time and the number of literals. The experimental results showed improvements in the literal counts over the previous methods.

• The Journal of Korean Association of Computer Education
• /
• v.20 no.4
• /
• pp.77-84
• /
• 2017

This paper proposes a tool that can be used as a logical expression simplification tool that can be used for deepening learning of logic circuits and further utilized as a design automation tool for optimizing semiconductor parts. The simplification method of logical expressions proposed in this paper is to find common subexpressions existing in various logical expressions and reduce the repetitive use. Finally, the goal is to minimize the number of literals used in all logical expressions. These previous studies failed to produce a common subexpression embedded in the logical expressions because they only use division principle. The proposed method uses cubes with a Hamming distance of 3 to find the common subexpression embedded between logical expressions. Experiments using benchmark circuits show that the proposed method reduces the number of literals by as much as 47% when comparing simplifications with other methods.

• 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 Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.488-491
• /
• 2008

관점지향 프로그래밍은 횡단관심사를 애스펙트로 모듈화 하여 시스템의 개발 용이성, 재사용성 그리고 확장성을 향상시킨다. 이에 관점지향 프로그래밍 적용을 위한 다양한 연구가 진행되고 있으나 애스펙트를 효율적으로 개발하는 기법 관련 연구가 보다 필요한 상황이다. 본 논문에서는 애스펙트의 교차점을 구성하는 핵심요소인 결합식 추출을 위한 기법을 제안한다. 제안한 기법은 결합정보 매트릭스 작성, 결합식 작성, 그리고 결합식 정제 및 확인으로 구성한 워크플로우를 수행하여 결합정보 매트릭스와 패키지 트리를 작성하고, 결합점명 패턴의 공통성을 분석하여 애스펙트 교차점의 결합식을 추출한다. 추출한 결합식은 결합점의 패키지명, 클래스명, 그리고 메소드명 패턴의 공통성을 반영하며, 기법의 산출물은 애스펙트 결합에 대한 정확한 정보를 제공한다.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.5
• /
• pp.473-480
• /
• 2006

Extraction is tile most important step in global minimization. Its approache is to identify and extract subexpressions, which are multiple-cubes or single-cubes, common to two or more expressions which can be used to reduce the total number of literals in a Boolean network. Extraction is described as either algebraic or Boolean according to the trade-off between run-time and optimization. Boolean extraction is capable of providing better results, but difficulty in finding common Boolean divisors arises. In this paper, we present a new method for Boolean extraction to remove the difficulty. The key idea is to identify and extract two-cube Boolean subexpression pairs from each expression in a Boolean network. Experimental results show the improvements in the literal counts over the extraction in SIS for some benchmark circuits.

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

• Proceedings of the KSRS Conference
• /
• 2008.03a
• /
• pp.213-218
• /
• 2008

동일 지점을 촬영한 위성영상은 위성의 센서나 영상의 취득 시기, 지형의 상태 등에 따라 그 지점에 나타나는 화소값이 일정하지 않다. 이러한 영상은 영상간 모자이크나 변화 탐지 결과에 영향을 미칠 가능성이 높으므로 방사보정(또는 방사정규화)을 통해 화소값의 차이를 최소화시킬 필요가 있다. 본 연구는 선형회귀식을 적용한 상대 방사정규화에 초점을 맞추고 있으며, 선형회귀식 구성에 필요한 PIF(Pseudo Invariant Feature)를 자동으로 추출하기 위해 Ordinal Rank 알고리즘을 적용하였다. 이 방법을 통해 각 밴드별 후보 PIF를 추출하고, 공통으로 해당되는 최종 PIF를 추출할 수 있었다. RMSE(Root Mean Square Error), Dynamic range, Coefficient of variation 등을 통해 방사보정 후의 결과를 평가해보았다. 영상회귀를 이용한 방사보정알고리즘과의 비교를 통해 제안된 알고리즘이 갖는 장점을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.385-387
• /
• 2001

최근에 웹을 통한 기업 이미지의 부각과 기업 활동의 홍보는 기업 경영에 중요한 수단이 되고 있다. 이를 위해, 웹사이트는 사용자에게 다양한 정보와 사용의 편리함을 제공하여야 하지만 아직 많은 웹사이트들이 비규칙적으로 구성되어 있기 때문에 사용자에게 편리한 정보 전달을 제공하지 못하고 있다. 이러한 문제를 해결하기 위한 방법 중 하나는 웹 사이트 내의 문서들간의 공통적인 구성 요소를 알아내고 문서내의 정보를 중심으로 재구성하는 것이다. 본 논문에서는 XML을 이용한 문서의 재구성과 사이트를 구성하는 정보의 분류를 통하여 원하는 유형의 정보를 추출해 내는 대화식 코드 변환 시스템을 제안한다.