Timeline for How do I expand the divider?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2017 at 11:14 | comment | added | Uwe | A small example, we assume we have a divider for 4 bit numbers and want to build a 8 bit divider. We have to find a factorization of the divider number with two factors representable with 4 bits, but this is not possible for all prime numbers larger 15: 17, 19, 23, 29, 31, 37, 41, 43, 47, 53.. It is also not possible for all products with a factor being a prime larger than 15: 34, 38, 46, 58, 62, 74... and 51, 57, 69, 87... | |
| Jan 10, 2017 at 10:14 | comment | added | Uwe | My "a/c/d + b/c/d" would not help you if the divider number is a prime number larger than 32 bits. Spliting the divider into c and d is not possible for prime numbers. You don't want a divider expansion that only works for some special numbers but not all possible numbers smaller than 128 bit. | |
| Jan 9, 2017 at 18:18 | comment | added | TChapman500 | I edited my question to include a circuit that I came up with based on your "a/c/d + b/c/d" answer. How do I hook up the remainers? | |
| Jan 9, 2017 at 15:11 | history | answered | Uwe | CC BY-SA 3.0 |