0% found this document useful (0 votes)
3 views

Module 3

The document covers the design of combinational logic circuits, including half adders, full adders, subtractors, and decoders. It explains the function of decoders, demultiplexers, encoders, and multiplexers, along with their implementations and practice problems. Additionally, it discusses parity generators and checkers for error detection in binary transmissions.

Uploaded by

Kishore Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

Module 3

The document covers the design of combinational logic circuits, including half adders, full adders, subtractors, and decoders. It explains the function of decoders, demultiplexers, encoders, and multiplexers, along with their implementations and practice problems. Additionally, it discusses parity generators and checkers for error detection in binary transmissions.

Uploaded by

Kishore Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 33

Module 3 - Design of

Combinational Logic Circuits


Dr. E.Papanasam
[email protected]
AP Senior
School of Electronics
VIT Chennai
Design of Combinational Logic Circuits
Half adder
Full adder
Half subtractor
Full subtractor
Decoder

9/9/2022 FS2022-23 2
Decoder
 Discrete quantities of information are
represented in digital systems with binary
codes
 A binary code of n bits is capable of
representing up to 2n distinct elements of the
coded information
 Combinational circuit that converts binary
information from n input lines to a maximum
of 2n unique output lines
9/9/2022 FS2022-23 3
3 to 8 Line Decoder

9/9/2022 FS2022-23 4
9/9/2022 FS2022-23 5
Decoder with Enable input
 Enable lines are a convenient feature for connecting two
or more IC packages for the purpose of expanding the
digital function into a similar function with more inputs
and outputs

A 2-to-4 Line decoder with 9/9/2022 FS2022-23 6


Practice Problem
 Draw the logic diagram of a 2-to-4-line
decoder with only NOR gates. Include an
enable input.

9/9/2022 FS2022-23 7
A 4 x 16 decoder constructed With two 3
x 8 decoders

9/9/2022 FS2022-23 8
Practice Problem
 Construct
a 5 X 32 decoder with four 3 X 8
decoders with enable and one 2 x 4 decoder

9/9/2022 FS2022-23 9
Boolean Function Implementation
A combinational circuit is defined
by the following three Boolean
functions. Design the circuit with
a decoder and external gates
FI = x'y'z' + XZ
F2 = xy'z' + x'y
F3 = x'y'z + xy
9/9/2022 FS2022-23 10
Implementation of a full-adder with decoder
 S(x, y, z) = ∑ (I, 2, 4, 7)
 C(x, y, z) = ∑ (3, 5, 6, 7)

9/9/2022 FS2022-23 11
Practice Problem
Design a half subtractor using
decoder and suitable gate

9/9/2022 FS2022-23 12
Behavioral modeling
 module decoder24_behaviour(en,a,b,y);
 input en, a, b;
 output reg [3:0] D;
 always @(en, a, b)
 begin
◦ if(en==0)
 begin
 if(a==1'b0 & b==1'b0) y=4'b0111;
 else if(a==1'b0 & b==1'b1) y=4'b1011;
 else if(a==1'b1 & b==1'b0) y=4'b1101;
 else if(a==1 & b==1) y=4'b1110;
 else y=4'bxxxx;
 end
◦ else y=4'b1111;
 end
 endmodule 9/9/2022 FS2022-23 13
Test Bench
 module tb;
 reg a,b,en;
 wire [3:0] D;
 decoder24_behaviour dut(en,a,b,y);
 initial
 begin
 $monitor("en=%b a=%b b=%b y=%b",en,a,b,y);
 en=1;a=1'bx;b=1'bx;
 #5 en=0;a=0;b=0;
 #5 en=0;a=0;b=1;
 #5 en=0;a=1;b=0;
 #5 en=0;a=1;b=1;#5
 $finish;
 end
 endmodule 9/9/2022 FS2022-23 14
Data flow
 module decoder24_assign(en,a,b,y);
 input en,a,b;
 output [3:0] D;
 wire enb,na,nb;
 assign enb = ~en;
 assign na = ~a;
 assign nb = ~b;
 assign y[0] = ~(enb&na&nb);
 assign y[1] = ~(enb&na&b);
 assign y[2] = ~(enb&a&nb);
 assign y[3] = ~(enb&a&b);
 endmodule
