Beruflich Dokumente
Kultur Dokumente
Difficulties
We may not have a logic gate for every possible function.
It may be a challenge to rewrite our combinational
logic expression so that each term represents a gate.
Not all gate networks that compute a given function are alike
-networks may differ greatly in their area and speed.
-find a network that satisfies our area and speed
requirements, which may require drastic
restructuring of our original logic expression.
2) Define the term completeness and also give an example.
2
Completeness
A set of logical functions is complete if we can generate
every possible Boolean expression using that set of
functions
Ex: NAND function
3)Explain about irredundancy.
3
Irredundancy
Logic expression is irredundant if no literal can be
removed from the expression without changing its
truth value.
For example, ab + ab' is redundant, because it can
be reduced to a.
4) Draw the static complementary gate that computes
a’b’ + c’d’.
4
5
analytical/numerical model
REFER: SOC_Unit_1_part2.ppt
12
Refer : SOC_Unit_1_part2a.ppt
Refer : SOC_Unit_1_part3.ppt
13
Refer: SOC_Unit_1_part4
14
Refer: SOC_Unit_1_part5