SlideShare a Scribd company logo
1 of 40
2 bit comparator, 4:1 Multiplexer, 1: 4 Demultiplexer, Flip Flops
and Registers
Ms.Mary Jacob, Asst.Professor
Kristu Jayanti College (Autonomous),Bangalore
Magnitude Digital Comparator
ØA magnitude digital comparator is a combinational circuit
that compares two digital or binary numbers - 2 n bit
words in order to find out whether one binary number is
equal, less than or greater than the other binary number.
ØCircuit will have two inputs one for A(n bits) and other for
B (n bits) and have three output terminals, for A > B
condition, A = B condition and A < B condition.
Magnitude Digital Comparator- Block Diagram
1-Bit Magnitude Comparator
A comparator used to compare two bits is called a single bit comparator.
It consists of two inputs each for two single bit numbers and three outputs to
generate less than, equal to and greater than between two binary numbers.
The truth table for a 1-bit comparator is
Logical expressions for each output can be
expressed as :
A > B : AB'
A < B : A'B
A = B : A'B' + AB
1-Bit Magnitude Comparator
Using the Logical expressions the circuit can be drawn as :
A > B : AB'
A < B : A'B
A = B : A'B' + AB
2-Bit Magnitude Comparator
A comparator used to compare two binary numbers each of two bits is called a 2-bit magnitude
comparator. It consists of four inputs and three outputs to generate less than, equal to and greater than
between two binary numbers.
The truth table for a 2-bit comparator is :
2-Bit Magnitude Comparator
Logical Expression from the truth table is :
A > B : A1 B1’ + A0 B1’ B0’ + A1 A0 B0’
A = B : A1’ A0’ B1’ B0’ + A1’ A0 B1’ B0 + A1 A0 B1 B0 + A1 A0’ B1 B0’
: A1’ B1’ (A0’ B0’ + A0 B0) + A1 B1 (A0 B0 + A0’ B0’)
: (A0 B0 + A0’ B0’) (A1 B1 + A1’ B1’)
: (A0 Ex-Nor B0) (A1 Ex-Nor B1)
A < B : A1’ B1 + A0’ B1 B0 + A1’ A0’ B0
2-Bit Magnitude Comparator
2-Bit Magnitude Comparator
Applications of Comparators :
1. Comparators are used in central processing units (CPUs) and
microcontrollers (MCUs).
2. These are used in control applications in which the binary numbers
representing physical variables such as temperature, position, etc. are
compared with a reference value.
3. Comparators are also used as process controllers and for Servo motor
control.
4. Used in password verification and biometric applications
Multiplexer
Multiplexer is a combinational circuit that has maximum of 2n data inputs, ‘n’
selection lines and single output line. One of these data inputs will be
connected to the output based on the values of selection lines.
Since there are ‘n’ selection lines, there will be 2n possible combinations of
zeros and ones. So, each combination will select only one data input.
Multiplexer is also called as Mux.
Multiplexer- 4:1
4x1 Multiplexer has four data inputs I3, I2, I1 & I0, two selection lines s1 & s0
and one output Y.
One of these 4 inputs will be connected to the output based on the combination
of inputs present at these two selection lines
The block diagram of 4x1 Multiplexer is Truth table of 4x1 Multiplexer is
The logical expression from the truth table is :
Multiplexer- 4:1 - Circuit Diagram
Demultiplexer
Ø A De-multiplexer is a combinational circuit that has only 1 input line
and 2N output lines.
Ø The multiplexer is a single-input and multi-output combinational circuit.
Ø The information is received from the single input line and directed to
the output line. On the basis of the values of the selection lines, the
input will be connected to one of these outputs.
Ø De-multiplexer is opposite to the multiplexer.
Ø De-multiplexer is also treated as De-mux.
Demultiplexer- 1:4
Ø In 1 to 4 De-multiplexer, there are total of four outputs, i.e., Y0, Y1, Y2,
and Y3, 2 selection lines, i.e., S0 and S1 and single input, i.e., A.
Ø On the basis of the combination of inputs which are present at the
selection lines S0 and S1, the input be connected to one of the
outputs.
Ø The block diagram and the truth table of the 1×4 multiplexer is:
Demultiplexer- 1:4
Ø In 1 to 4 De-multiplexer, there are total of four outputs, i.e., Y0, Y1, Y2,
and Y3, 2 selection lines, i.e., S0 and S1 and single input, i.e., A.
Ø On the basis of the combination of inputs which are present at the
selection lines S0 and S1, the input be connected to one of the
outputs.
Ø The block diagram and the truth table of the 1×4 multiplexer is:
Demultiplexer- 1:4
Truth Table is :
Logical Expression is:
Y0 = S1' S0' A
y1 = S1' S0 A
y2 = S1 S0' A
y3 = S1 S0 A
Demultiplexer- 1:4 - Circuit
Unit 5
I BCA E- Ms.Mary Jacob
Combinational Circuit Vs Sequential Circuit
Sequential Circuits- Types
Asynchronous sequential circuits
The clock signals are not used by the Asynchronous
sequential circuits. The asynchronous circuit is operated
through the pulses. So, the changes in the input can
change the state of the circuit.
Synchronous sequential circuits
Synchronization of the memory element's state is done by
the clock signal. The output is stored in either flip-flops or
latches. The synchronization of the outputs is done with
either only negative edges of the clock signal or only
positive edges.
Clock Signal
A clock signal is a periodic signal in which ON time and OFF time need not be
the same. When ON time and OFF time of the clock signal are the same, a
square wave is used to represent the clock signal.
Types of Triggering
Level triggering
The logic High and logic Low are the two levels in the clock signal. In level triggering,
when the clock pulse is at a particular level, only then the circuit is activated.
1. Positive level triggering
In a positive level triggering, the signal with Logic High occurs. The circuit is operated
with such type of clock signal.
2. Negative level triggering
In negative level triggering, the signal with Logic Low occurs. The circuit is operated with
such type of clock signal.
Edge triggering
In clock signal of edge triggering, two types of transitions occur, i.e., transition
either from Logic Low to Logic High or Logic High to Logic Low.
1.Positive Edge Triggering
If the sequential circuit is operated with the clock signal that is transitioning from
Logic Low to Logic High, then that type of triggering is known as Positive edge
triggering. It is also called as rising edge triggering.
2.Negative edge triggering
If the sequential circuit is operated with the clock signal that is transitioning from
Logic High to Logic Low, then that type of triggering is known as Negative edge
triggering. It is also called as falling edge triggering.
Types of Triggering
Latch & Flip Flop
There are two types of memory elements based on the type
of triggering that is suitable to operate it.
• Latches - operate with enable signal, which is level
sensitive
• Flip-flops -They are edge sensitive
SR Latch using Nor gate
SR Latch is also called as Set Reset Latch.
This latch affects the outputs as long as the enable, E is maintained at ‘1’.
The circuit diagram of SR Latch is
Truth table of SR latch:
S R Q Q ̅
0 0 Previous state
0 1 0 1
1 0 1 0
1 1 Not used
SR Latch using Nand gate
SR latch using NAND gate we will replace NOR gate with the NAND gate. The inputs
are interchanged in SR NOR latch we have reset in the upward gate and set in the
lower gate.
Truth table:SR latch using NAND gate
S R Q Q’
0 0 Not used
0 1 1 0
1 0 0 1
1 1 Previous state
SR Flip Flop
In SR flip flop we will use the SR latch using NAND gate and two extra NAND gate
will be used which are G3 and G4.
The input to G3 and G4 will be S and R respectively and clock signal is applied to
both gates which will be train of pulses.
SR Flip Flop
SR Flip Flop truth table:
D Flip Flop
v The D flip flop is the most important flip flop from other clocked types.
v It ensures that at the same time, both the inputs, i.e., S and R, are never equal to
1 .
v The Delay flip-flop is designed using a gated SR flip-flop with an inverter
connected between the inputs allowing for a single input D(Data).
v This single data input, which is labeled as "D" used in place of the "Set" input and
for the complementary "Reset" input, the inverter is used.
v Thus, the level-sensitive D-type or D flip flop is constructed from a level-sensitive
SR flip flop.
D Flip Flop
Truth Table
Circuit Diagram
Block Diagram
JK Flip Flop
Block Diagram
Circuit Diagram
Truth Table
JK Master Slave Flip flop
JK Master Slave Flip flop
T Flip flop
The T flip-flop is also called toggle flip-flop. It is a change of the JK flip-flop. The T
flip flop is received by relating both inputs of a JK flip-flop. The T flip-flop is
received by relating the inputs 'J' and 'K'
Shift Registers
One flip-flop can store one-bit of information. In order to store multiple bits of information,
we require multiple flip-flops. The group of flip-flops, which are used to hold store the binary
data is known as register.
If the register is capable of shifting bits either towards right hand side or towards left hand
side is known as shift register. An ‘N’ bit shift register contains ‘N’ flip-flops. Four types of
shift registers based on applying inputs and accessing of outputs.
Serial In − Serial Out shift register
Serial In − Parallel Out shift register
Parallel In − Serial Out shift register
Parallel In − Parallel Out shift register
Serial-in to Parallel-out Register
Serial-in to Parallel-out (SIPO) – the register is loaded with serial data, one bit at a time,
with the stored data being available at the output in parallel form
SIPO IC’s include the standard 8-bit 74LS164 or the 74LS594
Serial-in to Parallel-out Register
Data Movement Through A Shift Register
Serial-in to Serial-out Shift Register
Serial-in to Serial-out (SISO) – the data is shifted serially “IN” and “OUT” of the register,
one bit at a time in either a left or right direction under clock control.
IC’s include the 74HC595 8-bit Serial-in to Serial-out Shift Register
Parallel-in to Serial-out (PISO)
Parallel-in to Serial-out (PISO) – the parallel data is loaded into the register simultaneously
and is shifted out of the register serially one bit at a time under clock control.
IC’s include the 74HC166 8-bit Parallel-in/Serial-out Shift Registers.
Parallel-in to Parallel-out (PIPO)
Parallel-in to Parallel-out (PIPO) – the parallel data is loaded simultaneously into the register,
and transferred together to their respective outputs by the same clock pulse.

