Sear Digital Basics

Digital Basics
Page 1 of 2 Copyright 2010., Kacper Technologies Pvt Ltd. All Rights Reserved
Basic Review
Digital Electronics makes use of 2 states:

• Logic High, or ―1‖
• Logic Low, or ―0‖
Theorems
More Theorems
Basic Review
There are 3 basic digital gates:
• AND
• OR
• NOT
Basic Review
AND, where ALL inputs must be “1”
for the output to be “1”
OR, where ANY of the inputs can
be “1” for the output to be “1”
NOT (or the Inverter) where

the output is the opposite
(compliment) of the input.
Combinational Logic
A circuit that utilizes more that 1 logic function has

Combinational Logic.
As an example, if a circuit has an AND gate connected to

an Inverter gate, this circuit has combinational logic.
Combinational Logic
 How would your describe the output of this

combinational logic circuit?
NOR Gate
The NOR gate is the combination of the NOT gate with the
OR gate.
The Bubble in front of the gate is an inverter.
DeMorgan Symbol Equivalence
Bubble-pushing...
Likewise for OR
Alternate Gate symbols
Definitions:
 Literal --- a variable or complemented variable (e.g., X or X')
 product term --- single literal or logical product of literals (e.g., X or X'Y)
 sum term --- single literal or logical sum of literals (e.g. X' or (X' + Y))
 sum-of-products --- logical sum of product terms (e.g. X'Y + Y'Z)
 product-of-sums --- logical product of sum terms (e.g. (X + Y')(Y + Z))
Definitions:
normal term --- sum term or product term
in which no variable appears more than once
(e.g. X'YZ but not X'YZX or X'YZX'
(X + Y + Z') but not (X + Y + Z' + X))
minterm --- normal product term containing all variables (e.g. XYZ')
maxterm --- normal sum term containing all variables (e.g. (X + Y + Z'))
canonical sum --- sum of minterms from truth table rows producing a 1
canonical product --- product of maxterms from truth table rows

producing a 0
Karnaugh Map
 A Karnaugh Map is a grid-like representation of a truth table.
 A Karnaugh map has zero and one entries at different positions.
 Each position in a grid corresponds to a truth table entry.
A B C D
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
Example:
F = X’YZ’ + XZ + Y’Z
Basic Digital Chips
Digital Electronics devices are usually in a chip format.
The chip is identified with a part number or a model
number.
A standard series starts with numbers 74, 4, or 14.
• 7404 is an inverter
• 7408 is an AND
• 7432 is an OR
• 4011B is a NAND
Truth table vs. minterms & maxterms
Basic Digital Chips
Digital Electronics devices are usually in a chip format.
The chip is identified with a part number or a model
number.
A standard series starts with numbers 74, 4, or 14.
• 7404 is an inverter
• 7408 is an AND
• 7432 is an OR
• 4011B is a NAND
Chips
Basic logic chips often come in
14-pin packages.
Pin 14 Pin 8
Package sizes and styles vary.
Pin 1 is indicated with a dot or
half-circle
Numbers are read counter-
clockwise from pin 1 (viewed
from the top)
Pin 1 Pin 7
Chips – Specification Sheet
Voltage
The voltage and ground pins

must be connected for the
device to function. Check the
specification sheet to make
sure.
Ground
Chips – Specification Sheet
Combinational vs. Sequential Logic
Logic Logic
Circuit Circuit
(a) Combinational State
(b) Sequential
Output = f(In) Output = f(In, Previous In)
Combinational logic
• outputs logical functions of inputs new
outputs appear shortly after changed inputs
(propagation delay)
• no feedback loops
• no clock
Sequential logic
• outputs logical functions of inputs and previous
history of circuit (memory)
• after changed inputs, new outputs appear in
the next clock cycle
• frequent feedback loops
What is a state machine?
 A state machine is a different way of thinking about
computation
 A state machine has some number of states, and
transitions between those states
 Transitions occur because of inputs
 A ―pure‖ state machine only knows which state it is
in—it has no other memory or knowledge
• This is the kind of state machine you learn about in your
math classes
• When you program a state machine, you don’t have that
restriction
State machine I/O
State machines are designed to respond to a sequence of

inputs, such as
• The individual characters in a string
• A series of external events
 State machines may produce output (often as a result of
transitions)
 Alternatively, the ―result‖ of a state machine may be the state
it ends up in
Example
The following machine determines whether the number of As in a
string is even or odd
• Circles represent states; arrows represent transitions
A
start even odd

A
anything but A anything but A
 Inputs are the characters of a string

 The ―output‖ is the resultant state

Sear Digital Basics

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Sear Digital Basics

Uploaded by

Copyright:

Available Formats

Digital Basics

Digital Electronics makes use of 2 states:

There are 3 basic digital gates:

NOT (or the Inverter) where

A circuit that utilizes more that 1 logic function has

As an example, if a circuit has an AND gate connected to

 How would your describe the output of this

The Bubble in front of the gate is an inverter.

 sum-of-products --- logical sum of product terms (e.g. X'Y + Y'Z)

 product-of-sums --- logical product of sum terms (e.g. (X + Y')(Y + Z))

canonical product --- product of maxterms from truth table rows

The voltage and ground pins

(a) Combinational State

State machines are designed to respond to a sequence of

start even odd

anything but A anything but A

 Inputs are the characters of a string

You might also like