Journal of Computer Sciences and Applications
ISSN (Print): 2328-7268 ISSN (Online): 2328-725X Website: Editor-in-chief: Minhua Ma, Patricia Goncalves
Open Access
Journal Browser
Journal of Computer Sciences and Applications. 2013, 1(1), 14-16
DOI: 10.12691/jcsa-1-1-3
Open AccessArticle

Boolean Algebra for Xor-Gates

Lianly Rompis1,

1Electrical Engineering Department, Universitas Katolik De la Salle, Manado, Indonesia

Pub. Date: February 28, 2013

Cite 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


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.

Boolean algebra Xor-Gate logic gates

Creative CommonsThis work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit


Figure of 3


[1]  Malvino, A.P, ElektronikaKomputer Digital, PenerbitErlangga, Jakarta, 1988.
[2]  Mano, M.M., Computer System Architecture, 3rded.,PNJ: Prentice Hall, 1992.
[3]  Tokheim, R.L.,Prinsip-Prinsip Digital,PenerbitErlangga, Jakarta, 1996.
[4]  CIMT-Centre for Innovation in Mathematics Teaching, Boolean Algebra, University of Plymouth, 2005. Available:
[5]  Katzen, S.J., EEE111J2 Digital Systems: Boolean Algebra and Karnaugh Maps, University of Ulster, Ireland, 2007. Available: