Chapter Three

Common Digital Components

Outline
 Combinational circuits
 Half Adder
 Full Adder
 Decoder
 Encoder
 Multiplexer
 De-multiplexer
 Sequential Circuit
 Flip-flop
 Registers
 Types of Registers
 Memory Unit
 Combinational circuit
 Digital circuit are classified in to combinational and sequential circuits.
 A combinational circuit consists of input variables, logic gates, and output
variables.
 Many applications of digital logic require a circuit with multiple inputs and
outputs in which the outputs are uniquely determined by the current input values .
Such a circuit is called a combinational circuit.

 Combinational circuit: consists of logic gates whose out puts at any time
are determined directly from the present combination of input.

For each possible input Combination ,there is one and only one possible
output combination

Input Output
Combinational circuit variable
variable

Block diagram of combinational circuit 3

 combinational logic is about combining logic gates together to process two or
more Signals in order to produce at least one out put signals according to the
logical function of Each logic gate.
 Common combinational circuits made up from individual logic gates that carry
out a desired application include multiplexers, de- multiplexers , encoders, full
and half adders etc.
Classification of combinational logic circuit

Combinational circuit

Arithmetic $logical Data Code

function transmission converters

Adders , Multiplexers , de
multiplexers , Binary ,
subtractors ,
encoders , BCD
comparators
decoders 4
 Arithmetic circuit:- Adders

Adders
Digital computers perform variety of information processing tasks , the one is
arithmetic operations.
The Half Adder: A Half Adder is a combinational circuit with two binary inputs.
 It adds the two inputs (A and B) and produces the sum (S) and the carry (C)bits.

Ao Bo C1 So
0 0 0 0
A 0 1 0 1
C
Half adder 1 0 0 1
B S
1 1 1 0
Block diagram of half adder

A half-adder can be realized by using one X-OR gate and one AND gate

5
A Full-adder
 A full adder is a combinational circuit that forms the arithmetic sum of
three input bits. It consists of three inputs and two outputs.

x S x y z C S
y Full adder 0 0 0 0 0
z C
0 0 1 0 1
Block diagram 0 1 0 0 1
0 1 1 1 0
From the truth table, a circuit that will
1 0 0 0 1
produce the correct sum and carry bits in
response to every possible combination of 1 0 1 1 0
x,y and z is described by 1 1 0 1 0
__ _ _ _ _ 1 1 1 1 1
S=x y z +xyz +xyz +xyz
_ _ _
C=x y z+x y z+xyz+xyz Truth table 6
 Subtractor
1. Half Subtractor: half Subtractor is a logical circuit that
performs a subtraction operation on two binary digits.
 The half Subtractor produces a difference and a borrow bit.
x y D B X
D
Y

0 0 0 0 B
0 1 1 1
fig. Circuit diagram of
1 0 1 0 half subtractor
1 1 0 0

7
 Full subtractor
• The full subtractor is a combinational circuit with three input A,B,C
and two output D and B. X is the minuend ,Y is subtrahend ,Z is the
borrow produced by the previous stage ,D is the difference output
and B is the borrow output.

Block diagram

Truth table

Circuit diagram

8
 Data transmissions
Encoders
 Encoder is a digital circuit that performs the inverse operation of a decoder. An
encoder has (2the power of n) input lines and n output lines.
 It Can be developed using OR gates.
 The process of converting from familiar symbols or numbers to a coded format
is called Encoding.

2n input . encoder n output

.

Example, consider the 4-to-2 line encoder circuit. The four inputs are encoded into
2 outputs, each output representing one of the max terms of the 4-input variables.
Input out put
A B C D X Y
1 0 0 0 0 0 X=c+d
0 1 0 0 0 1 Y = b +d
0 0 1 0 1 0
9
0 0 0 1 1 1
 Decoders
 Decoders is a combinational circuit that converts binary information from n
inputs to maximum of (2 the power of n) unique out put lines.
 The process of converting from codded format to familiar symbols or numbers
is called decoding.

n input decoders n
2 output

Example consider the 2- to -4 line decoder circuit the two inputs are decoded
into four out puts, each out put representing one of the min terms of the 2-input
variables. The two inverters provide the complement of the inputs, and each one
of the four AND gates generates provides one of the min terms.

__ _
F0= XY F1=XY
_
F2= XY F3= XY
10
 multiplexers
 At the digital logic level a multiplexers is a circuit with (2 the power of n) data