More Related Content

What's hot

sequential circuits
sequential circuitssequential circuits
sequential circuitsUnsa Shakir
 
Combinational circuits
Combinational circuitsCombinational circuits
Combinational circuitsSARITHA REDDY
 
Encoder & Decoder
Encoder & DecoderEncoder & Decoder
Encoder & DecoderSyed Saeed
 
Combinational circuits
Combinational circuits Combinational circuits
Combinational circuits DrSonali Vyas
 
Half adder and full adder
Half adder and full adderHalf adder and full adder
Half adder and full adderSanjuktaBanik
 
module1:Introduction to digital electronics
module1:Introduction to digital electronicsmodule1:Introduction to digital electronics
module1:Introduction to digital electronicschandrakant shinde
 
Stacks & subroutines 1
Stacks & subroutines 1Stacks & subroutines 1
Stacks & subroutines 1deval patel
 
EC8392 -DIGITAL ELECTRONICS -II YEAR ECE-by S.SESHA VIDHYA /ASP/ ECE/ RMKCET
EC8392 -DIGITAL ELECTRONICS -II YEAR ECE-by S.SESHA VIDHYA /ASP/ ECE/ RMKCETEC8392 -DIGITAL ELECTRONICS -II YEAR ECE-by S.SESHA VIDHYA /ASP/ ECE/ RMKCET
EC8392 -DIGITAL ELECTRONICS -II YEAR ECE-by S.SESHA VIDHYA /ASP/ ECE/ RMKCETSeshaVidhyaS
 
