21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

DIGITAL ASSIGNMENT - 1

Course Name: Digital Systems Design

Course Code: BECE102L
Name: Chandresh Rajpoot
Registration Number: 21BEC0398
Slot: E1+E2+TE1+TE2
Faculty: Prof. TANGUDU RAMJI
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

Q1.) Define the Boolean algebra?

Answer:

“Boolean algebra is a mathematical structure that

deals with binary variables and logical operations. It
is used extensively in computer science, electrical
engineering, and related fields for designing circuits,
programming, and solving logical problems.”
The important operations performed in Boolean algebra
are – conjunction (∧), disjunction (∧) and negation (¬).
Hence, this algebra is far way different from elementary
algebra where the values of variables are numerical and
arithmetic operations like addition, subtraction is been
performed on them.
The basic operations of Boolean algebra are as follows:
 Conjunction or AND operation
 Disjunction or OR operation
 Negation or Not operation
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

Now, let us discuss the important terminologies covered in

Boolean algebra.
Boolean Algebra: Boolean algebra is the branch of
algebra that deals with logical operations and binary
variables.
Boolean Variables: A Boolean variable is defined as a
variable or a symbol defined as a variable or a symbol,
generally an alphabet that represents the logical quantities
such as 0 or 1.
Boolean Function: A Boolean function consists of binary
variables, logical operators, constants such as 0 and 1,
equal to the operator, and the parenthesis symbols.
Literal: A literal may be a variable or a complement of a
variable.
Complement: The complement is defined as the inverse of
a variable, which is represented by a bar over the variable.
Truth Table: The truth table is a table that gives all the
possible values of logical variables and the combination of
the variables. It is possible to convert the Boolean
equation into a truth table. The number of rows in the
truth table should be equal to 2n, where “n” is the number
of variables in the equation. For example, if a Boolean
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

equation consists of 3 variables, then the number of rows

in the truth table is 8. (i.e.) 23 = 8.

Boolean Algebra Rules

Following are the important rules used in Boolean algebra.
 Variable used can have only two values. Binary 1 for
HIGH and Binary 0 for LOW.
 The complement of a variable is represented by an
over bar.
(𝑇ℎ𝑢𝑠, 𝑐𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 𝑣𝑎𝑟𝑖𝑎𝑏𝑙𝑒 𝐵 𝑖𝑠 𝑟𝑒𝑝𝑟𝑒𝑠𝑒𝑛𝑡𝑒𝑑 𝑎𝑠
𝐵¯. 𝑇ℎ𝑢𝑠 𝑖𝑓 𝐵=0 𝑡ℎ𝑒𝑛 𝐵¯=1 𝑎𝑛𝑑 𝐵 =1 𝑡ℎ𝑒𝑛 𝐵¯=0.)
 OR-ing of the variables is represented by a plus (+)
sign between them. For example, the OR-ing of A, B,
and C is represented as A + B + C.
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

 Logical AND-ing of the two or more variables is

represented by writing a dot between them, such as
A.B.C. Sometimes, the dot may be omitted like ABC.

Laws of Boolean Algebra

There are six types of Boolean algebra laws. They are:
Commutative law
 Associative law

 Distributive law

 AND law

 OR law

 Inversion law

Those six laws are explained in detail here.

Commutative Law
Any binary operation which satisfies the following
expression is referred to as a commutative operation.
Commutative law states that changing the sequence of the
variables does not have any effect on the output of a logic
circuit.
 A. B = B. A
 A+B=B+A

Associative Law
It states that the order in which the logic operations are
performed is irrelevant as their effect is the same.
 ( A. B ). C = A . ( B . C )
 ( A + B ) + C = A + ( B + C)
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

Distributive Law
Distributive law states the following conditions:
 A. ( B + C) = (A. B) + (A. C)
 A + (B. C) = (A + B) . ( A + C)

AND Law
These laws use the AND operation. Therefore they are
called AND laws.
 A .0 = 0
 A.1=A
 A. A = A
 𝐴.𝐴¯=0

OR Law
These laws use the OR operation. Therefore they are called
OR laws.
 A +0=A
 A+1=1
 A+A=A
 𝐴+𝐴¯=1

Inversion Law
In Boolean algebra, the inversion law states that double
inversion of variable results in the original variable itself.
 𝐴¯¯=𝐴
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

Boolean Algebra Theorems

The two important theorems which are extremely used in
Boolean algebra are De Morgan’s First law and De
Morgan’s second law. These two theorems are used to
change the Boolean expression. This theorem basically
helps to reduce the given Boolean expression in the
simplified form. These two De Morgan’s laws are used to
change the expression from one form to another form.
Now, let us discuss these two theorems in detail.
De Morgan’s First Law:
De Morgan’s First Law states that (A.B)’ = A’+B’.
The first law states that the complement of the product of
the variables is equal to the sum of their individual
complements of a variable.

De Morgan’s Second Law:

De Morgan’s Second law states that (A+B)’ = A’. B’.
The second law states that the complement of the sum of
variables is equal to the product of their individual
complements of a variable.
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

Q2.) Explain about the properties of Boolean algebra?

Answer:
Boolean algebra has several key properties that are fundamental
to its operations and applications. Here are the main properties of
Boolean algebra:
Commutative: The commutative property says that binary
operations
AND and OR may be applied left to right or right to left. (A AND B
is
the same as B AND A; A OR B is the same as B OR A.)

Associative: The associative property says that given three

Boolean
variables, they may be ANDed or ORed right to left or left to right.
((A AND B) AND C is the same as A AND (B AND C); (A OR B) OR
C is the same as A OR (B OR C).)
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

