• Title/Summary/Keyword: Exclusive-OR Logic

Search Result 9,187, Processing Time 0.039 seconds

Multioutput Logic Simplication Using an Exclusive-OR Logic Synthesis Principle (배타 논리합 원리를 이용한 다출력 논리회로 간략화)

  • Kwon, Oh-Hyeong
    • 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.

A Constructing Theory of Multiple-Valued Logic Functions based on the Exclusive-OR Minimization Technique and Its Implementation (Exclusive-OR 최소화 기법에 의한 다치논리 함수의 구성 및 실현)

  • 박동영;김흥수
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.11
    • /
    • pp.56-64
    • /
    • 1992
  • The sum-of-product type MVL (Multiple-valued logic) functions can be directly transformed into the exclusive-sum-of-literal-product(ESOLP) type MVL functions with a substitution of the OR operator with the exclusive-OR(XOR) operator. This paper presents an algorithm that can reduce the number of minterms for the purpose of minimizing the hardware size and the complexity of the circuit in the realization of ESOLP-type MVL functions. In Boolean algebra, the joinable true minterms can form the cube, and if some cubes form a cube-chain with adjacent cubes by the insertion of false cubes(or, false minterms), then the created cube-chain can become a large cube which includes previous cubes. As a result of the cube grouping, the number of minterms can be reduced artificially. Since ESOLP-type MVL functions take the MIN/XOR structure, a XOR circuit and a four-valued MIN/XOR dynamic-CMOS PLA circuit is designed for the realization of the minimized functions, and PSPICE simulation results have been also presented for the validation of the proposed algorithm.

  • PDF

Random Pattern Testability of AND/XOR Circuits

  • Lee, Gueesang
    • Journal of Electrical Engineering and information Science
    • /
    • v.3 no.1
    • /
    • pp.8-13
    • /
    • 1998
  • Often ESOP(Exclusive Sum of Products) expressions provide more compact representations of logic functions and implemented circuits are known to be highly testable. Motivated by the merits of using XOR(Exclusive-OR) gates in circuit design, ESOP(Exclusive Sum of Products) expressions are considered s the input to the logic synthesis for random pattern testability. The problem of interest in this paper is whether ESOP expressions provide better random testability than corresponding SOP expressions of the given function. Since XOR gates are used to collect product terms of ESOP expression, fault propagation is not affected by any other product terms in the ESOP expression. Therefore the test set for a fault in ESOP expressions becomes larger than that of SOP expressions, thereby providing better random testability. Experimental results show that in many cases, ESOP expressions require much less random patterns compared to SOP expressions.

  • PDF

Creative Thinking Methodology by Convergent and Divergent Approaches (수렴적, 발산적 접근에 의한 창의적 사고방법)

  • Choe, Seong-Un
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2011.11a
    • /
    • pp.219-224
    • /
    • 2011
  • The research reviews the logical approach based on the creative thoughts. The two logical approaches, including deductive convergent and inductive divergent are discussed with why-why techniques and how-how techniques. While the deductive thinking is vertical logic for interconnected hierarchical and deep domains, the inducive thinking is horizontal logic for mutually exclusive and collectively exhausted frameworks. The creative thinking comes from the reversing the logic and lessening the premise of convergent and divergent approaches.

  • PDF

Inclusive and Exclusive or Interpretation for Indefinite Deductive Databases (불명확 연역 데이터베이스를 위한 포괄적 및 배타적 or 해석)

  • Seok, Yun-Yeong;Jeon, Jong-Hun
    • The KIPS Transactions:PartD
    • /
    • v.9D no.2
    • /
    • pp.243-250
    • /
    • 2002
  • In order to properly interpret and process or operators in deductive databases including indefinite clauses, we propose to use Lasez′s Strong Model Semantics(LSMS) which is reasonably simple yet powerful enough to support both exclusive and inclusive interpretations. Conventional semantics either fail to support both interpretations or simply too complex. Therefore, in this paper we study advantages and difficulties of representing indefinite information, and as for the solution to difficulties, we show how LSMS can be used to support both inclusive or and exclusive or interpretations. We also investigate and analyze it′s properties and show how it semantically differs from others. We believe that LSMS is the only "reasonably simple" semantics that supports both inclusive and exclusive interpretations.

