Boolean Algebra and Logic Gates (Chapter 2)

2.1 - 2.2 Introduction, Basic Definitions

*Binary Operator - defined on a set S of element is a rule that assigns to each pair of elements from S, a
unique element from S.
*Set - of elements is any collection of objects usually having a common property.
2.3 Axiomatic Definition of Boolean Algebra
*In 1854, George Boole - Boolean Algebra
*In 1938, Claude E. Shannon - Switching Algebra (two-valued Boolean Algebra or Binary Logic)
*Boolean algebra - algebraic structure defined by a set of elements, B, together with two binary
operators (addition and multiplication).
Complement: x + x' = 1, x * x' = 0 (Baliktad!)
Distributive Law: x + (y*z) = (x + y) * (x + z) (Nadidistribute ang plus!)
2.4 Basic Theorems and Properties of Boolean Algebra
*Duality Principle: an important property of Boolean algebra that states that every algebraic expression
deducible from the postulates of Boolean Algebra remains valid if the
operators and the identity elements are interchanged.
*If true, replace AND with OR and replace 1's by 0's.
Basic Theorems:

2.5 Boolean Functions

*Literal = variable on each term
Skipped 2.6 to 2.7

CPE 004 Page 1

Gate-Level Minimization (Chapter 3 -Morris)

3.1 Introduction
Gate-level Minimization - is the design task of finding an optimal gate-level implementation of the Boolean
functions describing a digital circuit.
3.2 The Map Method
K-map (Karnaugh map) - a pictorial form of a truth table that provides a simple, straightforward procedure for
minimizing Boolean functions
*Diagram made up of squares with each square representing one minterm of the function that is to be
minimized.
*Any two adjacent squares in the map differ by only one variable.
Two Standard Forms:
1. Sum of Products
2. Product of Sums
2N where N = number of variables
2N = number of minterms or squares
*Minimum number of loops that cover all 1's or 0's.
*Function as a sum of minterms:
*Reminder on the variable!
3.3 Four-Variable K-Map
*Prime Implicant - product term obtained by combining the maximum possible number of adjacent squares in
the map
3.4 Product-of-Sums Simplification
*A consequence of DeMorgan's theorem.
*Product-Of-Sums = baliktad! Multiply instead na add / 1 ang prime instead na 0.
3.5 Dont Care Conditions
*Incompletely specified functions: functions that have unspecified outputs for some input combinations
*Don't Care Conditions: Unspecified minterms of a function
*Mga slots na regardless of its value wouldn't affect the purpose of the logical circuit.
*Don't Care minterm = combination of variables whose logical value is not specified

CPE 004 Page 2

Combinational Circuits (Chapter 4 - Morris)

4.1 Introduction

Two types of logic circuits:

1. Combinational circuit - outputs are determined from the present input combination.
a. Performs operation that can be specified logically by a set of Boolean function
b. Has logic gates with no feedback paths or memory elements.
2. Sequential circuits - employ storage elements in addition to logic gates = past and present input combination
4.2 Combinational Circuits
*Combinational circuit consists of an interconnection of logic gates.
- Transforms binary information from the given input data to a required output data.
- Normally available as IC circuits

*2n = Possible combinations

4.3 Analysis Procedure
*There should be no feedback paths!
-Feedback paths - is a connection from the output of one gate to the input of a second gate, whocse output forms part of the input to
the first gate.

4.4 Design Procedure

*Code converter circuit is a circuit that makes the two systems compatible even though each uses a different binary code.
Binary Coded Decimal to Excess 3 Code
- +3 to all outputs
Truth Table:

4.5 Binary Adder-Subtractor

*Augend + Addend = Sum + Carry
*Binary adder-subtractor - performs the arithmetic operations of addition and subtraction with binary numbers
CPE 004 Page 3

*Binary adder-subtractor - performs the arithmetic operations of addition and subtraction with binary numbers
*Half-Adder - addition of two bits. Two inputs and two outputs.(Sum and carry)

*Full-Adder - addition of three bits. Three inputs and two outputs. (Sum and carry)

4.8 Magnitude Comparator

*Magnitude Comparator: compares two numbers A and B and determines their relative magnitudes.
*The outcome of the comparison is specified by three binary variables that indicate whether A>B, A=B or A<B.
4.9 Decoders
Decoder: converts binary information from n input lines to a maximum of 2 n unique output lines.

*Straightforward values D0, D1, D2, ,D7 and its circuit diagram.

CPE 004 Page 4