Distributive: The distributive property says that given three

Boolean
variables, the first AND the result of the second OR the third is the
same as the first AND the second OR the first AND the third. (A
AND (B OR C) = (A AND B) OR (A AND C). Also, the first OR the
result of second AND the third is the same as the first OR the
second
AND the result of the first OR the third. (A OR (B AND C) = (A OR
B) AND (A OR C).)

Identity: The identity property says that any value A AND the OR
identity always returns A and that any value A OR the AND
identity
always returns A. (A AND 1 = A; A OR 0 = A.)

Complement: The complement property says that any value AND

the
compliment of that value equals the OR identity and that any
value
OR the compliment of that value equals the OR identity. (A AND
(A’)
= 0; A OR (A’) = 1.)
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

DeMorgan’s Law: DeMorgan’s Law says that the complement of

A
AND B is the same as the complement of A OR the complement of
B,
and the complement of A OR B is the same as the complement of B
AND the complement of A. ((A AND B)’ = A’ OR B’; (A OR B)’ = A’
AND B’).)
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

Q3.) Define VHDL?

Answer:

VHDL (VHSIC Hardware Description Language) is a hardware

description language used to model, describe, and simulate the
behaviour and structure of electronic systems. VHDL is widely
used in the design and development of digital circuits, including
FPGAs (Field Programmable Gate Arrays), ASICs (Application-
Specific Integrated Circuits), and other digital logic devices. Here
are some key aspects of VHDL:

1. History and Standardization:

o VHDL was originally developed in the 1980s under the
VHSIC (Very High-Speed Integrated Circuits) program
initiated by the U.S. Department of Defence.
o It was standardized by the IEEE (Institute of Electrical
and Electronics Engineers) as IEEE 1076 in 1987, with
several subsequent revisions.
2. Language Features:
o Strongly Typed: VHDL is a strongly typed language,
which helps catch errors early in the design process.
o Concurrency: VHDL supports concurrent execution,
reflecting the parallel nature of hardware.
o Modular Design: Supports hierarchical and modular
design through entities and architectures.
o Simulation and Synthesis: VHDL can be used for both
simulation (to test and verify designs) and synthesis
(to generate hardware implementations).
3. Basic Constructs:
o Entity: Defines the interface of a hardware module,
including its inputs and outputs.
o Architecture: Describes the internal implementation
of the entity. Multiple architectures can be associated
with a single entity to represent different
implementations.
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

oSignal: Represents a wire or connection between

components in a digital circuit.
o Process: Describes a sequence of operations that are
executed sequentially but can run concurrently with
other processes.
o Component: Allows the instantiation of other entities
within architecture, enabling hierarchical design.
4. Applications:
o VHDL is used in various stages of hardware
development, including specification, design,
simulation, verification, and synthesis.
o It is used for designing both combinational and
sequential circuits, ranging from simple gates to
complex systems like processors and communication
protocols.
5. Advantages:
o Portability: VHDL code is portable across different
simulation and synthesis tools.
o Reusability: Modular design promotes reusability of
code.
o Maintainability: Strong typing and clear structure
make VHDL code maintainable and less error-prone.
6. Comparison with Verilog:
o VHDL is often compared to Verilog, another popular
hardware description language. VHDL is known for its
verbosity and strong typing, while Verilog is known for
its concise syntax and ease of learning.

VHDL is a powerful tool for digital system design, providing a

robust framework for describing and verifying complex hardware
systems before they are implemented in silicon.
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

Q4.) Explain about all types of modelling in VHDL?

Answer:

In VHDL, there are several types of modelling approaches used to

describe the behaviour and structure of digital systems. These
modelling types include behavioural modelling, dataflow
modelling, and structural modelling. Each type has its own use
cases and benefits, and they can be combined to create a
comprehensive hardware description. Here's an overview of each
type:

1. Behavioural Modelling

Behavioural modelling describes the behaviour of a digital system

using high-level constructs. It focuses on what the system does,
rather than how it is implemented. This type of modelling is often
used for initial design and simulation purposes.

 Process: The primary construct used in behavioural

modelling is the process block. Processes can include
sequential statements like if, case, loop, and others.
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

 Sequential Statements: Statements inside a process are

executed sequentially, mimicking the flow of a traditional
programming language.

2. Dataflow Modelling

Dataflow modelling describes how data moves through the

system using concurrent signal assignment statements. It focuses
on the flow of data and the relationships between inputs and
outputs.

 Concurrent Statements: Unlike behavioural modelling,

dataflow modelling uses concurrent signal assignments that
are evaluated continuously.
 Signal Assignment: This modelling type often uses simple
signal assignment statements and expressions to describe
combinational logic.

3. Structural Modelling

Structural modelling describes a system by specifying its

components and their interconnections. It focuses on the
hierarchy and the physical structure of the design.

 Component Instantiation: This modelling type uses

component instantiation to create instances of other entities.
 Port Maps: Port mapping connects the ports of instantiated
components to signals in the architecture.

4. Mixed Modelling

Mixed modelling combines elements from behavioural, dataflow,

and structural modelling to leverage the strengths of each
approach. This allows designers to describe complex systems
more naturally and efficiently.
21BEC0398 CHANDRESH RAJPOOT DA-1 10-06-2024

In summary, VHDL provides multiple modelling approaches

to describe digital systems effectively. Behavioural
modelling is useful for high-level functional descriptions,
dataflow modelling is suitable for describing combinational
logic, and structural modelling is ideal for capturing the
hierarchical organization of components. Mixed modelling
allows designers to combine these approaches to best suit
the needs of their design.