VERILOG HDL :: Blocking & NON- Blocking assignments
VERILOG HDL :: Blocking & NON- Blocking assignments VERILOG HDL :: Blocking & NON- Blocking assignments
VERILOG HDL :: Blocking & NON- Blocking assignments Dr.YNM
 
Bcd to 7 segment display
Bcd to 7 segment displayBcd to 7 segment display
Bcd to 7 segment displayMaulik Sanchela
 
Nand and nor as a universal gates
Nand and nor as a universal gatesNand and nor as a universal gates
Nand and nor as a universal gatesKaushal Shah
 
De Morgan Theorem B[1]
De Morgan Theorem B[1]De Morgan Theorem B[1]
De Morgan Theorem B[1]Mr. Bullerman
 
Pic microcontroller architecture
Pic microcontroller architecturePic microcontroller architecture
Pic microcontroller architectureJamia Hamdard
 
Decoders
DecodersDecoders
DecodersRe Man
 
Half adder & full adder
Half adder & full adderHalf adder & full adder
Half adder & full adderGaditek
 
Decoders-Digital Electronics
Decoders-Digital ElectronicsDecoders-Digital Electronics
Decoders-Digital ElectronicsPaurav Shah
 

What's hot (20)

sequential circuits
sequential circuitssequential circuits
sequential circuits
 
Combinational circuits
Combinational circuitsCombinational circuits
Combinational circuits
 
Encoder & Decoder
Encoder & DecoderEncoder & Decoder
Encoder & Decoder
 
Combinational circuits
Combinational circuits Combinational circuits
Combinational circuits
 
Half adder and full adder
Half adder and full adderHalf adder and full adder
Half adder and full adder
 
Shift Registers
Shift RegistersShift Registers
Shift Registers
 
module1:Introduction to digital electronics
module1:Introduction to digital electronicsmodule1:Introduction to digital electronics
module1:Introduction to digital electronics
 
Stacks & subroutines 1
Stacks & subroutines 1Stacks & subroutines 1
Stacks & subroutines 1
 
Johnson counter
Johnson counterJohnson counter
Johnson counter
 
EC8392 -DIGITAL ELECTRONICS -II YEAR ECE-by S.SESHA VIDHYA /ASP/ ECE/ RMKCET
EC8392 -DIGITAL ELECTRONICS -II YEAR ECE-by S.SESHA VIDHYA /ASP/ ECE/ RMKCETEC8392 -DIGITAL ELECTRONICS -II YEAR ECE-by S.SESHA VIDHYA /ASP/ ECE/ RMKCET
EC8392 -DIGITAL ELECTRONICS -II YEAR ECE-by S.SESHA VIDHYA /ASP/ ECE/ RMKCET
 
