Feedback ? Send it to admin@fullchipdesign.com or join me at fullchip@gmail.com
Boolean Function in Sum of Minterms
Any boolean function can be represented in SOM by following a 2 step approach discussed below.
Step1: Represent the minterms for a function by decimal 1 in column 4 of table below. Refer minterms from here
Step2: Add (or take binary OR) all the minterms in column 5 of table to represent the function.
The Function of Minterms from above table is represented below
F = x’y’z + x’yz’ + xy’z + xyz’ + xyz
Example: Represent F = x + yz + xy in Sum of minterms.
F = x (y + y’)(z + z’) + yz (x + x’) + xy (z + z’)
= xyz + xyz’ + xy’z + xy’z’ + xyz + x’yz + xyz + xyz’
= xyz + xyz’ + xy’z + xy’z’ + x’yz
Answer. Digital basics tutorial from here
Binary number discussion, 1 and 2 complement discussion, and tutorials of logic design.
Binary arithmetic, Signed Magnitude, overflow, examples
Gray coding, Binary coded digital (BCD) coding, BCD addition
Digital logic gates basic (AND, OR, XOR, NOT) and derived (NAND, NOR and XNOR). Drive XOR from NAND gates. Drive XOR from NOR gates
Discussion of Boolean Algebra with examples.
Duality Principle, Huntington Postulates, Theorems of Boolean Algebra -
Readmemh, Readmemb. Random numbers
Memory Implementation -