Branching Technique to Minimize Cyclic Functions | Lesson 78 | Digital Electronics | Learning Monkey

1.5K views on YouTube

Wisdomers - Computer Science and Engineering 154 tutorials here

Electronics

Here we will try to understand Branching Technique to Minimize Cyclic Functions.

Before understanding how to minimize the boolean function by branching technique we will understand what is a cyclic function?

Cyclic Function:

A function is said to be a cyclic function if there is no essential prime implicant in the respective K Map.

Properties of Cyclic Function:

Every Prime Implicant is of the same size.
Every minterm is covered at least by two prime implicants

Steps to minimize by Branching Technique:

Draw Prime Implicant Chart

Arbitrarily choose a prime implicant and mark that prime implicant.
Now delete the row of the Prime implicant and the corresponding column of its minterms.

Find all such prime implicants which are covered by other prime implicans and remove their corresponding rows.

Now follow the standard procedure for minimization by using prime implicant chart.

Link for playlists:
https://www.youtube.com/channel/UCl8x4Pn9Mnh_C1fue-Yndig/playlists

Link for our website: https://learningmonkey.in

Mail us @ learningmonkey01@gmail.com