VERILOG HDL :: Blocking & NON- Blocking assignments
VERILOG HDL :: Blocking & NON- Blocking assignments VERILOG HDL :: Blocking & NON- Blocking assignments
VERILOG HDL :: Blocking & NON- Blocking assignments
 
Bcd to 7 segment display
Bcd to 7 segment displayBcd to 7 segment display
Bcd to 7 segment display
 
08 decoder
08 decoder08 decoder
08 decoder
 
Nand and nor as a universal gates
Nand and nor as a universal gatesNand and nor as a universal gates
Nand and nor as a universal gates
 
De Morgan Theorem B[1]
De Morgan Theorem B[1]De Morgan Theorem B[1]
De Morgan Theorem B[1]
 
Pic microcontroller architecture
Pic microcontroller architecturePic microcontroller architecture
Pic microcontroller architecture
 
Decoders
DecodersDecoders
Decoders
 
PAL And PLA ROM
PAL And PLA ROMPAL And PLA ROM
PAL And PLA ROM
 
Half adder & full adder
Half adder & full adderHalf adder & full adder
Half adder & full adder
 
Decoders-Digital Electronics
Decoders-Digital ElectronicsDecoders-Digital Electronics
Decoders-Digital Electronics
 

Similar to 2 bit comparator, 4 1 Multiplexer, 1 4 Demultiplexer, Flip Flops and Registers.pdf

Digital Electronics – Unit III.pdf
Digital Electronics – Unit III.pdfDigital Electronics – Unit III.pdf
Digital Electronics – Unit III.pdfKannan Kanagaraj
 
Digital_Electronics_Module_4_Sequential_Circuits v0.6.pptx
Digital_Electronics_Module_4_Sequential_Circuits v0.6.pptxDigital_Electronics_Module_4_Sequential_Circuits v0.6.pptx
Digital_Electronics_Module_4_Sequential_Circuits v0.6.pptxUtsavDas21
 
Registers and counters
Registers and countersRegisters and counters
Registers and countersHeman Pathak
 
counters and resister presentations.pptx
counters and resister presentations.pptxcounters and resister presentations.pptx
counters and resister presentations.pptxarushika2211
 
Unit 4 sequential circuits
Unit 4  sequential circuitsUnit 4  sequential circuits
Unit 4 sequential circuitsAmrutaMehata
 
De EE unit-3.pptx
De EE unit-3.pptxDe EE unit-3.pptx
De EE unit-3.pptxMukulThory1
 
Digital Electronics Unit_4_new.pptx
Digital Electronics Unit_4_new.pptxDigital Electronics Unit_4_new.pptx
Digital Electronics Unit_4_new.pptxThapar Institute
 
Introduction to flipflops basic of elctronics COA.pptx
Introduction to flipflops basic of elctronics COA.pptxIntroduction to flipflops basic of elctronics COA.pptx
Introduction to flipflops basic of elctronics COA.pptxSaini71
 
2 marks DPCO.pdf
2 marks DPCO.pdf2 marks DPCO.pdf
2 marks DPCO.pdfVhhvf
 
B sc cs i bo-de u-iii counters & registers
B sc cs i bo-de u-iii counters & registersB sc cs i bo-de u-iii counters & registers
B sc cs i bo-de u-iii counters & registersRai University
 
counter using 4 master slave flip-flops
counter using 4 master slave flip-flops counter using 4 master slave flip-flops
counter using 4 master slave flip-flops ZunAib Ali
 
Digital Fundamental Material for the student
Digital Fundamental Material for the studentDigital Fundamental Material for the student
Digital Fundamental Material for the studentjainyshah20
 
Sequential and combinational alu
Sequential and combinational alu Sequential and combinational alu
Sequential and combinational alu Piyush Rochwani
 
Sequential circuits Sequential circuits1
Sequential circuits Sequential circuits1Sequential circuits Sequential circuits1
Sequential circuits Sequential circuits1ssuser6feece1
 

Similar to 2 bit comparator, 4 1 Multiplexer, 1 4 Demultiplexer, Flip Flops and Registers.pdf (20)

unit 5.pptx
unit 5.pptxunit 5.pptx
unit 5.pptx
 
Digital Electronics – Unit III.pdf
Digital Electronics – Unit III.pdfDigital Electronics – Unit III.pdf
Digital Electronics – Unit III.pdf
 
Ring counter
Ring counterRing counter
Ring counter
 
Digital_Electronics_Module_4_Sequential_Circuits v0.6.pptx
Digital_Electronics_Module_4_Sequential_Circuits v0.6.pptxDigital_Electronics_Module_4_Sequential_Circuits v0.6.pptx
Digital_Electronics_Module_4_Sequential_Circuits v0.6.pptx
 
