Boolean Algebra for Xor-Gates

Lianly Rompis^1,

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

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

Abstract

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:
Boolean algebra Xor-Gate logic gates

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Figures

References:

[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: http://www.cimt.plymouth.ac.uk/projects/mepres/alevel/discrete_ch11.pdf.
[5]	Katzen, S.J., EEE111J2 Digital Systems: Boolean Algebra and Karnaugh Maps, University of Ulster, Ireland, 2007. Available: http://katzen.me.uk/Books/sidssite/eee111a/digital_4.pdf.