Logic functions minimization algorithm based on recognition of essential prime implicants

This paper presents a logic optimization algorithm of based on the recognition of essential prime implicants. According to input products, we work out complement sets matrix of non-shared products, blocking matrix, covering matrix. We give the recognizing method of essential primes E and relative redundancies P and complete redundancies implication R of multi-input-output logic functions. This paper algorithm is an improved synthesized algorithm based on algorithm of Espresso, Vanilla and Beister. We design a program that is according to algorithm of based on the recognition of essential primes. It overpasses testing of Benchmark and right validate based on computer of Pentium 1.8 GHZ CPU and 512 MBRAM.