A boolean Function is a form of an algebraic form of Boolean Expression. It consists of n-variables which are represented as f(x1, x2, x3……, xn). Through the use of various Boolean laws and theorems, it is categorised into three digital circuits known as:

• Sum-of-Products (SOP) form

• Product-of-sums (POS) form

• Canonical Form