M. A. J. Kolsteren

Learn More
In this paper we propose a divide and conquer strategy for the calculation of hazard free prime implicants. It is capable of calculating all hazard free prime implicants but it can be restricted to calculate only those primes that can possibly contribute to a solution. We show that this significantly reduces the number of generated primes, and thus reduces(More)
In this paper we introduce the first divide and conquer algorithm that is capable of exact hazard-free logic minimization in a constructive way. We compare our algorithm with the method of Dill/Nowick, which was the only known method for exact hazard-free minimization. We show that our algorithm is much faster than the method proposed by Dill/Nowick by(More)
  • 1