SOP Vs POS in Digital Logic
Representation of Boolean expression can be primarily done in two ways. They are as follows:
- Sum of Products (SOP) form
- Product of Sums (POS) form
NOTE
If the number of input variables are n, then the total number of combinations in Boolean algebra is 2n.
If the input variable (let A) value is :
- Zero (0) – a is LOW -It should be represented as A’ (Complement of A)
- One (1) – a is HIGH -It should be represented as A
In Boolean logic,
AND is represented as '.' A AND B is written as 'A.B' OR is represented as '+' A OR B is written as 'A+B'
For example, Considering number of input variables =3, Say A, B and C.
Total number of combinations are: 23=8.
Truth Table Representation
A | B | C |
---|---|---|
0 | 0 | 0 |
0 | 0 | 1 |
0 | 1 | 0 |
0 | 1 | 1 |
1 | 0 | 0 |
1 | 0 | 1 |
1 | 1 | 0 |
1 | 1 | 1 |
Difference between SOP and POS in Digital Logic
In digital logic, the inputs and output of a function are in the form of binary numbers (Boolean values) i.e., the values are either zero (0) or one (1). Therefore, digital logic is also known as ‘Boolean logic’. These inputs and output can be termed as ‘Boolean Variables’. The output Boolean variable of a digital signal can be expressed in terms of input Boolean variables which forms the ‘Boolean Expression’.
Table of Content
- SOP Vs POS
- What is SOP?
- What is POS?
- Differences
Contact Us