Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Implement the four functions described in Exercise B.11 using a PLA

Short Answer

Expert verified

X contains only one 0:

X=~x2.x1.x0+x2.~x1.x0+x2.x1.~x0

X contains an even number of zero

X=~x2.~x1.x0+~x2.x1.~x0+x2.~x1.~x0

X interpreted as an unsigned binary number less than 4

Y=~x2

X interpreted as a negative number

Y=x2

Step by step solution

01

Determine the logical gates

The PLA is the programmable logical array that is used to illustrate the logical circuits, The basic logic gates are AND, OR, and NOT. AND gate will take two inputs and produce output as 1 only if both the inputs are 1. OR gate will take two inputs and produce output 1 if any of the inputs is 1. NOT gate will take only one input and gives the opposite of the input as the output. 1.

02

Determine the logic functions

Given that the X consists of 3 bits x0, x1, and x2. The logic functions for which that are true if and only if

  • X contains only one 0
  • X contains an even number of 0s
  • X when interpreted as an unsigned binary number is less than 4
  • X when interpreted as a signed (two’s complement) number is negative.

For X contains only one zero, only one of the three bits should be zero. The logical function that satisfies this condition is as follows:

X=~x2.x1.x0+x2.~x1.x0+x2.x1.~x0

The logical circuit is as follows:

For X contains an even number of 0s, two bits of the three bits should be zero. The logical function that satisfies this condition is as follows:

X=~x2.~x1.x0+~x2.x1.~x0+x2.~x1.~x0

The logical circuit is as follows:

For X when interpreted as an unsigned binary number is less than 4 is as follows:

Y=~x2

The logical circuit is as follows:

ForX when interpreted as a signed (two’s complement) number is negative. The values will be complements and the logical function is as

Y=x2

The logical circuit is as follows:

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Describe the steps that transform a program written in a high-level language such as C into a representation that is directly executed by a computer processor.

Perhaps the most likely case of adding many numbers at once in a computer would be when trying to multiply more quickly by using any adders to add many numbers in a single clock cycle. Compared to the multiply algorithm in Chapter 3, a carry save scheme with many adders could multiply more than 10 times faster. This exercise estimates the cost and speed of a combinational multiplier to multiply two positive 16-bit numbers. Assume that you have 16 intermediate terms M15, M14, …, M0, called partial products, that contain the multiplicand ANDed with multiplier bits m15, m14, …, m0. The idea is to use carry save adders to reduce the noperands into 2n/3 in parallel groups of three, and do this repeatedly until you get two large numbers to add together with a traditional adder.

First, show the block organization of the 16-bit carry save adders to add these 16 terms, as shown on the right in Figure B.14.1. Then calculate the delays to add these 16 numbers. Compare this time to the iterative multiplication scheme in Chapter 3 but only assume 16 iterations using a 16-bit adder that has full carry lookahead whose speed was calculated in Exercise B.29.

We wish to add the instruction jal (jump and link). Make any necessary changes to the datapath or to the control signals if needed. You can photocopy figures to make it faster to show the additions. How many product terms are required in a PLA that implements the control for the single-cycle datapath for jal?

Show that there are 2nentries in a truth table for a function with n inputs.

Now we wish to add the instructionaddi(add immediate). Add any necessary changes to the datapath and to the control signals. How many product terms are required in a PLA that implements the control for the single-cycle datapath foraddiu?

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free