Scribd
Upload
21 views29 pages

Logicgates-Combinational Circuits

Computer organization

Uploaded by

tisiren1974
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
21 views29 pages

Logicgates-Combinational Circuits

Computer organization

Uploaded by

tisiren1974
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/ 29

COMPUTER ORGANIZATION

Logic Gates, Boolean Algebra,


Combinational Circuits
Logic Gates
A logic gate is an elementary building block of a
digital circuit. Most logic gates have two input
and one output.
At any given moment, every terminal is in one
of the two binary conditions low (0) or high (1),
represented by different voltage levels.
There are seven basic logic gates: AND, OR,
XOR, NOT, NAND, NOR, and XNOR.
0 is called "false" and 1 is called "true,”
AND Gate

• The output is "true" when both inputs are


"true." Otherwise, the output is "false."

Input 1 Input 2 Output


0 0 0
0 1 0
1 0 0
1 1 1
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 "true" if either or
both of the inputs are "true." If both inputs
are "false," then the output is "false.“
Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 1
XOR Gate
• The XOR ( exclusive-OR ) gate acts in the same
way as the logical "either/or." The output is
"true" if either, but not both, of the inputs are
"true." The output is "false" if both inputs are
"false" or if both inputs are "true."
Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 0
NOT Gate
• 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.

Input Output
1 0
0 1
NAND Gate
• 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."

Input 1 Input 2 Output


0 0 1
0 1 1
1 0 1
1 1 0
NOR Gate
• The NOR gate is a combination OR gate
followed by an inverter. Its output is "true" if
both inputs are "false." Otherwise, the output
is "false."
Input 1 Input 2 Output

0 0 1
0 1 0
1 0 0
1 1 0
XNOR Gate
• The XNOR (exclusive-NOR) gate is a
combination XOR gate followed by an inverter.
Its output is "true" if the inputs are the same,
and"false" if the inputs are different
Input 1 Input 2 Output
0 0 1
0 1 0
1 0 0
1 1 1
• Using combinations of logic gates, complex operations
can be performed. In theory, there is no limit to the
number of gates that can be arrayed together in a single
device.
• But in practice, there is a limit to the number of gates
that can be packed into a given physical space.
• Arrays of logic gates are found in digital integrated
circuits (ICs).

• As IC technology advances, the required physical volume


for each individual logic gate decreases and digital
devices of the same or smaller size become capable of
performing ever-more-complicated operations at ever-
increasing speeds.
Boolean Algebra
• A set of rules formulated by the English mathematician
George Boole describe certain propositions whose
outcome would be either true or false.

• With regard to digital logic, these rules are used to


describe circuits whose state can be either, 1 (true) or 0
(false).

• In order to fully understand this, the relation between


the an AND gate, OR gate and NOT gate operations
should be appreciated.

• A number of rules can be derived from these relations


as shown in the below table.
Boolean Laws
Using the truth table:
• Example 1
solving algebraically
Example 2

Example 3
Combinational Circuits
• Combinational circuit is circuit in which we combine
the different gates in the circuit for example encoder,
decoder, multiplexer and demultiplexer. Some of the
characteristics of combinational circuits are following.
• The output of combinational circuit at any instant of
time, depends only on the levels present at input
terminals.
• The combinational circuit do not use any memory.
• The previous state of input does not have any effect
on the present state of the circuit.
• A combinational circuit can have a n number of inputs
and m number of outputs.
Block Diagram
• Half Adder
• Half adder is a combinational logic circuit with two
input and two output.
• The half adder circuit is designed to add two single
bit binary number A and B.
• It is the basic building block for addition of two single
bit numbers.
• This circuit has two outputs carry and sum.
Half Adder
• Full Adder
Full adder is developed to overcome the
drawback of Half Adder circuit.
It can add two one-bit numbers A and B, and
carry c.
The full adder is a three input and two
output combinational circuit.
Full Adder
• N-Bit Parallel Adder
• The Full Adder is capable of adding only two
single digit binary number along with a carry
input.
• But in practical we need to add binary numbers
which are much longer than just one bit.
• To add two n-bit binary numbers we need to use
the n-bit parallel adder.
• It uses a number of full adders in cascade.
• The carry output of the previous full adder is
connected to carry input of the next full adder.
4 Bit Parallel Adder

• In the block diagram, A0 and B0 represent the


LSB of the four bit words A and B. Hence Full
Adder-0 is the lowest stage.
• Hence its Cin has been permanently made 0. The
rest of the connections are exactly same as
those of n-bit parallel adder is shown in fig.
• The four bit parallel adder is a very common
logic circuit.
• N-Bit Parallel Subtractor

• The subtraction can be carried out by taking


the 1's or 2's complement of the number to
be subtracted.
• For example we can perform the subtraction
(A-B) by adding either 1's or 2's complement
of B to A.
• That means we can use a binary adder to
perform the binary subtraction.
• 4 Bit Parallel Subtractor
The number to be subtracted (B) is first passed
through inverters to obtain its 1's complement.
The 4-bit adder then adds A and 2's complement of B
to produce the subtraction.
S3 S2 S1 S0 represent the result of binary subtraction
(A-B) and carry output Cout represents the polarity of
the result.

If A > B then Cout =0 and the result of binary form (A-


B) then Cout = 1 and the result is in the 2's
complement form.
4 Bit Parallel SUBTRACTOR
• Half Subtractors
• Half subtractor is a combination
circuit with two inputs and two
outputs (difference and
borrow).
• It produces the difference
between the two binary bits at
the input and also produces a
output (Borrow) to indicate if a
1 has been borrowed.
• In the subtraction (A-B), A is
called as Minuend bit and B is
called as Subtrahend bit.
• Full Subtractors

• The disadvantage of a half subtractor is


overcome by full subtractor.

• The full subtractor is a combinational circuit


with three inputs A,B,C and two output D and
C'. A is the minuend, B is subtrahend, C is the
borrow produced by the previous stage, D is
the difference output and C' is the borrow
output.
Full Subtractors
THANK YOU FOR YOUR ATTENTION!

You might also like