﻿ Sum of Minterms for boolean functions in digital logic. SOM Examples or sum of Product Terms.      Custom Search Chip Designing for ASIC/ FPGA Design engineers and Students
FULLCHIPDESIGN
Digital-logic Design...  Dream for many students… start learning front-end…
@TYH :- 4G LTE Long Term Evolution Tutorial, CloudComputing Get Noticed:- Submit your own content to be published on fullchipdesign.com

Send it to 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 Digital Logic fundamentals topics @ fcd
Binary number discussion, 1 and 2 complement discussion, and tutorials of logic design.
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.
Binary Numbers 1s_complement 2s_complement Binary Subtraction Binary Sub. Ex's Sign_magnitude SignM EX Gray Coding BCD coding Digital gates NAND NOR & XNOR Theorems Boolean Functions BFunc Examples Minterm Maxterm Sum of Minterms Prdt of Maxterms 2 var K-map 3 var K-map 4 var K-map 5 var K-map Prime Implicant PI example K-map Ex's KMap minimization 2 var EX
Sum of Minterms or SOM is an equivalent statement of Sum of Standard products.
Truth Table of three variable example below.
PRODUCT of MAXTERMS Next ... Details on minterms and maxterms from here.
LTE - Long Term Evolution topics here