ECPE 2504
Introduction to Computer Engineering

Examples: Combinational Logic and Boolean Algebra
Part 4. Simplification Through Algebraic Manipulation


The initial expression can be simplified by applying the basic identities of Boolean algebra. A transformation based on one identity is performed in each step below.

The first part of the reduction:

Algebraic reduction of F (part 1)

The final part of the reduction:

Algebraic reduction of F (part 2)


Determine the identify used at each step. Refer to Table 1-1 in Computer Systems Architecture, 3rd edition, by M. Morris Mano.


Previous Introduction Next

Comments to: midkiff@vt.edu
Last updated: January 25, 2000
http://fiddle.visc.vt.edu/courses/ecpe2504/combinational/logic_04.html
© 1996, 2000, Scott F. Midkiff