New answers tagged digital-circuits
1
vote
Combinational logic check if bits is prime
Of course, the circuit will just grow rapidly. For 8 bits there is no problem.
You check whether bit 0 is 0 or 1. If it is 0, then you check whether the input is 2.
If it is 1, then you check bit 7. ...
3
votes
Combinational logic check if bits is prime
There is no known regularity in the primes, and for small numbers (such as 8 bits naturals), the best is to implement them as a table.
If you want an instant answer, one comparator per prime can do. ...
Top 50 recent answers are included
Related Tags
digital-circuits × 92computer-architecture × 22
boolean-algebra × 19
circuits × 18
logic × 15
arithmetic × 12
karnaugh-map × 8
cpu × 4
sequential-circuit × 4
algorithms × 2
complexity-theory × 2
graphs × 2
turing-machines × 2
optimization × 2
computation-models × 2
computer-networks × 2
memory-hardware × 2
binary × 2
multiplication × 2
combinatory-logic × 2
finite-automata × 1
asymptotics × 1
machine-learning × 1
artificial-intelligence × 1
neural-networks × 1