Question: Design a logic circuit that will indicate whether a 4-bit binary input is exactly divisible by 2 or 7. That is, the output (F) will
Design a logic circuit that will indicate whether a 4-bit binary input is exactly divisible by 2 or 7. That is, the output (F) will be true (Logic 1) when the input is divisible by any of the two numbers.
The implementation of your design must meet the following requirements:
1. using NAND gates ONLY 2. with minimal number of gates 3. each gate has minimal number of inputs.
Use Micro-Cap to simulate and confirm the operation of your logic circuit.
For this question in particular I have been told that the "divisible" means the quotient must be above zero. Meaning with an input of A=0 B=0 C=0 D=0 F=0. This obviously makes the solution more complicated.
Therefore the table is,
| A | B | C | D | F (Output) |
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 0 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Study Help