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

On Synthesis of Combinational Logic Circuits

by Sahadev Roy, Chandan Tilak Bhunia
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 127 - Number 1
Year of Publication: 2015
Authors: Sahadev Roy, Chandan Tilak Bhunia
10.5120/ijca2015906311

Sahadev Roy, Chandan Tilak Bhunia . On Synthesis of Combinational Logic Circuits. International Journal of Computer Applications. 127, 1 ( October 2015), 21-26. DOI=10.5120/ijca2015906311

@article{ 10.5120/ijca2015906311,
author = { Sahadev Roy, Chandan Tilak Bhunia },
title = { On Synthesis of Combinational Logic Circuits },
journal = { International Journal of Computer Applications },
issue_date = { October 2015 },
volume = { 127 },
number = { 1 },
month = { October },
year = { 2015 },
issn = { 0975-8887 },
pages = { 21-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume127/number1/22694-2015906311/ },
doi = { 10.5120/ijca2015906311 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:18:44.789457+05:30
%A Sahadev Roy
%A Chandan Tilak Bhunia
%T On Synthesis of Combinational Logic Circuits
%J International Journal of Computer Applications
%@ 0975-8887
%V 127
%N 1
%P 21-26
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Objective of this paper is to present historiography of logic switching circuits. The research mainly focuses on chronological development and application of logic in the field of electronic and computer applications. This paper briefly discussed on the basic needs of logic synthesis and also discuss few interesting facts and design consideration regarding logic synthesis. It also enhances student’s deep understanding of different logic function minimization technique during a lecture and practical implementation.

References
  1. James A. Ryan. 1996. Leibniz' Binary System and Shao Yong's "Yijing". Philosophy East and West, Vol. 46, No. 1, 59-90.
  2. Aschoff, V., "The early history of the binary code," in IEEE Communications Magazine, vol.21, no.1, (Jan. 1983), 4-10.
  3. Peirce, Charles Sanders. "On the algebra of logic: A contribution to the philosophy of notation." in American journal of mathematics, (1885), Vol. 7 No. 2, 180-196.
  4. Boole, George, "The mathematical analysis of logic," in Philosophical Library, (1847).
  5. Marquand, Allan, "A new logical machine," in Proceedings of the American Academy of Arts and Sciences, John Wilson and Son (1885), 303-307.
  6. Sheffer, Henry Maurice, "A set of five independent postulates for Boolean algebras, with application to logical constants." in Transactions of the American Mathematical Society (1913), Vol. 14, No. 4, 481-488.
  7. Computer Museum. Computer museum of America. Available at http://history compuer.com/Modern Computer/thinkers/Stanhope.html last seen July (2015).
  8. Peirce, Charles Sanders. "Writings of Charles S. Peirce: 1857-1866" (1982) vol. 1. Indiana University Press.
  9. Computer Museum. Computer museum of America. http://history-computer.com/ModernComputer/thinkers/Peirce.html last seen (July 2015).
  10. Almond B. Stronger, Automatic telephone-exchange. U.S. Patent No. 447,918. 10 Mar. (1891).
  11. Jess, Jochen AG. "Designing electronic engines with electronic engines: 40 years of bootstrapping of a technology upon itself." in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, (2000) Vol.19 No.12 , 1404-1427.
  12. C.E. Shannon, “A symbolic analysis of relay and switching circuits,” in Trans. of the American Institute of Electrical Engineers, ( 1938) Vol. 57, No. 12, 713-723.
  13. M. M. Irvine, "Early Digital Computers at Bell Telephone Laboratories." in IEEE Annals of the History of Computing, (2001), Vol.23 No. 3, 22-42.
  14. Karnaugh, M., "The map method for synthesis of combinational logic circuits," Transactions of the Communication and Electronics, American Institute of Electrical Engineers, Part I: Nov. (1953), Vol.72, No.5, 593-599.
  15. F. Dartu, N. Menezes, J. Qian, L.T. Pillage, “A gate-delay model for high-speed CMOS circuits,” Proc. ACM. 31st annual Design Automation Conference (DAC '94), June (1994) 576-580. doi:10.1145/196244.196562.
  16. Y. Matsunaga, “An efficient equivalence checker for combinational circuits,” Proceedings of the 33rd annual Design Automation Conference, DAC '96 (1996),629-634.doi: 10.1109/DAC.1996.545651.
  17. S. Roy and C.T. Bhunia, “Constraints Analysis for Minimization of Multiple Inputs Logic Programming,” in Elsevier Proc. of International Conference on Signal and Speech Processing (ICSSP-14), Aug. (2014), 61-64, Kollam, India.
  18. K. P. Parker and E. J. McCluskey, “Probabilistic treatment of general combinational networks,” IEEE Trans. Computers, June (1975), vol. C-24, 668-670.
  19. K. Fant and S.A. Brandt, “Null Conventional Logic: A Complete and Consistent Logic for Asynchronous Digital Circuit Synthesis,” Proc. Int’l Conf. Application-Specific Systems, Architectures and Processors (ASAP 96), IEEE CS Press, (1996) Los Alamitos, Calif. 261-273.
  20. S.M. Nowick and D.L. Dill. “Exact two-level minimization of hazard-free logic with multiple-input changes,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems,(1995) ,vol. 14, no. 8, 986-997.
  21. T. Sasao, “Multi-Level Logic Synthesis, “Switching Theory for Logic Synthesis, Springer US, (1999), 229-261.
  22. Jim Stiles, “Power Dissipation,” The Univ. of Kansashttp://www.ittc.ku.edu/~jstiles/312/handouts/Power%20Dissipation.pdf.2014.
  23. Veitch, Edward W. "A chart method for simplifying truth functions." In Proceedings of the 1952 ACM national meeting (Pittsburgh), (1952), 127-133.
  24. R. W. Brooks, "Extension of the Veitch Chart Method in Computer Design," meeting of Association for Computing Machinery, Cambridge, Massachusetts, September, (1953), 1-15. Available at http://www.ddp116.org/products/pacs/logic_1955.pdf
  25. R. W. Brooks: Symbolic logic, binary calculation, and 3C- PACS, published by Computer Control Co. Inc., 93 Broad St., Wellesley 57, Mass. (1955). Available at: http://www.ddp116.org/products/pacs/logic_1955.pdf.
  26. Willard V. Quine. "A way to simplify truth functions." American mathematical monthly, (1955), 627-631.
  27. P.Tison, "Generalization of Consensus Theory and Application to the Minimization of Boolean Functions," , IEEE Transactions on Electronic Computers, Aug. (1967) vol. EC-16, no.4, 446-456, doi: 10.1109/PGEC.1967.264648.
  28. McCluskey, Edward J. "Minimization of Boolean Functions." Bell system technical Journal, (1956), Vol. 35, No.6, 1417-1444.
  29. Caldwell, S. H. "The recognition and identification of symmetric switching functions." American Institute of Electrical Engineers, Part I: Transactions of the Communication and Electronics, (1954), Vol.73 No.2, 142-147.
  30. McCluskey, E. J. "Detection of Group Invariance or Total Symmetry of a Boolean Function." Bell System Technical Journal, (1956), Vol.35. No.6, 1445-1453.
  31. Franz H,. "Some mathematical aspects of switching." American Mathematical Monthly, (1955), 75-90.
  32. Ryszard S Michalski. "Recognition of total or partial symmetry in a completely or incompletely specified switching function," Proceedings of the IV Congress of the International Federation on Automatic Control (IFAC), June 16-21, (1969),Vol. 27, 109-129.
  33. S.R. Das, "On detecting total and partial symmetry of switching functions," Proceedings of the IEEE, May (1970),Vol.58, No.5, 840-841. doi: 10.1109/PROC.1970.7777.
  34. Raymond J. Nelson, "Simplest normal truth functions," The Journal of Symbolic Logic, (1955),Vol. 20, 105-108. doi:10.2307/2266893.
  35. J.R. Slagle, Chin-Liang Chang; R.C.T Lee, "A New Algorithm for Generating Prime Implicants," IEEE Transactions on Computers, April (1970), Vol.C-19, No.4, 304-310. doi: 10.1109/T-C.1970.222917.
  36. S.R., Das, "Comments on " A New Algorithm for Generating Prime Implicants",", IEEE Transactions on Computers, Dec. (1971), vol.C-20, no.12, 1614-1615,. doi: 10.1109/T-C.1971.223185.
  37. J. P. Roth, "Algebraic topological methods for the synthesis of switching systems. I." Transactions of the American Mathematical Society, (1958), 301-326.
  38. S.R. Das, N.S. Khabra, "Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions," IEEE Transactions on Computers, Nov. (1972), Vol.C-21, No.11, 1239-1246. doi: 10.1109/T-C.1972.223484.
  39. D. C Schmidt, L. E. Druffel, " An extension of the clause table approach to multi-output combinational switching networks" IEEE Transactions on Computers, (1974), Vol. 23, No. 4, 338-346.
  40. Randal E Bryant, "Graph-based algorithms for Boolean function manipulation.", IEEE Transactions on Computers, (1986), Vol.100, no. 8, 677-691.
Index Terms

Computer Science
Information Sciences

Keywords

Boolean function Combinational logic Digital electronics Maxterm Minimization Minterms Multiple inputs Switching circuit simplification.

Powered by PhDFocusTM