Boolean functions is an expression with true binary
variables, the true binary operations (+,.) in unary operator, (NOT)
parenthesis and = sign. For a given value of variables, the functions can be
either 0 or 1. For e.g. F1=x.y.z’ represents F1=1 only if
x=1,y=1 and z=0 otherwise F1=0. A Boolean function may be
transformed from algebraic expression into a logic
diagram compared of AND,OR and NOT gate. The implementation of two functions F1
and F2 can be done using following.
 |
| Logic Diagram |
 |
| And Gate |
 |
| OR Gate |
 |
| NOT gate |
 |
| NAND gate |
 |
| NOR gate |
