Design a digital circuit with the minimum number of gates with the 4-bit input A = a3a2a1a0 and the 4-bit output B = b3b2b₁bo. Your design must be according to the following specifications - If A is 0, then B must take a don't care value. - If A is divisible by both 3 and 5, B must take a don't care value. - If A is divisible by 3 but not divisible by 5, then B = A ÷ 3. - If A is divisible by 5 but not divisible by 3, then B = A ÷ 5. - If A is not divisible by either 3 or 5, then B = A × 3. If this multiplication result exceeds the maximum allowed range value, then B must be replaced with a don't care value. a. Plot a truth table, K-maps, and derive the corresponding logic diagram. (Assume variables and their complements are available). Your diagram must be a single circuit producing all output bits of B. b. Redraw the logic diagram of the circuit using only NAND gates. (Assume variables and their complements are available) c. Redraw the logic diagram of the circuit using only NOR gates. (Assume variables and their complements are available)

Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter4: Processor Technology And Architecture
Section: Chapter Questions
Problem 9VE
icon
Related questions
Question
Design a digital circuit with the minimum number of gates with the 4-bit input A = a3a2a1a0
and the 4-bit output B = b3b2b₁bo. Your design must be according to the following
specifications
- If A is 0, then B must take a don't care value.
- If A is divisible by both 3 and 5, B must take a don't care value.
- If A is divisible by 3 but not divisible by 5, then B = A ÷ 3.
- If A is divisible by 5 but not divisible by 3, then B = A ÷ 5.
-
If A is not divisible by either 3 or 5, then B = A × 3. If this multiplication result exceeds
the maximum allowed range value, then B must be replaced with a don't care value.
a. Plot a truth table, K-maps, and derive the corresponding logic diagram. (Assume variables
and their complements are available). Your diagram must be a single circuit producing
all output bits of B.
b. Redraw the logic diagram of the circuit using only NAND gates. (Assume variables and
their complements are available)
c. Redraw the logic diagram of the circuit using only NOR gates. (Assume variables and
their complements are available)
Transcribed Image Text:Design a digital circuit with the minimum number of gates with the 4-bit input A = a3a2a1a0 and the 4-bit output B = b3b2b₁bo. Your design must be according to the following specifications - If A is 0, then B must take a don't care value. - If A is divisible by both 3 and 5, B must take a don't care value. - If A is divisible by 3 but not divisible by 5, then B = A ÷ 3. - If A is divisible by 5 but not divisible by 3, then B = A ÷ 5. - If A is not divisible by either 3 or 5, then B = A × 3. If this multiplication result exceeds the maximum allowed range value, then B must be replaced with a don't care value. a. Plot a truth table, K-maps, and derive the corresponding logic diagram. (Assume variables and their complements are available). Your diagram must be a single circuit producing all output bits of B. b. Redraw the logic diagram of the circuit using only NAND gates. (Assume variables and their complements are available) c. Redraw the logic diagram of the circuit using only NOR gates. (Assume variables and their complements are available)
Expert Solution
steps

Step by step

Solved in 2 steps with 8 images

Blurred answer
Similar questions
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
Principles of Information Systems (MindTap Course…
Principles of Information Systems (MindTap Course…
Computer Science
ISBN:
9781285867168
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781305480537
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT