• 検索結果がありません。

(1)本問を選択

N/A
N/A
Protected

Academic year: 2021

シェア "(1)本問を選択"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

論理設計 (1)

本問を選択(Select this problem){ する(Yes),しない(No) } No.

2つの制御入力(C1, C2),及び4つのデータ入力(X3, X2, X1, X0)4つのデータ出力(Y3, Y2, Y1, Y0)をもつ 回路を考える.

C1 = 0, C2 = 0のとき,1ビット右に算術シフトする.

C1 = 0, C2 = 1のとき,2ビット右に算術シフトする.

C1 = 1, C2 = 0のとき,入力データを変えずに出力する.

C1 = 1, C2 = 1のとき,入力にかかわらず出力は全て0にする.

入力データと出力データの最上位ビットはそれぞれX3Y3であることに注意する.

1. Y2のカルノー図を作成せよ.

2. Y2について最小論理和形を示せ.

3. Y2の論理回路を設計せよ.

Consider a circuit with two control inputs (C1, C2), four input data (X3, X2, X1, X0), and four output data (Y3, Y2, Y1, Y0).

WhenC1 = 0, C2 = 0, do an arithmetic shift right by one bit.

WhenC1 = 0, C2 = 1, do an arithmetic shift right by two bits.

WhenC1 = 1, C2 = 0, pass the input data without change to the output.

WhenC1 = 1, C2 = 1, set the output data all 0s regardless the input.

Note that the most significant bits of the input and output are X3 and Y3, respectively.

1. Construct the Karnaugh map ofY2.

2. For Y2, show the minimal sum-of-products expression.

3. Design the logic circuit of Y2.

(解答は裏面を使用しても構わない.You can use the reverse side of this paper for your answering.)

参照

関連したドキュメント

[r]

Each toss generates head (H) or tail (T) as the result.. X の各値の確率の和は 1 になることを示せ。 ( Show that the sum of probabilities of all X’s

By using automata, explain that it is impossible to have a configuration in which only the leftmost and the rightmost lamps are ON by pushing switches A and B starting from

[r]

[r]

定数 C の値を定めよ。 (Compute the value of

We have three pegs A, B, C arranged in a row and in this order, and n disks initially stacked in increasing size on

Hint: Normal distribution is reproductive under summation and