Scribd
Upload
3 views

DIGITAL-LOGIC-SYSTEM

The document provides an overview of digital logic systems, focusing on Boolean Algebra, which serves as a theoretical foundation for digital circuits using binary values 0 and 1. It explains various logic gates, including AND, OR, NOT, NAND, NOR, XOR, and XNOR, detailing their operations and outputs based on input conditions. Additionally, it includes exercises for converting Boolean expressions into logic circuits and creating truth tables.

Uploaded by

eya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

DIGITAL-LOGIC-SYSTEM

The document provides an overview of digital logic systems, focusing on Boolean Algebra, which serves as a theoretical foundation for digital circuits using binary values 0 and 1. It explains various logic gates, including AND, OR, NOT, NAND, NOR, XOR, and XNOR, detailing their operations and outputs based on input conditions. Additionally, it includes exercises for converting Boolean expressions into logic circuits and creating truth tables.

Uploaded by

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

DIGITAL LOGIC

SYSTEM
OBJECTIVE
• Define what is Boolean Algebra is

• Identify different Logic Gates

• Illustrate the representation of different Logic Gates

• Convert Boolean algebra expression into a logic circuit

• Create truth tables for the corresponding logic circuit and Boolean
expression
BOOLEAN ALGEBRA
• Boolean Algebra is a theoretical foundation for digital system

• Boolean Algebra is a mathematical system with a set of elements, a


set of operators and a number of unproved postulate

• Boolean Algebra can only have only two values, 0 and 1. The
Boolean 0 and 1 do not represent actual numbers is instead a state
of a voltage which is known as the logical level.

• Boolean Algebra is use as a tool for the analysis and design of logic
circuit.
3
BOOLEAN ALGEBRA TERMS
• VARIABLE – Symbol used for representation (Letter or word)

• COMPLEMENT – Inverse of a variable ( opposite value).


Usually denoted by a’ or overbar a.

• LITERAL – is either a variable or the complement. Usually


one with expected value.

4
LOGIC GATES
A logic gate is a device that acts as a building block for digital circuits.
They perform basic logical functions that are fundamental to digital circuits.
Most electronic devices we use today will have some form of logic gates in
them.

In a circuit, logic gates work based on a combination of digital signals


coming from its inputs. Most logic gates have two inputs and one output,
and they are based on Boolean algebra. At any given moment, every
terminal is in one of the two binary conditions: true or false. False
represents 0, and true represents 1.

5
BASIC LOGIC GATES
There are seven basic logic gates:
AND
OR
NOT
NAND
NOR
XOR
XNOR

6
AND GATE
AND Operation is a form of logic multiplication represented by the (.)
sign with two or multiple inputs producing a single output. The AND
Operation produces HIGH output (1) only if all the inputs to the digital
circuit are HIGH (1). If one or both of the inputs are LOW (0), the output
of the digital circuit will also be LOW (0).

7
OR GATE
OR Operation is a form of logic
addition represented by the (+) sign
with two or multiple inputs producing
one output. The OR Operation
produces HIGH output (1) only if one
or all the inputs to the digital circuit
are HIGH (1). If both of the inputs are
LOW (0), the output of the digital
circuit will also be LOW (0).

8
NOT GATE
NOT is an Operation in the form of logic inversion, known as a
complement. There is a single input producing the only output. NOT
operation produces a HIGH (1) output for a LOW (0) input and a LOW
(0) output for a HIGH (1) input.

It is represented by a bar (ˉ) over the variable.

9
NAND GATE
A NAND Gate is a complement of AND Gate or simply, a combination
of NOT Gate and AND Gate. It is called NAND as N stands for NOT,
meaning a NOT AND Gate. For two or more inputs, the NAND gate
produces a HIGH (1) output only if one of the inputs is LOW (0).

10
NOR GATE
A NOR Gate is a complement of OR Gate or a combination of NOT Gate
and OR Gate. It is called NOR as N stands for NOT, meaning a NOT OR
Gate. For two or more inputs, the NOR gate produces a HIGH (1) output;
only both inputs are LOW (0).
The NOR Gate Boolean expression is denoted by a complement of OR.
Y= (A+B)ˉ

11
EXCLUSIVE OR , XOR GATE
Ex-OR gate has two or more inputs but a single output. Ex-OR gate
generates a HIGH (1) output if both the inputs are not at the same logic
level A≠B.

12
EXCLUSIVE NOR, XNOR GATE
EX-NOR gate has two or more inputs but a single output. EX-NOR gate
generates a HIGH (1) output if both the inputs are at the same logic level
A=B.

13
EXERCISES
1. AB + A + B
2. AB + B
3. A+B (B+C)
4. A+B+BC
5. AB+C
6. ABC
7. (A+B) (AB)

14

You might also like