We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Implementation of Boolean Functions through Multiplexers with the help of Shannon Expansion Theorem

by Saurabh Rawat, Anushree Sah, Sumit Pundir
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 62 - Number 6
Year of Publication: 2013
Authors: Saurabh Rawat, Anushree Sah, Sumit Pundir
10.5120/10084-4708

Saurabh Rawat, Anushree Sah, Sumit Pundir . Implementation of Boolean Functions through Multiplexers with the help of Shannon Expansion Theorem. International Journal of Computer Applications. 62, 6 ( January 2013), 18-24. DOI=10.5120/10084-4708

@article{ 10.5120/10084-4708,
author = { Saurabh Rawat, Anushree Sah, Sumit Pundir },
title = { Implementation of Boolean Functions through Multiplexers with the help of Shannon Expansion Theorem },
journal = { International Journal of Computer Applications },
issue_date = { January 2013 },
volume = { 62 },
number = { 6 },
month = { January },
year = { 2013 },
issn = { 0975-8887 },
pages = { 18-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume62/number6/10084-4708/ },
doi = { 10.5120/10084-4708 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:11:00.592662+05:30
%A Saurabh Rawat
%A Anushree Sah
%A Sumit Pundir
%T Implementation of Boolean Functions through Multiplexers with the help of Shannon Expansion Theorem
%J International Journal of Computer Applications
%@ 0975-8887
%V 62
%N 6
%P 18-24
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Implementation of Boolean function through multiplexer can be done by various multiplexers depending upon the select lines. Implementation of Boolean functions can be done by various methods, but in this particular paper stress is more on multiplexers. Through Shannon expansion theorem,it is easy for us to implement the Boolean functions in a simpler way. Upto three variables, can be handled by multiplexers, and above that we have taken aid of look out table, and how it uses multiplexers in their operations.

References
  1. en. wikipedia. org/wiki/Multiplexer
  2. en. wikipedia. org/wiki/Shannon's_expansion
  3. Arturo Hern´andez Aguirre, Bill P. Buckles, and Carlos Coello Coello. Evolutionary synthesis of logic functions using multiplexers. In C. Dagli, A. L. Buczak, and et al. , editors, Proceedings of the 10th Conference Smart Engineering System Design, pages 311–315, New York, 2000. ASME Press.
  4. R. L. Ashenhurst, "The decomposition of switching functions," in Proc. Int. Symp. Theory of Switching Functions, Apr. 1957, pp. 74–116.
  5. Astola, J. T. , Stankovi´c, R. S. , Fundamentals of Switching Theory and Logic Design, Springer, 2006.
  6. M. MORRIS MANO "Digital Logic and Computer Design" 2nd edition
  7. D. Nasib S. Gill, J. B. Dixit "Digital Design and Computer Organisation"
Index Terms

Computer Science
Information Sciences

Keywords

Multiplexers 2 x 1 4 x 1 8 x 1 multiplexers Shannon Theorem

Powered by PhDFocusTM