Volume 65 | Issue 3 | Year 2019 | Article Id. IJMTT-V65I3P522 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I3P522
Boolean algebra or switching algebra is used to simplify Boolean equations and functions before they are used to design a logic gate. Boolean algebra is nothing butalogic to perform mathematical operations on binary numbers i.e., ‘0’ and ‘1’. Boolean algebra contains three basic operators viz. AND, OR and NOT. In this paper, we are trying to show these operations and some basic laws(i.e., commutative, associative and distributive) and the corresponding logic gate representations.
[1] N. Balabanian and B. Carlson, Digital logic design principles, John Wiley, pp- 39-40, 2001.
[2] J. A. Camara, Electrical and Electronics reference manual for the electrical and computer PE exam, 2010.
[3] J. Gregg, Ones and zeros: Understanding Boolean algebra, digital circuits, and the logic of sets, Wiley- IEEE press, 1998.
[4] D. E. Muller, Application of Boolean algebra to switching circuit design and to error detection, Transactions of the IRE professional group on electronic computers,pp- 6-12, 1954.
[5] W. Millan, A. Clark, Ed dawson, Heuristic design of cryptographically strong balanced Boolean functions, International Conference on the theory and applications of cryptographic techniques, pp- 489-499, 1998.
[6] G. L. Snider, A. O. Orlov, I. Amlani, G. H. Bernstenin, C. S. Lent, J.L. Merz, W. Porod, Quantum- dot cellular automata: Line and majority logic gate, Japanese journal of Applied physics, Vol. 38, No12, 1999.
Subhrajit Sarma, Rama Kanta Bhuyan, "Boolean Algebra and Logic Gates," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 3, pp. 147-151, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I3P522