Registers and counters
Registers and countersRegisters and counters
Registers and counters
 
counters and resister presentations.pptx
counters and resister presentations.pptxcounters and resister presentations.pptx
counters and resister presentations.pptx
 
Unit 4 sequential circuits
Unit 4  sequential circuitsUnit 4  sequential circuits
Unit 4 sequential circuits
 
De EE unit-3.pptx
De EE unit-3.pptxDe EE unit-3.pptx
De EE unit-3.pptx
 
Digital Electronics Unit_4_new.pptx
Digital Electronics Unit_4_new.pptxDigital Electronics Unit_4_new.pptx
Digital Electronics Unit_4_new.pptx
 
Introduction to flipflops basic of elctronics COA.pptx
Introduction to flipflops basic of elctronics COA.pptxIntroduction to flipflops basic of elctronics COA.pptx
Introduction to flipflops basic of elctronics COA.pptx
 
2 marks DPCO.pdf
2 marks DPCO.pdf2 marks DPCO.pdf
2 marks DPCO.pdf
 
Flip & flop by Zaheer Abbas Aghani
Flip & flop by Zaheer Abbas AghaniFlip & flop by Zaheer Abbas Aghani
Flip & flop by Zaheer Abbas Aghani
 
B sc cs i bo-de u-iii counters & registers
B sc cs i bo-de u-iii counters & registersB sc cs i bo-de u-iii counters & registers
B sc cs i bo-de u-iii counters & registers
 
counter using 4 master slave flip-flops
counter using 4 master slave flip-flops counter using 4 master slave flip-flops
counter using 4 master slave flip-flops
 
Dns module3 p3
Dns module3 p3Dns module3 p3
Dns module3 p3
 
Dns module3 p3_shift registers
Dns module3 p3_shift registersDns module3 p3_shift registers
Dns module3 p3_shift registers
 
Digital Fundamental Material for the student
Digital Fundamental Material for the studentDigital Fundamental Material for the student
Digital Fundamental Material for the student
 
flip flop 13.ppt
flip flop 13.pptflip flop 13.ppt
flip flop 13.ppt
 
Sequential and combinational alu
Sequential and combinational alu Sequential and combinational alu
Sequential and combinational alu
 
Sequential circuits Sequential circuits1
Sequential circuits Sequential circuits1Sequential circuits Sequential circuits1
Sequential circuits Sequential circuits1
 

More from MaryJacob24

Unit 1-Introduction to Data Structures-BCA.pdf
Unit 1-Introduction to Data Structures-BCA.pdfUnit 1-Introduction to Data Structures-BCA.pdf
Unit 1-Introduction to Data Structures-BCA.pdfMaryJacob24
 
Unit 2-Data Modeling.pdf
Unit 2-Data Modeling.pdfUnit 2-Data Modeling.pdf
Unit 2-Data Modeling.pdfMaryJacob24
 
C Operators and Control Structures.pdf
C Operators and Control Structures.pdfC Operators and Control Structures.pdf
C Operators and Control Structures.pdfMaryJacob24
 
Unit 4- Dynamic Programming.pdf
Unit 4- Dynamic Programming.pdfUnit 4- Dynamic Programming.pdf
Unit 4- Dynamic Programming.pdfMaryJacob24
 
Unit 3- Greedy Method.pptx
Unit 3- Greedy Method.pptxUnit 3- Greedy Method.pptx
Unit 3- Greedy Method.pptxMaryJacob24
 
tree traversals.pdf
tree traversals.pdftree traversals.pdf
tree traversals.pdfMaryJacob24
 
Linked List-Types.pdf
Linked List-Types.pdfLinked List-Types.pdf
Linked List-Types.pdfMaryJacob24
 
Unit 5- Cloud Applications.pdf
Unit 5- Cloud Applications.pdfUnit 5- Cloud Applications.pdf
Unit 5- Cloud Applications.pdfMaryJacob24
 
Simplification of Circuits.pdf
Simplification of Circuits.pdfSimplification of Circuits.pdf
Simplification of Circuits.pdfMaryJacob24
 
Algorithm-Introduction ,Characterestics & Control Structures.pdf
Algorithm-Introduction ,Characterestics & Control Structures.pdfAlgorithm-Introduction ,Characterestics & Control Structures.pdf
Algorithm-Introduction ,Characterestics & Control Structures.pdfMaryJacob24
 
Data Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdfData Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdfMaryJacob24
 
Unit 3 - Greedy Method
Unit 3  - Greedy MethodUnit 3  - Greedy Method
Unit 3 - Greedy MethodMaryJacob24
 
Unit 3 greedy method
Unit 3  greedy methodUnit 3  greedy method
Unit 3 greedy methodMaryJacob24
 
