0% found this document useful (0 votes)
58 views7 pages

Experiment - 1: Aim: Design of Full Adder Using All The Three Models

The document describes an experiment to design a full adder using three models - data flow, structural, and behavioral. It provides the block diagram and boolean equations for a full adder, as well as truth tables. Code examples are given for each of the three models in MODELSIM software. The output is tested for different input combinations and matches the truth table. The result confirms that the code works correctly for all three models of a full adder.

Uploaded by

sumit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
58 views7 pages

Experiment - 1: Aim: Design of Full Adder Using All The Three Models

The document describes an experiment to design a full adder using three models - data flow, structural, and behavioral. It provides the block diagram and boolean equations for a full adder, as well as truth tables. Code examples are given for each of the three models in MODELSIM software. The output is tested for different input combinations and matches the truth table. The result confirms that the code works correctly for all three models of a full adder.

Uploaded by

sumit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Register Number: 18BEE0107 Course EEE4028

Name: Sumit Jaiswal Date: 01 Mar 2021


Slot: L11+L12

Experiment – 1

Aim: Design of full adder using all the three models

Apparatus: MODELSIM software.

Components of FULL ADDER:

Block diagram

Boolean Equation

Logical Expression for SUM:

= A’ B’ C-IN + A’ B C-IN’ + A B’ C-IN’ + A B C-IN


= C-IN (A’ B’ + A B) + C-IN’ (A’ B + A B’)
= C-IN XOR (A XOR B)

Logical Expression for C-OUT:


= A’ B C-IN + A B’ C-IN + A B C-IN’ + A B C-IN
= A B + B C-IN + A C-IN or AB + C-IN (A’ B + A B’)

WS 2021-22 EEE4028 Slot: L11+L12 Class Number: VL2020210501495 Faculty: KARTHIKEYAN A


Truth Table

1. Full adder using data flow model

Code:

Output
Testbench
1. (0,1,1) 2. (1,1,1)

WS 2021-22 EEE4028 Slot: L11+L12 Class Number: VL2020210501495 Faculty: KARTHIKEYAN A


Output Graph

2. Full adder using structural model

Code

WS 2021-22 EEE4028 Slot: L11+L12 Class Number: VL2020210501495 Faculty: KARTHIKEYAN A


Output
Testbench
1. (0,1,1) 2. (1,1,1)

Output Graph

WS 2021-22 EEE4028 Slot: L11+L12 Class Number: VL2020210501495 Faculty: KARTHIKEYAN A


3. Full adder using behavioral model

Code

WS 2021-22 EEE4028 Slot: L11+L12 Class Number: VL2020210501495 Faculty: KARTHIKEYAN A


Output
Testbench
1. (0,1,1) 2. (1,0,0)

Output Graph

WS 2021-22 EEE4028 Slot: L11+L12 Class Number: VL2020210501495 Faculty: KARTHIKEYAN A


Result & Inference:
After carefully compiling the codes for different inputs we got our desired results
affirmed by the truth table. Hence, our code is correct and work for all the models.

WS 2021-22 EEE4028 Slot: L11+L12 Class Number: VL2020210501495 Faculty: KARTHIKEYAN A

You might also like