Canonical Form is also called standard form, we directly obtained it from truth table and hence we have all the variable in normal or complimented form in each **minterm**.

There are 3 steps for conversion of minimal form to canonical form.

Conversion of Sum of Products (SOP) form to Canonical Form –

Set of rules are same as stated above.

**Example-1:**

Input : Y=A+B'COutput :(A.B.C)+(A.B.C')+(A.B'.C)+(A.B'.C')+(A'.B'.C)

**Explanation –**

**Step-1:**

Find the Total Number of variable present in minimal form like in this variables present are A, B, C.**Step-2:**

Find the variables absent in each term like in this in this variable absent in minterm(0) is B and C and variable absent in minterm(1) is A.**Step-3:**

Try to apply operation for converting min to canonical term using one(1) or zero(o) logic, In this case it is SOP form so we AND one(1) to each minterm where variables are absent in simple term if we multiply each minterm by one(1) then there is no effect on resultant equation so in this case, after that we replace one(1) by Sum (Variable +Complement of variable) then use Properties of switching algebra to solve further.

**Conversion steps –**

= A+B.C = (A.1)+(B.C.1) = (A.(B+B'))+((A+A').(B.C)) = ((A.B.C)+(A.B.C')+(A.B'.C)+(A.B'.C')+(A'.B'.C))

Conversion of Product of Sums(POS) form to Canonical Form –

Set of rules are same as stated above.

**Example-2:**

Input :Y=(A+B+C).(A'+C)Output :(A+B+C').(A'+C+B).(A'+C+B')

**Explanation –**

**Step-1:**

Find the Total Number of variable present in minimal form like in this variables present are A, B, C.**Step-2:**

Find the variables absent in each term like in this in this variable absent is C in maxterm(1)**Step-3:**

Try to apply operation for converting minimal to canonical term using one(1) or zero(o) logic, In this case it is POS form so we OR zero(0) to each maxterm where variables are absent in simple term if we add each maxterm by zero(0) then there is no effect on resultant equation so in this case, after that we replace zero(0) by Product(Variable * Complement of variable) then use Properties of switching algebra to solve further.

**Conversion steps –**

= (A+B+C).(A'+B) = (A+B+C').(A'+(B.B')+C) = (A+B+C').(A'+C+B).(A'+C+B')

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Canonical and Standard Form
- Conversion of Epsilon-NFA to NFA
- Analog to Digital Conversion
- Digital to Analog Conversion
- Conversion of Moore to Mealy machine (Set 9)
- Conversion of Moore to Mealy machine (Set 4)
- Program for Octal to Decimal Conversion
- Program for Decimal to Binary Conversion
- Program for Binary To Decimal Conversion
- Program for Decimal to Octal Conversion
- Flip-flop types, their Conversion and Applications
- Conversion of Binary number to Base 4 system
- Difference between Type Casting and Type Conversion
- Analog to Analog Conversion (Modulation)
- OSI Full Form
- POP Full Form
- Second Normal Form (2NF)
- Third Normal Form (3NF)
- DDR Full Form
- PCB Full Form

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.