Fast Karnough map for simplification of complex Boolean functions

  • Authors:
  • Hazem M. El-Bakry

  • Affiliations:
  • Faculty of Computer Science & Information Systems, Mansoura University, Egypt

  • Venue:
  • ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper a new fast simplification method is presented. Such method realizes karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather than time one. It is proved mathematically and practically that the number of computation steps required for the presented method is less than that needed by conventional cross correlation. Simulation results using MATLAB confirm the theoretical computations.