DIGITAL SYSTEMS CALCULATORS


TOOL: FUNCTION TO CANONICAL FORMS CONVERTER


FUNCTION TO CANONICAL FORMS CONVERTER

Enter a Boolean Expression.


🞉 Sum of Minterms Form:

(AB')'(A+B'+C')+A(B+C') = A'B'C' + A'B'C + A'BC' + AB'C' + ABC' + ABC

= m0 + m1 + m2 + m4 + m6 + m7

= ∑(0,1,2,4,6,7)

🞉 Product of Maxterms Form:

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

= M3 · M5

= (3,5)

Copied to clipboard
Copy Text

INFORMATION

Sum of Minterms (SOP) Form:

The sum of minterms form of a Boolean function is a representation where the function is expressed as the logical OR (sum) of its minterms. Each minterm corresponds to a unique combination of inputs that results in a TRUE output for the function. This form provides a systematic way to represent Boolean functions and is useful for digital logic design, circuit analysis, and simplification techniques such as Karnaugh maps and Quine-McCluskey algorithm.

Product of Maxterms (POS) Form:

The product of maxterms form of a Boolean function is a representation where the function is expressed as the logical AND (product) of its maxterms. Each maxterm corresponds to a unique combination of inputs that results in a FALSE output for the function. This form is complementary to the sum of minterms form and provides another systematic way to represent Boolean functions, which is also useful for digital logic design and circuit analysis.

INPUT FORMAT

VARIABLES: Use letters such as A, B, C, x, y, z to represent the variables.

COMPLEMENT: To denote the complement of a variable or term, use the ' symbol to the right. For example, x' means "complement of x"; (x + y)' means "complement of x + y".

AND: There are three alternatives for representing the AND operation. You can use either the . or * symbol between variables. Furthermore, placing variables next to each other implies they are being ANDed. For instance, x.y, x*y, and xy all signify "x AND y".

OR: For OR operation use + symbol. For example, x + y means "x OR y".

WHAT IS FUNCTION TO CANONICAL FORMS CONVERTER?

Function to canonical forms converter,

  • Finds the sum of minterms representation of an entered Boolean function and
  • Finds the product of maxterms representation of the same function.

HOW TO USE THE FUNCTION TO CANONICAL FORMS CONVERTER?

You can use the function to canonical forms converter in two ways.

  • USER INPUTS

    Convert button

    You can enter a Boolean expression to the input box and click on the "CONVERT" button. The result and explanations appaer below the calculator.

  • RANDOM INPUTS

    random buttons

    You can click on the DIE ICON next to the input box. If you use this property, a random Boolean function is generated and entered to the calculator, automatically. You can see the result and explanations below the calculator. You can create your own examples and practice using this property.

  • CLEARING THE INPUT BOX

    Clear button

    To find the canonical representation of some other Boolean functions you can clear the input box by clicking on the CLEAR button under the input box.

  • COPYING & DOWNLOADING THE SOLUTION

    • Copy Link

      You can copy the generated solution by clicking on the "Copy Text" link, appaers under the solution panel.

    • Download Link

      Even you can download the solution as an image file with .jpg extension if you click on the "Download Solution" link at the bottom of the solution panel. You can share the downloaded image file.

 

CALCULATORS

Boolean Function Calculators