Scribd
Upload
44 views10 pages

Testing and Verification of VLSI Circuits Assignment 1: Perumalla Koteswara Rao - 19307R020 February 24, 2021

This document contains an assignment on testing and verification of VLSI circuits. It includes 5 questions regarding logic functions and exists quantification. Question 5 analyzes two logic functions, h and w, defined in terms of the function f, and shows that for all combinations of the variables x5, x6, x7, x8, there exists a combination of x1, x2, x3, x4 that makes f=1. For w, there only needs to be some combination that makes f=1.

Uploaded by

Naveen Thotapalli
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
44 views10 pages

Testing and Verification of VLSI Circuits Assignment 1: Perumalla Koteswara Rao - 19307R020 February 24, 2021

This document contains an assignment on testing and verification of VLSI circuits. It includes 5 questions regarding logic functions and exists quantification. Question 5 analyzes two logic functions, h and w, defined in terms of the function f, and shows that for all combinations of the variables x5, x6, x7, x8, there exists a combination of x1, x2, x3, x4 that makes f=1. For w, there only needs to be some combination that makes f=1.

Uploaded by

Naveen Thotapalli
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/ 10

Testing and Verification of VLSI Circuits

Assignment 1
Perumalla Koteswara Rao - 19307R020
February 24, 2021

Question 1

Question 2

1
2
Question 3

3
4
Question 4

5
6
7
8
Question 5a

Given

f=x1 .x2 .(∼ x3 ) + x4 .x5 + (∼ x6 ).x7 + x8


h(x5 , x6 , x7 , x8 ) = ∃x4 (∃x3 (∃x2 (∃x1 (fx1 + fx1 ))))
h1(x2 , x3 , x4 , x5 , x6 , x7 , x8 ) = ∃x1 (fx1 + fx1 ) = x2 .(∼ x3 ) + x4 .x5 + (∼ x6 ).x7 + x8
h2(x3 , x4 , x5 , x6 , x7 , x8 ) = ∃x2 (h1x2 + h1x2 ) = (∼ x3 ) + x4 .x5 + (∼ x6 ).x7 + x8
h3(x4 , x5 , x6 , x7 , x8 ) = ∃x3 (h2x3 + h2x3 ) = x4 .x5 + (∼ x6 ).x7 + x8 + 1 = 1
h4(x5 , x6 , x7 , x8 ) = ∃x4 (h3x4 + h3x4 ) = 1
⇒ h4(x5 , x6 , x7 , x8 ) = h(x5 , x6 , x7 , x8 ) = 1
⇒ h(x5 , x6 , x7 , x8 ) = 1

Therefore, for all combinations of x5 , x6 , x7 , x8 there exists some combinations of x1 , x2 , x3 , x4 which makes
the function f (b1 , b2 , b3 , b4 , x5 , x6 , x7 , x8 ) = 1.

9
Question 5b

Given

f=x1 .x2 .(∼ x3 ) + x4 .x5 + (∼ x6 ).x7 + x8


w(x5 , x6 , x7 , x8 ) = ∃x4 (∃x3 (∃x2 (∃x1 (fx1 .fx1 ))))
h1(x2 , x3 , x4 , x5 , x6 , x7 , x8 ) = ∃x1 (fx1 .fx1 ) = x4 .x5 + (∼ x6 ).x7 + x8
h2(x3 , x4 , x5 , x6 , x7 , x8 ) = ∃x2 (h1x2 .h1x2 ) = x4 .x5 + (∼ x6 ).x7 + x8
h3(x4 , x5 , x6 , x7 , x8 ) = ∃x3 (h2x3 .h2x3 ) = x4 .x5 + (∼ x6 ).x7 + x8
h4(x5 , x6 , x7 , x8 ) = ∃x4 (h3x4 .h3x4 ) = (∼ x6 ).x7 + x8
⇒ h4(x5 , x6 , x7 , x8 ) = w(x5 , x6 , x7 , x8 ) = (∼ x6 ).x7 + x8
⇒ w(x5 , x6 , x7 , x8 ) = (∼ x6 ).x7 + x8

Therefore, for some combinations of x5 , x6 , x7 , x8 there exists all combinations of x1 , x2 , x3 , x4 which makes
the function f (b1 , b2 , b3 , b4 , x5 , x6 , x7 , x8 ) = 1.

10

You might also like