Question: BACKGROUND: QUESTION: 1. Given the following truth table: Problem 1: Simple Truth Table a b c 0 001 0 0 010 1 0 1 0

BACKGROUND: BACKGROUND: QUESTION: 1. Given the following truth table: Problem 1: SimpleTruth Table a b c 0 001 0 0 010 1 0

QUESTION:

1 0 1 0 0 1 0 1 000 0 1 0

1. Given the following truth table: Problem 1: Simple Truth Table a b c 0 001 0 0 010 1 0 1 0 1 0 0 1 0 1 000 0 1 0 1 0 1 1 0 1 1 1 0 1 (a) [5 points] Write an entity declaration for the system described by the truth table. The inputs are a, b, c, and the outputs are x and y. Name the entity smpl combo. (b) [10 points] Write an architecture named dataflow that uses a canonical sum-of-products Boolean assignment statement for x and a canonical product-of-sums Boolean assignment state- ment for y. (c) [10 pt.s] Write an alternative architecture named selected that uses a single selected sig- nal assignment statement to describe the function. Solutions 1. Given the following truth table: Problem 1: Simple Truth Table a b c 0 001 0 0 010 1 0 1 0 1 0 0 1 0 1 000 0 1 0 1 0 1 1 0 1 1 1 0 1 (a) [5 points] Write an entity declaration for the system described by the truth table. The inputs are a, b, c, and the outputs are x and y. Name the entity smpl combo. (b) [10 points] Write an architecture named dataflow that uses a canonical sum-of-products Boolean assignment statement for x and a canonical product-of-sums Boolean assignment state- ment for y. (c) [10 pt.s] Write an alternative architecture named selected that uses a single selected sig- nal assignment statement to describe the function. Solutions

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!