The week's pick
Reseach Article
Implementation of Boolean Functions through Multiplexers with the help of Shannon Expansion Theorem
| 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
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
- en. wikipedia. org/wiki/Multiplexer
- en. wikipedia. org/wiki/Shannon's_expansion
- 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.
- R. L. Ashenhurst, "The decomposition of switching functions," in Proc. Int. Symp. Theory of Switching Functions, Apr. 1957, pp. 74–116.
- Astola, J. T. , Stankovi´c, R. S. , Fundamentals of Switching Theory and Logic Design, Springer, 2006.
- M. MORRIS MANO "Digital Logic and Computer Design" 2nd edition
- D. Nasib S. Gill, J. B. Dixit "Digital Design and Computer Organisation"
Index Terms
Keywords