Graph Traversals
Graph TraversalsGraph Traversals
Graph TraversalsMaryJacob24
 

More from MaryJacob24 (15)

Unit 1-Introduction to Data Structures-BCA.pdf
Unit 1-Introduction to Data Structures-BCA.pdfUnit 1-Introduction to Data Structures-BCA.pdf
Unit 1-Introduction to Data Structures-BCA.pdf
 
Unit 2-Data Modeling.pdf
Unit 2-Data Modeling.pdfUnit 2-Data Modeling.pdf
Unit 2-Data Modeling.pdf
 
C Operators and Control Structures.pdf
C Operators and Control Structures.pdfC Operators and Control Structures.pdf
C Operators and Control Structures.pdf
 
Unit 4- Dynamic Programming.pdf
Unit 4- Dynamic Programming.pdfUnit 4- Dynamic Programming.pdf
Unit 4- Dynamic Programming.pdf
 
Unit 3- Greedy Method.pptx
Unit 3- Greedy Method.pptxUnit 3- Greedy Method.pptx
Unit 3- Greedy Method.pptx
 
tree traversals.pdf
tree traversals.pdftree traversals.pdf
tree traversals.pdf
 
Linked List-Types.pdf
Linked List-Types.pdfLinked List-Types.pdf
Linked List-Types.pdf
 
Unit 5- Cloud Applications.pdf
Unit 5- Cloud Applications.pdfUnit 5- Cloud Applications.pdf
Unit 5- Cloud Applications.pdf
 
Simplification of Circuits.pdf
Simplification of Circuits.pdfSimplification of Circuits.pdf
Simplification of Circuits.pdf
 
Algorithm-Introduction ,Characterestics & Control Structures.pdf
Algorithm-Introduction ,Characterestics & Control Structures.pdfAlgorithm-Introduction ,Characterestics & Control Structures.pdf
Algorithm-Introduction ,Characterestics & Control Structures.pdf
 
Data Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdfData Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdf
 
quick sort.pdf
quick sort.pdfquick sort.pdf
quick sort.pdf
 
Unit 3 - Greedy Method
Unit 3  - Greedy MethodUnit 3  - Greedy Method
Unit 3 - Greedy Method
 
Unit 3 greedy method
Unit 3  greedy methodUnit 3  greedy method
Unit 3 greedy method
 
Graph Traversals
Graph TraversalsGraph Traversals
Graph Traversals
 

Recently uploaded

Introduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher EducationIntroduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher Educationpboyjonauth
 
Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104misteraugie
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactdawncurless
 
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...Krashi Coaching
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxiammrhaywood
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxGaneshChakor2
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxpboyjonauth
 
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13Steve Thomason
 
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxPOINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxSayali Powar
 
Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3JemimahLaneBuaron
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)eniolaolutunde
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxNirmalaLoungPoorunde1
 
microwave assisted reaction. General introduction
microwave assisted reaction. General introductionmicrowave assisted reaction. General introduction
microwave assisted reaction. General introductionMaksud Ahmed
 
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeMeasures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeThiyagu K
 
Separation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and ActinidesSeparation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and ActinidesFatimaKhan178732
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityGeoBlogs
 
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi  6.pdf1029-Danh muc Sach Giao Khoa khoi  6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdfQucHHunhnh
 

Recently uploaded (20)

Introduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher EducationIntroduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher Education
 
Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
 
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
Kisan Call Centre - To harness potential of ICT in Agriculture by answer farm...
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptx
 
Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"
Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"
Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptx
 
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
 
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13
 
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxPOINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
 
Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
 
microwave assisted reaction. General introduction
microwave assisted reaction. General introductionmicrowave assisted reaction. General introduction
microwave assisted reaction. General introduction
 
Staff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSDStaff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSD
 
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeMeasures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and Mode
 
Separation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and ActinidesSeparation of Lanthanides/ Lanthanides and Actinides
Separation of Lanthanides/ Lanthanides and Actinides
 
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activityParis 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
 
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi  6.pdf1029-Danh muc Sach Giao Khoa khoi  6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
 

