Unit LV Digital Electronics

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 6

Unit lv Digital electronics :: Logic gates :

DEFINITION ::
A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and
one output. At any given moment, every terminal is in one of the two binaryconditions low (0)
or high (1), represented by different voltage levels. The logic state of a terminal can, and generally
does, change often, as the circuit processes data. In most logic gates, the low state is approximately
zero volts (0 V), while the high state is approximately five volts positive (+5 V).There are seven basic
logic gates: AND, OR, XOR, NOT, NAND, NOR, and XNOR.

1. AND gate ::

An AND gate is a digital circuit having two inputs and one out put. The out put is high if and olny if
both inputs are high.

AND gate truth table ::

Input Input Output


A B X= A.B

  0   0   0

  0 1   0

1   0   0

1 1 1

circuit for AND gate.


OR gate :::The OR gate gets its name from the fact that it behaves after the fashion of the logical
inclusive "or." The output is high if either or both of the inputs are high If both inputs are low then
the output is low.

Out put X = 1 if either A or B or both are 1. Hence out put of OR gate X = A+B.

OR gate

Truth table of OR gate ::


Input Input B O/P X = A+ B
A

  0   0 0 

  0 1 1

1   0 1

1 1 1

circuit for OR gate.

NOTgate ::
A logical inverter , sometimes called a NOT gate to differentiate it from other types of electronic

inverter devices, has only one input. It reverses the logic state.

 Inverter or NOT gate truth table


Input A Output X=
A’

0   1

  1 0

The NAND gate operates as an AND gate followed by a NOT gate. It acts in the manner of the logical
operation "and" followed by negation. The output is "false" if both inputs are "true." Otherwise, the
output is "true."

NAND gateThe NAND gate operates as an AND gate followed by a NOT gate. It acts in the manner
of the logical operation "and" followed by negation. The output is equal to the complementary of
AND gate. NAND gate of A and B inputs = Q = (A. B )’

NAND gate

Input A Input B O/P X= (A.B)’

  0   0 (0.0) ‘ = 1

  0 1 (0.1)’ = 1

1   0 (1.0)‘= 1

1 1   (1.1)’= 0

NOR gate ::

The NOR gate is a combination OR gate followed by an inverter. So it is the complementary of OR


gate . NOR gate between A and B = Q = (A+B)’
Adder circuits ::
Adders are digital circuits that carry out addition of numbers . it adds the binary bits. There are two
types if adder circuits .1. half adder which adds two binary bits only and 2. Full adder which add
more than two bits.

Half Adder

Half adder is a combinational circuit that performs simple addition of two binary numbers.

It has two inputs and two out puts. The block diagram of a half adder is shown below.

Schematic Representation of Half Adder : circuit diagram ::

Half adder with AND gates: ::


Full Adder :
Full adder is a digital circuit used to calculate the sum of three binary bits which is the main
difference between this and half adder. Full adders are complex and difficult to implement when
compared to half adders. Two of the three bits are same as before which are A, the augend bit and
B, the addend bit. The additional third bit is carry bit from the previous stage and is called Carry –
in generally represented by CIN. It calculates the sum of three bits along with the carry. The
output carry is called Carry – out and is represented by COUT.

The block diagram of a full adder with A, B and CIN as inputs and S, CoUT as outputs is shown 

Block diagram of Full adder :


Full adder : block diagram::

**Binary Decimal Conversion Chart Table


Binary Decimal

0000 0

0001 1

0010 2

0011 3

0100 4

0101 5

0110 6

0111 7

1000 8

1001 9

You might also like