Main Article Content


There are many benefits to simplifying Boolean functions before they are implemented in hardware. A reduced number of gates decreases considerably the cost of the hardware, reduces the heat generated by the chip and, most importantly, increases the speed. But no method is effective for the simplification of Boolean functions, if it involves more than six variables. This paper presents a new manual method of simplification that can be effectively applied to problems with a large number of variables.



Tabulation method Map-tabulation Karnaugh map

Article Details

How to Cite
Ashfak Habib, A. H. M., Abdus Salam, M., Nadir, Z., & Goswami, H. (2004). A New Approach to Simplifying Boolean Functions. The Journal of Engineering Research [TJER], 1(1), 39–45.


  1. Biswas, N. N., 1986, “Computer-Aided Minimization Procedure for Boolean Functions,” IEEE Trans. On
  2. Computer Aided Design, Vol. CAD-5, no. 2, pp. 303-304.
  3. Biswas, N. N., 1971, “Minimization of Boolean Functions,” IEEE Trans. On Computers, pp. 925-929. Brayton, R. K., Hachtel, G. D., McMullen, C. T., and Sangiovanni-Vincentelli, A. L., (1985), “Logic Minimization Algorithems for VLSI Synthesis,” Kluver Academic Publishers.
  4. Hong, S. J., Gain, R. G., and Ostapko, D. L., 1974, “MINI: A Heuristic Approach for Logic Minimization,” IBM J. Res. Develop, Vol. 18, pp. 443-458.
  5. Karnaugh, M., 1953, “The Map Method for Synthesis of Combinational Logic Circuits,” Trans. AIEE. pt I, vol. 72, no. 9, pp. 593-599.
  6. Malik, A. A., Robert, K., Brayton, A., Newton., R., Alberto, L., and Vincentelli, S., 1988 “A Modified Approach to Two Mano, M. M., 1979, “Digital Logic and Computer Designm” Prentice-Hall: U.S.A, pp. 72-83,102-110.
  7. Rhyne, V. T., Noe, P. S., McKinney, M. H., and Pooch, U. W, 1977, “A New Technique for the first Minimization of Switching Functions,” IEEE Trans.
  8. On Computers, Vol. C-26, No. 8, pp. 757-764.45