1Electrical Engineering Department, Universitas Katolik De la Salle, Manado, Indonesia
Journal of Computer Sciences and Applications.
2013,
Vol. 1 No. 1, 14-16
DOI: 10.12691/jcsa-1-1-3
Copyright © 2013 Science and Education PublishingCite this paper: Lianly Rompis. Boolean Algebra for Xor-Gates.
Journal of Computer Sciences and Applications. 2013; 1(1):14-16. doi: 10.12691/jcsa-1-1-3.
Correspondence to: Lianly Rompis, Electrical Engineering Department, Universitas Katolik De la Salle, Manado, Indonesia. Email:
Corresponding author: lrompis@unikadelasalle.ac.idAbstract
Rules and laws of Boolean algebra are very essential for the simplification of a long and complex logic equation. Applying the Boolean algebra basic concept, such a kind of logic equation could be simplified in a more simple and efficient form.Mainly, the standard rules of Boolean algebra are given in operator ‘+’ and ‘x’, based on the AND and OR logic gates equations. For some logic designs, it is commonly that logic problems are writtenin terms of XOR format.This paper tries to conduct something different. It will analyze, describe, and derive Boolean algebra rules related to logic equations using exclusive-or (XOR) logic gate.
Keywords