2 bit comparator, 4 1 Multiplexer, 1 4 Demultiplexer, Flip Flops and Registers.pdf

  • 1. 2 bit comparator, 4:1 Multiplexer, 1: 4 Demultiplexer, Flip Flops and Registers Ms.Mary Jacob, Asst.Professor Kristu Jayanti College (Autonomous),Bangalore
  • 2. Magnitude Digital Comparator ØA magnitude digital comparator is a combinational circuit that compares two digital or binary numbers - 2 n bit words in order to find out whether one binary number is equal, less than or greater than the other binary number. ØCircuit will have two inputs one for A(n bits) and other for B (n bits) and have three output terminals, for A > B condition, A = B condition and A < B condition.
  • 4. 1-Bit Magnitude Comparator A comparator used to compare two bits is called a single bit comparator. It consists of two inputs each for two single bit numbers and three outputs to generate less than, equal to and greater than between two binary numbers. The truth table for a 1-bit comparator is Logical expressions for each output can be expressed as : A > B : AB' A < B : A'B A = B : A'B' + AB
  • 5. 1-Bit Magnitude Comparator Using the Logical expressions the circuit can be drawn as : A > B : AB' A < B : A'B A = B : A'B' + AB
  • 6. 2-Bit Magnitude Comparator A comparator used to compare two binary numbers each of two bits is called a 2-bit magnitude comparator. It consists of four inputs and three outputs to generate less than, equal to and greater than between two binary numbers. The truth table for a 2-bit comparator is :
  • 7. 2-Bit Magnitude Comparator Logical Expression from the truth table is : A > B : A1 B1’ + A0 B1’ B0’ + A1 A0 B0’ A = B : A1’ A0’ B1’ B0’ + A1’ A0 B1’ B0 + A1 A0 B1 B0 + A1 A0’ B1 B0’ : A1’ B1’ (A0’ B0’ + A0 B0) + A1 B1 (A0 B0 + A0’ B0’) : (A0 B0 + A0’ B0’) (A1 B1 + A1’ B1’) : (A0 Ex-Nor B0) (A1 Ex-Nor B1) A < B : A1’ B1 + A0’ B1 B0 + A1’ A0’ B0
  • 9. 2-Bit Magnitude Comparator Applications of Comparators : 1. Comparators are used in central processing units (CPUs) and microcontrollers (MCUs). 2. These are used in control applications in which the binary numbers representing physical variables such as temperature, position, etc. are compared with a reference value. 3. Comparators are also used as process controllers and for Servo motor control. 4. Used in password verification and biometric applications
  • 10. Multiplexer Multiplexer is a combinational circuit that has maximum of 2n data inputs, ‘n’ selection lines and single output line. One of these data inputs will be connected to the output based on the values of selection lines. Since there are ‘n’ selection lines, there will be 2n possible combinations of zeros and ones. So, each combination will select only one data input. Multiplexer is also called as Mux.
  • 11. Multiplexer- 4:1 4x1 Multiplexer has four data inputs I3, I2, I1 & I0, two selection lines s1 & s0 and one output Y. One of these 4 inputs will be connected to the output based on the combination of inputs present at these two selection lines The block diagram of 4x1 Multiplexer is Truth table of 4x1 Multiplexer is The logical expression from the truth table is :
  • 12. Multiplexer- 4:1 - Circuit Diagram
  • 13. Demultiplexer Ø A De-multiplexer is a combinational circuit that has only 1 input line and 2N output lines. Ø The multiplexer is a single-input and multi-output combinational circuit. Ø The information is received from the single input line and directed to the output line. On the basis of the values of the selection lines, the input will be connected to one of these outputs. Ø De-multiplexer is opposite to the multiplexer. Ø De-multiplexer is also treated as De-mux.
  • 14. Demultiplexer- 1:4 Ø In 1 to 4 De-multiplexer, there are total of four outputs, i.e., Y0, Y1, Y2, and Y3, 2 selection lines, i.e., S0 and S1 and single input, i.e., A. Ø On the basis of the combination of inputs which are present at the selection lines S0 and S1, the input be connected to one of the outputs. Ø The block diagram and the truth table of the 1×4 multiplexer is:
  • 15. Demultiplexer- 1:4 Ø In 1 to 4 De-multiplexer, there are total of four outputs, i.e., Y0, Y1, Y2, and Y3, 2 selection lines, i.e., S0 and S1 and single input, i.e., A. Ø On the basis of the combination of inputs which are present at the selection lines S0 and S1, the input be connected to one of the outputs. Ø The block diagram and the truth table of the 1×4 multiplexer is:
  • 16. Demultiplexer- 1:4 Truth Table is : Logical Expression is: Y0 = S1' S0' A y1 = S1' S0 A y2 = S1 S0' A y3 = S1 S0 A
  • 18. Unit 5 I BCA E- Ms.Mary Jacob
  • 19. Combinational Circuit Vs Sequential Circuit
  • 20. Sequential Circuits- Types Asynchronous sequential circuits The clock signals are not used by the Asynchronous sequential circuits. The asynchronous circuit is operated through the pulses. So, the changes in the input can change the state of the circuit. Synchronous sequential circuits Synchronization of the memory element's state is done by the clock signal. The output is stored in either flip-flops or latches. The synchronization of the outputs is done with either only negative edges of the clock signal or only positive edges.
  • 21. Clock Signal A clock signal is a periodic signal in which ON time and OFF time need not be the same. When ON time and OFF time of the clock signal are the same, a square wave is used to represent the clock signal.
  • 22. Types of Triggering Level triggering The logic High and logic Low are the two levels in the clock signal. In level triggering, when the clock pulse is at a particular level, only then the circuit is activated. 1. Positive level triggering In a positive level triggering, the signal with Logic High occurs. The circuit is operated with such type of clock signal. 2. Negative level triggering In negative level triggering, the signal with Logic Low occurs. The circuit is operated with such type of clock signal.
  • 23. Edge triggering In clock signal of edge triggering, two types of transitions occur, i.e., transition either from Logic Low to Logic High or Logic High to Logic Low. 1.Positive Edge Triggering If the sequential circuit is operated with the clock signal that is transitioning from Logic Low to Logic High, then that type of triggering is known as Positive edge triggering. It is also called as rising edge triggering. 2.Negative edge triggering If the sequential circuit is operated with the clock signal that is transitioning from Logic High to Logic Low, then that type of triggering is known as Negative edge triggering. It is also called as falling edge triggering. Types of Triggering
  • 24. Latch & Flip Flop There are two types of memory elements based on the type of triggering that is suitable to operate it. • Latches - operate with enable signal, which is level sensitive • Flip-flops -They are edge sensitive
  • 25. SR Latch using Nor gate SR Latch is also called as Set Reset Latch. This latch affects the outputs as long as the enable, E is maintained at ‘1’. The circuit diagram of SR Latch is Truth table of SR latch: S R Q Q ̅ 0 0 Previous state 0 1 0 1 1 0 1 0 1 1 Not used
  • 26. SR Latch using Nand gate SR latch using NAND gate we will replace NOR gate with the NAND gate. The inputs are interchanged in SR NOR latch we have reset in the upward gate and set in the lower gate. Truth table:SR latch using NAND gate S R Q Q’ 0 0 Not used 0 1 1 0 1 0 0 1 1 1 Previous state
  • 27. SR Flip Flop In SR flip flop we will use the SR latch using NAND gate and two extra NAND gate will be used which are G3 and G4. The input to G3 and G4 will be S and R respectively and clock signal is applied to both gates which will be train of pulses.
  • 28. SR Flip Flop SR Flip Flop truth table:
  • 29. D Flip Flop v The D flip flop is the most important flip flop from other clocked types. v It ensures that at the same time, both the inputs, i.e., S and R, are never equal to 1 . v The Delay flip-flop is designed using a gated SR flip-flop with an inverter connected between the inputs allowing for a single input D(Data). v This single data input, which is labeled as "D" used in place of the "Set" input and for the complementary "Reset" input, the inverter is used. v Thus, the level-sensitive D-type or D flip flop is constructed from a level-sensitive SR flip flop.
  • 30. D Flip Flop Truth Table Circuit Diagram Block Diagram
  • 31. JK Flip Flop Block Diagram Circuit Diagram Truth Table
  • 32. JK Master Slave Flip flop
  • 33. JK Master Slave Flip flop
  • 34. T Flip flop The T flip-flop is also called toggle flip-flop. It is a change of the JK flip-flop. The T flip flop is received by relating both inputs of a JK flip-flop. The T flip-flop is received by relating the inputs 'J' and 'K'
  • 35. Shift Registers One flip-flop can store one-bit of information. In order to store multiple bits of information, we require multiple flip-flops. The group of flip-flops, which are used to hold store the binary data is known as register. If the register is capable of shifting bits either towards right hand side or towards left hand side is known as shift register. An ‘N’ bit shift register contains ‘N’ flip-flops. Four types of shift registers based on applying inputs and accessing of outputs. Serial In − Serial Out shift register Serial In − Parallel Out shift register Parallel In − Serial Out shift register Parallel In − Parallel Out shift register
  • 36. Serial-in to Parallel-out Register Serial-in to Parallel-out (SIPO) – the register is loaded with serial data, one bit at a time, with the stored data being available at the output in parallel form SIPO IC’s include the standard 8-bit 74LS164 or the 74LS594
  • 37. Serial-in to Parallel-out Register Data Movement Through A Shift Register
  • 38. Serial-in to Serial-out Shift Register Serial-in to Serial-out (SISO) – the data is shifted serially “IN” and “OUT” of the register, one bit at a time in either a left or right direction under clock control. IC’s include the 74HC595 8-bit Serial-in to Serial-out Shift Register
  • 39. Parallel-in to Serial-out (PISO) Parallel-in to Serial-out (PISO) – the parallel data is loaded into the register simultaneously and is shifted out of the register serially one bit at a time under clock control. IC’s include the 74HC166 8-bit Parallel-in/Serial-out Shift Registers.
  • 40. Parallel-in to Parallel-out (PIPO) Parallel-in to Parallel-out (PIPO) – the parallel data is loaded simultaneously into the register, and transferred together to their respective outputs by the same clock pulse.