Boolean Algebra for Xor-Gates
Journal of Computer Sciences and Applications · 2013
DOI: 10.12691/jcsa-1-1-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer Sciences and Applications, 2013. Verfasst von Lianly Rompis. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
Rompis, L. (2013). Boolean Algebra for Xor-Gates. Journal of Computer Sciences and Applications. https://doi.org/10.12691/jcsa-1-1-3
Vancouver
Rompis L. Boolean Algebra for Xor-Gates. Journal of Computer Sciences and Applications. 2013. doi:10.12691/jcsa-1-1-3
BibTeX
@article{Rompis2013,
author = {Rompis, Lianly},
title = {Boolean Algebra for Xor-Gates},
journal = {Journal of Computer Sciences and Applications},
year = {2013},
doi = {10.12691/jcsa-1-1-3}
}
EUVIMED