Determine the minimal sum of products for boolean expression, Computer Engineering

Assignment Help:

Determine the Minimal sum of products for the Boolean expression?

Obtain the minimal sum of products for the Boolean expression f=(1,2,3,7,8,9,10,11,14,15) using Quine-McCluskey method.

Initially these minterms are represented in the binary form as shown in below table and the above binary representation is grouped into a number of sections in terms of the number of 1's as shown in below table.

Binary representation of minterms

Minterms

U

V

W

X

1

0

0

0

1

2

0

0

1

0

3

0

0

1

1

7

0

1

1

1

8

1

0

0

0

9

1

0

0

1

10

1

0

1

0

11

1

0

1

1

14

1

1

1

0

15

1

1

1

1

The Group of minterms for different number of 1's

of 1's

Minterms

U

V

W

X

1

1

0

0

0

1

1

2

0

0

1

0

1

8

1

0

0

0

2

3

0

0

1

1

2

9

1

0

0

1

2

10

1

0

1

0

3

7

0

1

1

1

3

11

1

0

1

1

3

14

1

1

1

0

4

15

1

1

1

1

Any of two numbers in these groups which differ from each other by only one variable can be combined and chosen, to get 2-cell combination as shown in table below.

2-Cell combinations

Combinations

U

V

W

X

(1,3)

0

0

-

1

(1,9)

-

0

0

1

(2,3)

0

0

1

-

(2,10)

-

0

1

0

(8,9)

1

0

0

-

(8,10)

1

0

-

0

(3,7)

0

-

1

1

(3,11)

-

0

1

1

(9,11)

1

0

-

1

(10,11)

1

0

1

-

(10,14)

1

-

1

0

(7,15)

-

1

1

1

(11,15)

1

-

1

1

(14,15)

1

1

1

-

From the 2-cell combinations, dash and one variable in the same position can be combined to form 4-cell combinations as shown in figure below.

Combinations

U

V

W

X

(1,3,9,11)

-

0

-

1

(2,3,10,11)

-

0

1

-

(8,9,10,11)

1

0

-

-

(3,7,11,15)

-

-

1

1

(10,11,14,15)

1

-

1

-

The cells (1, 3) and (9, 11) form a same 4-cell combination as the cells (1, 9) and (3, 11). The order in which the cells are placed in the combination doesn't have any effect. Therefore (1, 3, 9, 11) combination could be written as (1, 9, 3, 11).

From above 4-cell combination table and the prime implicants table can be plotted as shown in table below.

The Prime Implication Table

Prime Implicants

1

2

3

7

8

9

10

11

14

15

(1,3,9,11)

X

-

X

-

-

X

-

X

-

-

(2,3,10,11)

-

X

X

-

-

-

X

X

-

-

(8,9,10,11)

-

-

-

-

X

X

X

X

-

-

(3,7,11,15)

-

-

-

-

-

-

X

X

X

X

-

X

X

-

X

X

-

-

-

X

-

 

 

 

 

 

 

The columns contain only one cross mark corresponds to essential prime implicants and a yellow cross is used against every essential prime implicant and the sum of the prime implicants gives the function in its minimal SOP form.

   Y = V'X + V'W + UV' + WX + UW


Related Discussions:- Determine the minimal sum of products for boolean expression

Describe about relationships and look up fields, Relationships are imported...

Relationships are imported from the source to finish without any hindrance but once they land in the destination they can never be changed or changed and change of extensions canno

What is arithmetic and logic unit, What is Arithmetic and Logic Unit Ar...

What is Arithmetic and Logic Unit Arithmetic and Logic Unit: The ALU is the 'core' of any processor. It implements all arithmetic operations (addition, multiplication, subtract

What is monkey testing, What is Monkey testing? The monkey testing is ...

What is Monkey testing? The monkey testing is the process of testing here and there for judging the application trying to observe the accessing dissimilar functionalities is i

Explain the use of functions in parallel programming, Q. Explain the Use of...

Q. Explain the Use of functions in parallel programming? include "pvm3.h" main() {    int cc, tid, msgtag;    char buf[100];    printf("%x\n", pvm_mytid());

Objectives-parallel computer architecture , Objectives After going thro...

Objectives After going through this part, you will be capable to: Examine the meaning of Pipeline processing and explain pipeline processing architectures; Classify

Handlers classification, Handler's Classification In 1977, Wolfgang Han...

Handler's Classification In 1977, Wolfgang Handler proposed an detailed notation for expressing the parallelism and pipelining of computers. Handler's classification addresses

Explain concurrent sharing, Explain Concurrent sharing. Concurrent s...

Explain Concurrent sharing. Concurrent sharing: Some number of programs may share a file concurrently. While this is the case, this is essential to ignore mutual interferen

Explain the action-object matrix, Explain the Action-object matrix A...

Explain the Action-object matrix A matrix showing how update actions influence objects.  It may be considered to be part of user object model as it summarizes user object ac

Hardware implementation for signed-magnitude data, Hardware Implementation ...

Hardware Implementation for signed-magnitude data When multiplication  is  implemented  in  digital  computer,  we  change  process lightly. Here, in place of providing registe

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd