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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Prime and Essential Prime Implicants of Boolean Functions through Cubical Representation

by Saurabh Rawat, Anushree Sah
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 70 - Number 23
Year of Publication: 2013
Authors: Saurabh Rawat, Anushree Sah
10.5120/12204-7638

Saurabh Rawat, Anushree Sah . Prime and Essential Prime Implicants of Boolean Functions through Cubical Representation. International Journal of Computer Applications. 70, 23 ( May 2013), 1-6. DOI=10.5120/12204-7638

@article{ 10.5120/12204-7638,
author = { Saurabh Rawat, Anushree Sah },
title = { Prime and Essential Prime Implicants of Boolean Functions through Cubical Representation },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 70 },
number = { 23 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume70/number23/12204-7638/ },
doi = { 10.5120/12204-7638 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:33:36.080882+05:30
%A Saurabh Rawat
%A Anushree Sah
%T Prime and Essential Prime Implicants of Boolean Functions through Cubical Representation
%J International Journal of Computer Applications
%@ 0975-8887
%V 70
%N 23
%P 1-6
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

K Maps are generally and ideally , thought to be simplest form for obtaining solution of Boolean equations. Cubical Representation of Boolean equations is an alternate pick to incur a solution, otherwise to be meted out with Truth Tables, Boolean Laws and different traits of Karnaugh Maps. Largest possible k- cubes that exist for a given function are equivalent to its prime implicants. A technique of minimization of Logic functions is tried to be achieved through cubical methods. The main purpose is to make aware and utilise the advantages of cubical techniques in minimization of Logic functions. All this is done with an aim to achieve minimal cost solution.

References
  1. Fundamental of Digital Logic with Verilog Design by Stephen Brown and Zvonko Vranesic, tata mcgraw,2007,
  2. Mano, Morris M. (1991), Digital Design, Second Edition, Prentice-Hall of India Private Limited.
  3. Rajaraman, V. , Radhakrishnan, T. (2001), An Introduction to Digital Computer Design, Fourth Edition, Prentice-Hall of India Private Limited.
  4. Tanenbaum, A. S. (2004), Structured Computer Organization, Fourth Edition, Prentice-Hall of India Private Limited.
  5. Leach, D. P, Malvino, A. P. and Saha, G. (2006), Digital Principles and Applications, Second Edition, Tata McGraw-Hill.
  6. Wakerly, John F. (2005), Digital Design, Principles and Practices, Third Edition Updated, Ninth Indian Reprint, Pearson Education Inc.
  7. Crenshaw, Jack W. (2003), A primer on Karnaugh maps, Embedded Systems Design, Retrieved from http://www. embedded. com/columns/programmerstoolbox/16100908?_requestid=264392
  8. Kuphaldt, Tony R. (2007), Lessons in Electric Circuits, Volume IV – Digital, Fourth Edition, Available as part of the Open Book Project collection retrieved from: www. ibiblio. org/obp/electricCircuits
  9. E. J. McCluskey, "Minimization of Boolean Functions," Bell System Technical Journal, vol. 35, no. 5, pp. 1417-1444, 1956.
  10. Quine, W. V. (1952). "The Problem of Simplifying Truth Functions". The American Mathematical Monthly, Vol. 59, No. 8.
  11. T. Sasao, "Worst and Best Irredundant Sum-of–Product Expressions", IEEE Transactions on Computers, 50(9) (2001),pp. 935–947
  12. A. Mishchenco and T. Sasao, "Large-Scale SOP minimization Using Decomposition and Functional Properties", DAC 2003, June 2-6, pp. 149–154.
  13. P. P. Tirumalai and J. T. Butler, "Minimization Algorithms for Multiple-Valued Programmable Logic Arrays", IEEE Transactions on Computers, (1991), pp. 167–177.
  14. Y. Saad and M. H. Schultz, "Topological Properties of Hypercubes", IEEE Trans. on Comput. , (1988), pp. 867–872.
  15. E. W. Veitch, "A Chart Method for Simplifying Truth Functions", Proc. of the ACM, 1952, pp. 127–133.
  16. M. Karnaugh, "A Map Method for Synthesis of Combinational Logic Circuits", Trans. AIEE, Comm. and Electronics, (1953), pp. 593–599.
  17. M. R. Dagenais, V. K. Agarwal, and N. C. Rumin, "McBoole: A New Procedure for Exact Logic Minimization", IEEE Trans. on Computer-Aided Design, (1986), pp. 229–238.
  18. R. L. Rudell and A. Sangiovanni-Vincentelli, "Multiple-Valued Minimization for PLA Optimization", IEEE Trans. On Computer-Aided Design, (1987), pp. 727–750.
  19. R. K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. R. Wang, "MIS: A Multiple-Level Logic Optimization Systems", IEEE Trans. on Computer-Aided Design, (1987), pp. 1062–1081.
  20. K. A. Bartlett et al. , "Multilevel Logic Minimization Using Implicit Don't Cares", IEEE Trans. on Computer-Aided Design, (1988), pp. 723–740. ?irzat Kahramanli, Salih Güne?, Seral ?ahan, and Fatih Ba?çiftçi, The Arabian Journal for Science and Engineering, Volume 32, Number 1B April 2007 114
  21. H. Savoj, A. A. Malik, and R. K. Brayton, "Fast Two-Level logic Minimizers for Multi-Level Logic Synthesis", IEEE Int. Conf. on Computer Aided Design, 1989, pp. 426–429.
  22. R. K. Brayton and F. Somenzi, "Minimization of Boolean Relations", IEEE Int. Symp. on
Index Terms

Computer Science
Information Sciences

Keywords

K maps Boolean equations cubes.

Powered by PhDFocusTM