9/9/2022 FS2022-23 15
Gate Level
 module decoder24_gate(en,a,b,y);
 input en,a,b;
 output [3:0] D;
 wire enb,na,nb;
 not n0(enb,en);
 not n1(na,a);
 not n2(nb,b);
 nand n3(y[0],enb,na,nb);
 nand n4(y[1],enb,na,b);
 nand n5(y[2],enb,a,nb);
 nand n6(y[3],enb,a,b);
 endmodule
9/9/2022 FS2022-23 16
Demultiplexer
 Circuit that receives information on a single line and
transmits this information on one of 2n possible output
lines
 The selection of a specific output line is controlled by
the bit values of n selection lines.

 The decoder can function as a demultiplexer if the E


line is taken as a data input line and lines A and B are
taken as the selection lines
 The single input variable E has a path to all four
outputs, but the input information is directed to only
one of the output lines, as specified
9/9/2022 FS2022-23 by the binary17
Demultiplexer

Courtesy: Electronicshub
9/9/2022 FS2022-23 18
Decoder as Demultiplexer

9/9/2022 FS2022-23 19
Encoder
 Digital circuit that performs the inverse operation of a decoder
 An encoder has 2n (or fewer) input lines and n output lines.
 The output lines generate the binary code corresponding to
the input value
 Example
 Octal to-binary encoder
◦ It has eight inputs, one for each of the octal digits, and three
outputs that generate the corresponding binary number
◦ It is assumed that only one input has a value of 1 at any
given time; otherwise the circuit has no meaning

9/9/2022 FS2022-23 20
Octal-to-Binary Encoder

9/9/2022 FS2022-23 21
Octal-to-binary encoder

9/9/2022 FS2022-23 22
Priority Encoder

9/9/2022 FS2022-23 23
4-input priority encoder

9/9/2022 FS2022-23 24
Practice Problem
Three Types of modeling of
Encoder
4 to 2 Priority encoder with D3
having highest priority

9/9/2022 FS2022-23 25
MULTIPLEXERS
 Multiplexing means transmitting a large number of
information units over a smaller number of channels or
lines
 A digital multiplexer is a combinational circuit that
selects binary information from one of many input lines
and directs it to a single output line
 The selection of a particular input line is controlled by a
set of selection lines
 A multiplexer is also called a data selector
◦ It selects one of many inputs and steers the binary
information to the output line
9/9/2022 FS2022-23 26
4-to-1line multiplexer

9/9/2022 FS2022-23 27
Boolean-Function Implementation
 F(A, B, C) =∑(1, 2, 4, 5)

9/9/2022 FS2022-23 29
Full adder Implementation
 Implement a full-adder with two 4 x I
multiplexers
 Implement a 8 x 1multiplexer using 4 x 1
and 2 x 1 Mux

9/9/2022 FS2022-23 30
Practice problem
 F(A, B, C) =∑(1, 3, 5, 6)
 F(A, B, C, D) = ∑(0, 1,3, 4, 8, 9, 15)
 Construct a 16 x 1 multiplexer with two 8 x 1
and one 2 X 1 multiplexers. Use block
diagrams for the three multiplexers
 Implement the following Boolean function
with an 8 x 1 multiplexer. F(A, B, C, D) = ∑(0,
3, 5, 6, 8,9, 14, 15)

9/9/2022 FS2022-23 31
Parity Generator and
Checker
Parity bit is used for the purpose of detecting errors
during transmission of binary information
 A parity bit is an extra bit included with a binary
message to make the number of l's either odd or
even
 The message, including the parity bit, is transmitted
and then checked at the receiving end for errors
 An error is detected if the checked parity does not
correspond with the one transmitted
 The circuit that generates the parity bit in the
transmitter is called a parity generator
 The circuit that checks the parity in the receiver is
called a parity checker 9/9/2022 FS2022-23 32
Even-Parity-Generator

 P = x XOR y XOR z
9/9/2022 FS2022-23 33
Even-Parity-Checker

9/9/2022 FS2022-23 34

You might also like