Scribd
Upload
155 views

Multimedia Systems Tutorial

This tutorial covers half adders, full adders, 4-bit parallel adders, and 4-bit adder/subtractors. It includes figures showing the circuit diagrams and truth tables for half adders and full adders. It also includes a Verilog HDL code for a 4-bit adder/subtractor. The document concludes with an assignment to write a Verilog code for a universal shift register based on the provided figure.

Uploaded by

Abdul Hameed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
155 views

Multimedia Systems Tutorial

This tutorial covers half adders, full adders, 4-bit parallel adders, and 4-bit adder/subtractors. It includes figures showing the circuit diagrams and truth tables for half adders and full adders. It also includes a Verilog HDL code for a 4-bit adder/subtractor. The document concludes with an assignment to write a Verilog code for a universal shift register based on the provided figure.

Uploaded by

Abdul Hameed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Multimedia Systems

Tutorial 2
Instructor: Mr. Bilal Ahmad

In this tutorial you will learn about half adder, subtractor and a four bit adder and subtractor.
After reading the contents you are provided with a Verilog HDL code. It is your responsibility to
learn the content first and then try to understand the code that is in abstract level programming.

The Half Adder

Fig 4.1.1 The Half Adder

Fig 4.1.1 The Half Adder


Binary arithmetic is carried out by combinational logic circuits, the simplest of which is the half
adder, shown in Fig. 4.1.1. This circuit consists, in its most basic form of two gates, an XOR gate
that produces a logic 1 output whenever A is 1 and B is 0, or when B is 1 and A is 0. The AND
gate produces a logic 1 at the carry output when both A and B are 1. The half adder truth table is
shown in Table 4.1.1 and describes the result of binary addition.

Fig. 4.1.2 The Full Adder Circuit.

1 plus 0 = 12 (110)
and
1 plus 1 = 102 (210)
The half adder is fine for adding two 1-bit numbers together, but for binary numbers containing
several bits, a carry may be produced at some time (as a result of adding 1 and 1) that must be
added to the next column. As the half adder has only two inputs it cannot add in a carry bit from
a previous column, so it is not practical for anything other than 1-bit additions.

The Full Adder


When 2 or more bits are to be added, the circuit used is the Full Adder, shown in Fig 4.1.2, (blue
background) together with its simplified block diagram symbol. This circuit simply comprises
two half adders, the sum of A and B from the first half adder is used as input A on the second
half adder, which now produces a sum of the first half adder sum (S1) plus any carry in from
the CIN terminal. Any carries produced by the two half adders are then ORed together to
produce a single COUT. output. The truth table for the circuit is given in Table 4.1.2.

Fig. 4.1.3 4Bit Parallel Adder.

Parallel Adders
Even the full adder is only adding two single bit binary numbers, but full adders may be
combined to form parallel adders, which will add two multibit numbers. Parallel adders can be
built in several forms to add multibit binary numbers, each bit of the parallel adder using a
single full adder circuit. As parallel adder circuits would look quite complex if drawn showing
all the individual gates, it is common to replace the full adder schematic diagram with a
simplified block diagram version.
4 Bit Parallel Adder
Fig 4.1.3 illustrates how a number of full adders can be combined to make a parallel adder, also
called a Ripple Carry Adder because of the way that any carry appearing at the carry in input
(CIN) or produced when adding any of the 4-bit inputs, ripples along the adder stages until a
final carry out appears at the carry out output (COUT) of the final full adder for bit A3+B3.

Fig. 4.1.4 8Bit Twos Complement Adder/Subtractor.


4 BIT ADDER SUBTRACTOR

VERILOG CODE:
module adder4bit(s,cout,a,b,cin);
input [3:0] a,b;
input cin;
output [3:0]s;
output cout;
assign {cout,s}=a+b+cin;
endmodule

module addersub(s,cout,a,b,cin);
input [3:0]a,b;
input cin;
output [3:0]s;
output cout;
wire [3:0]f;
assign f[0]=b[0]^cin;
assign f[1]=b[1]^cin;
assign f[2]=b[2]^cin;
assign f[3]=b[3]^cin;
adder4bit ggg(s,cout,a,f,cin);
endmodule

module test;
reg [3:0]a,b;
reg cin;
wire [3:0]s;
wire cout;
addersub hhh(s,cout,a,b,cin);
initial
begin
a=4'd1;b=4'd2;
cin=0;
#10 cin=1'b1;a=4'd3;b=4'd1;
end

initial
$monitor("a=%d,b=%d.......s=%d,cout=%d",a,b,s,cout);
endmodule

Assignment:

Below is the figure given of a universal shift register, you have to write a Verilog HDL Code for
Universal Shift Register

You might also like