Segmentation of Moving Multiple Vehicles using Logic Operations (논리연산을 이용한 주행차량 영상분할)

  • Choi Kiho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.1 no.1
    • /
    • pp.10-16
    • /
    • 2002
  • In this paper, a novel algorithm for segmentation of moving multiple vehicles in video sequences using logic operations is proposed. For the case of multiple vehicles in a scene, the proposed algorithm begins with a robust double-edge image derived from the difference between two successive frames using exclusive OR operation. After extracting only the edges of moving multiple vehicles using Laplacian filter, AND operation and dilation operation, the image is segmented into moving multiple vehicle image. The features of moving vehicles can be directly extracted from the segmented images. The proposed algorithm has no the two preprocessing steps, so it can reduce noises which are norm at in preprocessing of the original images. The algorithm is more simplified using logic operations. The proposed algorithm is evaluated on an outdoor video sequence with moving multiple vehicles in 90,000 frames of 30fps by a low-end video camera and produces promising results.

  • PDF

One-chip determinism multi-layer neural network on FPGA

  • Suematsu, Ryosuke;Shimizu, Ryosuke;Aoyama, Tomoo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.89.4-89
    • /
    • 2002
  • $\textbullet$ Field Programmable Gate Array $\textbullet$ flexible hardware $\textbullet$ neural network $\textbullet$ determinism learning $\textbullet$ multi-valued logic $\textbullet$ disjunctive normal form $\textbullet$ multi-dimensional exclusive OR

  • PDF

Demonstration of 10 Gbps, All-optical Encryption and Decryption System Utilizing SOA XOR Logic Gates (반도체 광 증폭기 XOR 논리게이트를 이용한 10 Gbps 전광 암호화 시스템의 구현)

  • Jung, Young-Jin;Park, Nam-Kyoo;Jhon, Young-Min;Woo, Deok-Ha;Lee, Seok;Gil, Sang-Keun
    • Korean Journal of Optics and Photonics
    • /
    • v.19 no.3
    • /
    • pp.237-241
    • /
    • 2008
  • An all-optical encryption system built on the basis of electrical logic circuit design principles is proposed, using semiconductor optical amplifier (SOA) exclusive or (XOR) logic gates. Numerical techniques (steady-state and dynamic) were employed in a sequential manner to optimize the system parameters, speeding up the overall design process. The results from both numerical and experimental testbeds show that the encoding/decoding of the optical signal can be achieved at a 10 Gbps data rate with a conventional SOA cascade without serious degradation in the data quality.

(The Minimization of Boolean functions to the Exclusive-OR sum of Products logic) (부울함수의 논리곱의 배타적 합 논리로의 간략화)

  • 이진흥;이상곤;문상재;서용수;김태근;정원영
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1997.11a
    • /
    • pp.315-321
    • /
    • 1997
  • 본 논문에서는 임의의 부울함수(Boolean function)에 대한 진리표나 출력 시퀀스로부터 논리곱의 배타적 합(exclusive-or sum of products; ESOP)형의 부울함수를 구성하는 알고리듬을 제안한다. 기존에 알려진 카르노맵이나 Quine HcClusky법에 의하여 구해지는 부울함수는 논리곱의 합(sum of product; SOP) 형으로 주어지며 이들 수식은 부정(NOT)논리를 포함하는 경우가 있다. 제안된 알고리듬에 의하여 구해지는 부울함수는 구조적인 등가성을 판별하는데 편리하므로 해쉬함수용 부울함수의 개발에 이용될 수 있다.

  • PDF

A Study of I/O Serial Communication Systems Between Overground And Overhead Controllers

  • Kim, Duk-Hyun
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.4
    • /
    • pp.122-128
    • /
    • 2007
  • This paper represents the Input/Output (I/O) serial communication methods between overground and overhead controllers using a programmable logic controller (PLC). In general, the systems composed by overground and overhead controllers use exclusive serial communication units. This, however, has a demerit such as a high cost as well as some restrictions of the system itself. Thus, this paper suggests methods by I/O cards for data communication between overground and overhead controllers. In this system, there is no special card and it therefore has a lower cost and is more flexible than the exclusive serial communication unit.