Dept. of ECE, NIT Arunachal Pradesh, Yupia, 791112, India
This paper examines the generalized schemes of the breakup algorithm. It is possible to minimize multiple variable Boolean functions by breaking up into several groups. In the proposed generalized method, the number of group depends on user choice. The maximum element in each group depends on breaking point and it is quite easy to determine logic adjacency using look up table. Four point break or three point break are easily expressed as hexadecimal minterms and octal minterms respectively and both the techniques produce the same minimized results which are analyzed in this paper. A generalized Breakup Algorithm is also presented here for sequential and combinational logic circuit minimization.
Combinational circuit simplification;
Hexadecimal coded minterms;
Logic function simplification;
Octal coded minterms.
Sahadev Roy, “Breakup Algorithm for Switching Circuit Simplifications,” International Journal of Advanced Engineering and Management, Vol. 1, No. 1, pp. 1-11, 2016. https://doi.org/10.24999/IJOAEM/01010001
- E. W. Veitch, “A chart method for simplifying truth functions,” Transactions of the ACM Annual Meeting, pp. 127-133, 1952.
- R. W. Brooks, “Extension of the Veitch Chart Method in Computer Design,” Meeting of Association for Computing Machinery, Cambridge, Massachusetts, pp. 1-15, September, (1953).
- R. W. Brooks, “Symbolic logic, binary calculation, and 3C- PACS,” Computer Control Co. Inc, Wellesley, vol. 57, pp. 1-15, 1955. Available at: http://www.ddp116.org/products/pacs/logic_1955.pdf.
- M. Karnaugh, “The map method for synthesis of combinational logic circuits,” AIEE Committee on Technical Operations for presentation at the AIEE summer General Meeting, pp. 593-599, 1953.
- S. Roy and C. T. Bhunia, “A Set Combine Map Method for Manual Synthesis of Logic Circuits,” International Journal of Applied Engineering Research, vol. 11, no. 4, pp. 2663-2670, 2016.
- S. Roy and C. T. Bhunia, “On Synthesis of Combinational Logic Circuits,” International Journal of Computer Applications, vol. 127, no. 1, pp. 21-26, 2015.
- A. M. Rushdi, “Efficient Solution of Boolean Equations Using Variable-Entered Kamaugh Maps,” Engineering Sciences, vol. 15, no. 1, pp. 105-120, 2004.
- C. Y. Lee, “Representation of Switching Circuits by Binary-Decision Programs,” Bell Systems Technical Journal, vol. 38, pp. 985-999, 1959.
- S. B. Akers, “Binary Decision Diagrams,” IEEE Transactions on Computers, Vols. C-27, no. 6, pp. 509-516, June 1978.
- R. T. Boute, “The Binary Decision Machine as a programmable controller,” EUROMICRO Newsletter, vol. 1, no. 2, pp. 16-22, January 1976.
- R. E. Bryant, “Graph-based algorithms for boolean function manipulation,” IEEE Transactions on Computers, vol. 100, no. 8, pp. 677-691, 1986.
- G. Lee, “Logic synthesis for cellular architecture FPGAs using BDDs,” Design Automation Conference, 1997. Proceedings of the ASP-DAC’97 Asia and South Pacific, vol. IEEE, pp. 253-258, 1997.
- J. Wawrzynek, “EECS150-Digital Design: Lecture 5—Field Programmable Gate Arrays (FPGAs),” pp. 1-20, Feb. 4 Feb 4, 2002.
- G. Lee, “Logic synthesis for cellular architecture FPGAs using BDDs,” Design Automation Conference, 1997. Proceedings of the ASP-DAC’97 Asia and South Pacific, IEEE, pp. 253-258, 1997.
- R. Kumar, P. Kumar and R. Sahadev, “Efficient minimization Techniques for Threshold Logic Gate,” International Research Journal of Engineering and Technology, vol. 3, no. 4, pp. 1375-1382, 2016.
- S. Roy and C. T. Bhunia, “ Simplification of Switching Functions Using Hex-Minterms,” International Journal of Applied Engineering Research, vol. 10, no. 24, pp. 45619-45624, 2015.
- S. Yang, “Logic synthesis and optimization benchmarks user guide: version 3.0.,” Microelectronics Center of North Carolina (MCNC), 1991.