inputs one data out put and n control inputs that select one of the data inputs.

 Multiplexer means transmitting a large number of information over a

smaller number of channels or lines.

 Some times it is also called a data selector, since it selects one of the many
inputs and steers the binary information to the output line.

 The size of multiplexer is specified by the number of (2 the power of n) of its

input line.

n MUX
Out put line
2 input line

n selected line

Block diagram representation of multiplexers

11
 De multiplexer
 De multiplexer(DEMUX) basically reverses the multiplexing
function. It takes digital information from one line and distributes it to a given
number of output lines.
 The de multiplexer is also known as a data distributor. The select input code
determines to which output the data input will be transmitted. In other words,
the de multiplexer takes one input data source and selectively distributes it to
1 of n output.

n input DEMUX
n
2 output

n selected line
Block diagram of de multiplexer

Code converter
 A code converter is a logic circuit that changes data presented in one type of
binary code to another type of binary code. 12
 Sequential circuit
 Sequential circuit contains a set of inputs and output(s). The output(s) of
sequential circuit depends not only on the combination of present inputs but
also on the previous output(s). Therefore, sequential circuits contain
combinational circuits along with memory (storage) elements.

Combinational circuit
input Out put

Memory element

Block diagram of sequential circuit

13
 Types of Sequential Circuits

The Following are the two types of sequential circuits

 Asynchronous sequential circuits
 Synchronous sequential circuits
Asynchronous sequential circuits
 Asynchronous sequential circuit are digital circuit in which the feedback to
the input for next out put generation is not governed by clock signal.
Synchronous sequential circuits
 Synchronous sequential circuit are digital sequential circuit in which the feed
back to the input for next out put generation is governed by clock signal.

14
 5v
Time period
0v

This signal stays at logic High (5V) for some time and stays at logic Low (0V) for
equal amount of time. This pattern repeats with some time period.
 Triggering
Types of Triggering
Following are the two possible types of triggering that are used in sequential
circuits
 Level triggering
 Edge triggering
 Level triggering
There are two levels, namely logic High and logic Low in clock signal.
Following are the two types of level triggering.
 Positive level triggering
 Negative level triggering

15
 Edge triggering
There are two types of transitions that occur in clock signal. That means, the
clock signal transitions either from Logic Low to Logic High or Logic High to Logic
Low.
Following are the two types of edge triggering based on the transitions of clock
signal.
 Positive edge triggering
 Negative edge triggering
Positive pulses

Positive edges Negative edges

 latches is a type of temporary storage device that has two stable

state .

16
 Types of latches
 1 S-R(Set-Reset) Latches Have two inputs S(set) and R(reset) and two
complementary outputs Q and Q’ When Q is HIGH, the latch is in SET state.
and
When Q is LOW, the latch is in RESET state.
Constructing RS latch using NOR gates
 When R=HIGH (and S=LOW) a the flip flop is in RESET state
 When S=HIGH (and R=LOW) a the flip flop is in SET state
 When both inputs are LOW a no change in the flip flop
 When both inputs are HIGH a Q and Q' both LOW (invalid)

S Q
_
R Q

17
 Constructing RS latch using NAND gates
 When S=HIGH(and R=LOW) a the flip flop is in SET state
 When R=HIGH (and S=LOW) a the flip flop is in RESET state
 When both inputs are LOW a no change in the flip flop
 Truth table
When both inputs are LOW a Q and Q' both LOW (invalid
SET RE SET _ STATE
Q Q
1 0 0 1 Set state
1 1 0 1
0 1 1 0 Re set
1 1 1 0
Block diagram
0 0 1 1 Un
defined
 2 Gated S-R latch =S-R latch + enable input (EN) and 2 NAND gates
Outputs change (if necessary) only when EN is HIGH.

18
 Flip flop
 Flip-flops are memory elements with clock, which change its state using
clock(CLK) signals.
 A flip-flop is edge triggered, whereas a latch is level triggered
 In many circuits it is necessary to sample the value on a certain line at a
particular instant in time and store it. In this variant, called a flip-flop, the state
transition occurs not when the clock is 1 but during the clock transition from 0
to 1 (rising edge) or from 1 to 0 (falling edge) instead.
RS flip-flop consisting of a basic flip-flop circuit plus two additional NAND
gates and a clock pulse(CP) input. RS-flip-flops has three inputs set(S) ,reset(R)
and clock(Clk) and two outputs Q and Q’

