Scribd
Upload
53 views

Assignment On Computer Architecturel

define full adder distinguish between combinational logic and sequential logic karnaugh maps Sum of Products andProduct of Sums

Uploaded by

Samuel Gregory Kurian
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
53 views

Assignment On Computer Architecturel

define full adder distinguish between combinational logic and sequential logic karnaugh maps Sum of Products andProduct of Sums

Uploaded by

Samuel Gregory Kurian
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Full Adder

A full adder adds binary numbers and accounts for values carried in as well as
out. A one-bit full adder adds three one-bit numbers, often written as A, B, and
Cin (carry input); A and B are the operands, and C in is a bit carried in from the
previous less significant stage.
A

Ci
n

The circuit produces a twoand sum typically


A full adder can be
different ways such as with
circuit or composed of
implementation is :

0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1

0
0
0
0
1
1
1
1

Su
m
0
1
1
0
0
0
0
1

Cou
t

0
0
0
1
1
1
1
1

bit output, output carry


represented as Cout and S.
implemented in many
a custom transistor-level
other gates. One example

S = (ABCin)
Cout = (A.B)+(Cin.(AB))

Define SoP and PoS


The SoP and PoS are the two forms of a Boolean logic functions, crafted for the
simplification of the calculation process

SoP (Sum of Products)


The SOP form takes on the appearance of being a sum of several terms, each of
which is the product of several factors. To craft the SOP form of a Boolean logic
function, we merely need to OR together the minterms associated with each
combination of inputs for which the overall output should be True. Example :
F = ABC + ABC + ABC + ABC + ABC

PoS (Product of Sums)


The POS form takes on the appearance of being a product of several factors,
each of which is the sum of several terms.To craft the POS form of a Boolean
logic function, we merely need to AND together the maxterms associated with
each combination of inputs for which the overall output should be False.
Example:
F = (A + B + C) (A + B + C) (A + B + C)

Karnaugh Maps
The Karnaugh map, also known as the K-map, is a method to simplify boolean
algebra expressions.
In the example above, the four input variables can be combined in 16 different
ways, so the truth table has 16 rows, and the Karnaugh map has 16 positions.
The Karnaugh map is therefore arranged in a 4 4 grid. The row and column
indices (shown across the top, and down the left side of the Karnaugh map) are
ordered in Gray code rather than binary numerical order. Gray code ensures that
only one variable changes between each pair of adjacent cells. Each cell of the
completed Karnaugh map contains a binary digit representing the function's
output for that combination of inputs. After the Karnaugh map has been
constructed, it is used to find one of the simplest possible forms a canonical
form for the information in the truth table. Adjacent 1s in the Karnaugh map
represent opportunities to simplify the expression. The minterms ('minimal
terms') for the final expression are found by encircling groups of 1s in the map.
Minterm groups must be rectangular and must have an area that is a power of
two (i.e., 1, 2, 4, 8). Minterm rectangles should be as large as possible without
containing any 0s. Groups may overlap in order to make each one larger.

Distinguish between Combinational


Logic and Sequential Logic
Sequential logic circuits have its output based on the inputs and the present
states of the system, while combinational logic circuits output is based only on
the present inputs.
Sequential Logic Circuits have a memory, while combinational logic circuits do
not have the ability to retain data (state)
Combinational Logic Circuits are used mainly for arithmetic and Boolean
operations, while sequential logic circuits are used for storage of data.
Combinational logic circuits are built with logic gates as the elementary device
while, in most cases, sequential logic circuits have (f-fs) as the elementary
building unit.
Most sequential circuits are clocked (triggered for operation with electronic
pulses), while combinational logic does not have clocks.
Combinational logic uses only the present inputs to determine the output while
sequential logic uses both present inputs as well as previous outputs to
determine the current input.
Combinational logic is used to implement basic Boolean operations while
sequential logic is used to create memory elements.

Sequential logic uses the feedbacks from the output to inputs while
combinational logic does not require feedbacks.

You might also like