CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm

by Arunachalam Solairaju, Rajupillai Periyasamy
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 15 - Number 7
Year of Publication: 2011
Authors: Arunachalam Solairaju, Rajupillai Periyasamy
10.5120/1959-2621

Arunachalam Solairaju, Rajupillai Periyasamy . Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm. International Journal of Computer Applications. 15, 7 ( February 2011), 28-32. DOI=10.5120/1959-2621

@article{ 10.5120/1959-2621,
author = { Arunachalam Solairaju, Rajupillai Periyasamy },
title = { Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { February 2011 },
volume = { 15 },
number = { 7 },
month = { February },
year = { 2011 },
issn = { 0975-8887 },
pages = { 28-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume15/number7/1959-2621/ },
doi = { 10.5120/1959-2621 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:03:32.735245+05:30
%A Arunachalam Solairaju
%A Rajupillai Periyasamy
%T Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 15
%N 7
%P 28-32
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

It is well known that the Karnaugh-map technique is an elegant teaching resource for academics and a systematic and powerful tool for a digital designer in minimizing low order Boolean functions. Why is the minimization of the Boolean expression needed? By simplifying the logic function, we can reduce the original number of digital components (gates) required to implement digital circuits. Therefore, by reducing the number of gates, the chip size and the cost will be reduced and the computing speed will be increased. The K-map technique was proposed by M. Karnaugh . Later Quine and McCluskey reported tabular algorithmic techniques for the optimal Boolean function minimization. Almost all techniques have been embedded into many computer aided design packages and in all the logic design university textbooks. In the present work, a well known modeling language, the object oriented technique is used for designing an Object-oriented model for Karnaugh map with the help of digital gates. An Object-oriented algorithm is also proposed for simplification of boolean functions through K-map. The Unified Modeling Language stereotypes and class diagrams are presented and performance of Unified Modeling Language model is analyzed.

References
  1. C.Y. Lee, ‘‘Representation of Switching Circuits by Binary-Decision Programs’’, Bell System Technical Journal, Vol. 38, July 1959, pp. 985-999.
  2. S.B. Akers, ‘‘Binary Decision iagrams’’, IEEE Transactions on Computers, Vol. C-27, No. 6, June 1978,pp. 509-516.
  3. M.R. Garey and D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP- Completeness, Freeman, New York, 1979.
  4. F.J. Hill and G.R. Peterson, Introduction to Switching Theory and Logical Design, Wiley, New York, 1974.
  5. J.P. Roth, Computer Logic, Testing, and Verification, Computer Science Press, Potomac, MD., 1980.
  6. R. Brayton, et al, ‘‘Fast Recursive Boolean Function Manipulation’’, International Symposium on Circuits and Systems, IEEE, Rome, Italy, May 1982, pp. 58-62.
  7. B.M.E. Moret, ‘‘Decision Trees and Diagrams’’, ACM Computing Surveys, Vol. 14, No. 4, December 1982,pp. 593-623.
  8. OMG, UML Superstructure specification, v2.0, Retrieve from http://www.omg.org/cgi-bindoc?formal/05-07-04.
  9. Booch, G., Rumbaugh, J., Jacobson, I. (2004), The Unified Modeling Language User Guide, welfth Indian Reprint, Pearson Education.
  10. Roff, T. (2006), UML: A Beginner’s Guide, Tata McGraw-Hill Edition, Fifth Reprint.
  11. Gomaa, H. (2001), Designing Concurrent, Distributed, and Real-Time Applications with UML, Proceedings of the 23rd International Conference on Software Engineering ICSE’01), IEEE Computer Society.
  12. Schattkowsky, Tim (2005), UML 2.0 - Overview and Perspectives in SoC Design, IEEE.
  13. Saxena, V., Arora D. and Ahmad S. (2007), Object Oriented Distributed Architecture System through UML, IEEE International Conference on Advanced in Computer Visio and Information Technology, ACVIT-07, Nov. 28-30, ISBN 978- 81-89866-74-7, 305-310.
  14. Kohut, R., Steinbach, B., and Fröhlich, D. (), FPGA Implementation of Boolean Neural Networks using UML.
  15. Damasevicius, R., Stuikys, V. (2004), Application of UML for Hardware Design Based on Design Process Model, IEEE.
  16. Al-Rababah Ahmad, A. (2009), UML - Models Implementations in Software Engineering System Equipments Representations, International Journal of Soft Computing Applications, Issue 4,25-34, Euro Journals Publishing, Inc.,Retrieved from http:/www. eurojournals.com / IJSCA. html
  17. Sun, Zhenxin, Wong, Weng-Fai, Zhu, Yongxin and Pilakkat, Santhosh Kumar (2005), Design of Clocked Circuits Using UML, IEEE ASP-DAC 2005 (901-904).
  18. S. Fortune, J. Hopcroft, and E.M. Schmidt, ‘‘The Complexity of Equivalence and Containment for Free Single Variable Program Schemes’’, in Automata, Languages, and Programming, Goos, Hartmannis, Ausiello, and Boehm, eds., Springer-Verlag, Lecture Notes in Computer Science, Vol. 62, 1978, pp.227-240.
  19. Crenshaw, Jack W. (2003), A primer on Karnaugh maps, Embedded Systems Design, Retrieved from http://www.embedded.com columns/programmerstoolbox / 16100908 ? Requested = 264392 .
  20. Kuphaldt, Tony R. (2007), Lessons in Electric Circuits, Volume IV – Digital, Fourth Edition, and Available as part of the Open Book Project collection retrieved from:
  21. H. Abelson, and P. Andreae, ‘‘Information Transfer and Area-Time Trade-Offs for VLSI Multiplication ’’, Communications of the ACM, Vol. 23, No. 1, January 1980, pp. 20-23.
  22. Vipin Saxena, Manish Shrivastava and Deepak Arora , International” Graph-Based Algorithms”, Journal of Computer Science and Network Security, for Boolean Function VOL.9 No.6, June 2009
Index Terms

Computer Science
Information Sciences

Keywords

Object-oriented Model Karnaugh map Boolean functions Minterm Boolean functions symbolic manipulation binary decision diagrams logic design verification

Powered by PhDFocusTM