+ve
edge

-ve
edge
19
 When CP(clock pulse) is 1 and D(data) is 1, the Q output goes to 1, placing the
circuit in the set state.
 When CP(clock pulse) is 1 and D(data is 0, the Q output goes to 0, placing the
circuit in the reset state

20
 RS Flip-Flop
• A RS flip-flop consisting of a basic flip-flop circuit plus two additional
NAND gates and a clock pulse(CP) input.
• They provide a simple switching function whereby a pulse on one
input line of the flip flop sets the circuit in one state. Further pulses
on this line have no effect until the RS flip flop is reset.
• RS-flip-flops has three inputs set(S) ,reset(R) and clock(Clk) and two
outputs Q and Q’ .
Logic circuit diagram of RS flip-flop

21
 D(Data/Delay) Flip-flop
 The D flip-flop consisting of a basic flip-flop circuit plus two additional
NAND, Inverter gate and a clock pulse(CP) input.
 The D flip-flop has only two inputs: D(data/delay) and CP(clock
pulse), and two outputs Q and Q’ . The D inputs goes directly to the S
input and its complement is applied to the R input.

Logic circuit diagram

Block diagram

22
 JK Flip-Flop
• The JK flip flop is basically a gated SR flip flop with the addition of a
clock input circuitry that prevents the illegal or invalid output
condition that can occur when both inputs S and R are equal to logic
level “1”.
• The JK flip-flop constructed with two cross-coupled NOR gates plus
two AND gates and Clock(CP) inputs.

23
 T(Toggle) Flip-Flop
•The T flip-flop switches to its complement(opposite) state this state we
call it toggle operation state, that is, if Q = 1, it switches to Q’ = 0, and
vice versa.
• It can be made from a JK flip flop by tying both of its inputs high.

Circuit Diagram Block Diagram

24
 Registers
• Register is quickly accessible location available to a computer’s
central processing unit(CPU).
• Register are used to quickly accept, store, and transfer data and
instructions that are being used immediately by the CPU.
• Almost all computers, load data from a larger memory into registers
where it is used for arithmetic operations and is manipulated or
tested by machine instructions. Manipulated data is then often
stored back to main memory.

• Processor registers are normally at the top of the memory hierarchy,

and provide the fastest way to access data.
• A register may hold an instruction, a storage address, or any kind of
data (such as a bit sequence or individual characters).
25
 Types of Registers
• There are various types of Registers those are used for various
purpose.
• Among of the some mostly used registers named as
 MAR: Memory Address Register
 AC: Accumulator.
 DR: Data Register.
 AR: Address Register.
 PC: Program Counter.
 MDR: Memory Data Register.
 Index register
 Memory buffer register

26
Memory
o Memory is an essential component of a digital computer. It is a storing
device.
o It stores programs, data, results etc. At present the following three kinds
of memory are commonly used in modern computers:
(i) Semiconductor memory
(ii) Magnetic memory
(iii) Optical memory
o semiconductor memory is faster, compact and lighter. It consumes less
power.
o The magnetic and optical memory are slow compared to semiconductor
memory. But they are cheaper than semiconductor memory.
o The semiconductor memory is employed as the main memory (or primary
memory) of the computer.
o The magnetic memory is used as secondary (or auxiliary) memory.

27
There are two types Semiconductor memories
1. RAM (random access memory).
 is the central storage unit in a computer system.
 The data stored in RAM is lost if the power to the IC
(Integrated circuit ) chip is disconnected.
 RAM is volatile memory, which means that it requires a steady
flow of electricity to maintain its contents.
 Types of RAM
• Static RAM (SRAM)
 The information remains stored as long as power is applied to
the chip, unless the same location is written again.
• Dynamic RAM (DRAM)
 The data stored at each location must be periodically
refreshed by reading it and the writing it back again, or else it
disappears.
28
2. ROM (read only memory).
 is a special type of memory which can only be read and contents of which
are not lost even when the computer is switched off.
 Types of ROM
 PROM(Programmable ROM.)
o Its contents are decided by the user. The user can store permanent
programs.
o the user can write his information in a PROM only once.
 EPROM(Erasable PROM.)
o allows a user to erase the information stored on the chip and reprogram it
with new information.
• To erase an EPROM, we can simply expose the device to a strong source of
ultraviolet light.
 EEPROM electrically erasable PROM)
• the erase operation is accomplished electrically, rather than by exposure
to ultraviolet light.

29