Hazard Free Logic Minimization

According to our discussion in the class there isn’t exact way to find out hazard free function minimal form using Quine-McCluskey algorithm. But many exact logic minimization algorithms are based on the Quine-McCluskey algorithm. The Quine-McCluskey algorithm solves the two-level logic minimization problem.
It has three steps:
1. Generate the prime implicants of a function;
2. Construct a prime implicant table; and
3. Generate a minimal cover of this table.

In this paper by Steven M. Nowick you can find one of the two-level hazard-free logic minimization algorithm which is based on the constrained version of the Quine-McCluskey algorithm. Only certain implicants may be included in a hazard-free cover, and covering requirements are more restrictive.

Course Syllables and References

According to our first class with Dr.Alizadeh, course syllables of this course will be :
1. Introduction to logic design
2. Advanced topic to logic minimization
3.Introduction to Verilog HDL
4. Programmable logic design
5. Combinational logic circuits
6. Arithmetic logic circuit
7. Sequential logic circuit
8. FSM design and controller
9. Digital system design
10. Asynchronous circuit design
11. Introduction to formal verification
12. Introduction to Hardware/Software Co-design

The main reference book of this course is "Fundamental of digital logic with verilog design" :

The book and ebook version available in Fanni library also you can download ebook from here.

First post

Welcome to subsidiary blog for Advanced Logic Design class. Here you can find useful guides and references which one student, share for others.

Advanced Logic Design class arranged in spring 2008 semester at Shahed university, Tehran, Iran with Dr. B. Alizadeh Instructor.

If you are a member of our class, feel free to post here and share your valuable research result here.