Lecture 6
Product-of-Sums Simplification
K-map has been used to simplify Boolean functions in
sum-of-product form.
The result can be converted to product-of-sums form by
using De Morgans Law using the following procedures:
Example 2
Boolean function based on truth table:
F ( x, y, z ) (1,3,4,6)
F ( x, y, z ) (0,2,5,7)
K-map simplification:
F x' z xz'
F ' xz x' z '
F ( x' z ' )( x z )
Dont-Care Conditions
In most cases, the values of Boolean functions are defined
as either 1 or 0.
For some applications, the Boolean functions are
undefined or unknown for some minterms.
Gate-Level Implementations
Based on sum-of-products form: F B' D'B' C' A' C' D
Four-Level Realization of Z
Example
Implement the following Boolean function with NAND
gates: F ( x, y, z) (1,2,3,4,5,7)
NOR Gates
Any logic circuits can be implemented with NOR gates
and Inverters.
Example
Implement the following Boolean function with two-level
forms of (AND-NOR, NAND-AND, OR-NAND, NOROR) F ( x, y, z) (1,6)
Simplification using K-map:
Two-level Implementations
Different forms of two-level implementations:
x x 0
A B B A
x x' 1
( A B) C A ( B C ) A B C
Odd Function
Boolean function of a three-variable odd function:
F ( A, B, C ) AB' C ' A' BC ' ABC A' B' C
(1,2,4,7)
K-map:
Implementation:
Parity Checking
Parity bit: additional bit generated with binary data to
make the number of 1s either odd or even prior to the
transmission.
Parity checking: checking the parity (number of 1s) at the
receiver.
Even-Parity generator: generating one parity bit to make
the total number of 1s even before transmission.
3-bit even-parity generator (truth table & circuit):
Parity Checker
Parity Checker at receiver: If there is a transmission (one
bit) error, the output is 1; otherwise, the output is zero.
3-bit parity checker: C x y z P