Examples on SOP and POS || Lesson 48 || Digital Electronics || Learning Monkey ||

1.9K views on YouTube

Wisdomers - Computer Science and Engineering 154 tutorials here

Electronics

Here we will try to solve Examples on SOP and POS.

Canonical Form:
In Boolean Algebra, Boolean Function or Switching function can be expressed as the Sum of the Products SOP or Product of the Sums POS.

The boolean function or switching function can be represented by using two methods.
1.The Sum of the Products SOP
2. Product of the Sums POS

The Sum of the Product method:

The product terms which contain all the variables either in complemented or uncomplemented form is called a minterm.
In the minterm, the variable with value 1 is represented in its true form and 0 is represented in its complemented form.
The Canonical Sum of the Products SOP representation uses the sum of all minterms of the switching function f for which f is 1.
The Sum of products is also called disjunctive normal form.

The Product of the Sums method:

The sum terms which contain all the variables either in complemented or uncomplemented form is called a maxterm.
In the maxterm, the variable with value 0 is represented in its true form and 1 is represented in its complemented form.
The Canonical Product of the Sums POS representation uses the product of all maxterm of the switching function f for which f is 1.
The Product of the Sums is also called conjunctive normal form.
The examples of SOP and POS are solved clearly.

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

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

Mail us @ learningmonkey01@gmail.com