03-05-2015, 04:29 AM
(This post was last modified: 03-05-2015, 04:40 PM by Apocryphan.)
After trying something a little different, looking at this from a different angle and under a different light. I think i've found a way to make hex analog division work with larger numbers, this method can be adjusted for numbers larger than 2 digits as well. I will try my best to explain it for you. any explanations amid the process shall be italicized.
So to start we want to divide the 2 hex digits AB by 2 hex digits XY AB/XY=MN
![[Image: rLcHIQs.png]](http://i.imgur.com/rLcHIQs.png)
didn't like your list layout =P
although there is a major flaw using a repeat check, the first repeat can be up to 15 times, this can be fixed by increasing stages. And we can determine the most effecient with some simple math once i get some numbers to go off of.
Max amount of checks (excluding final stage and starter checks)
4 stages: y0, 8xy, 4xy, xy
# of checks: 15,1,1,3
-max: 20 moves
5 stages: 4y0, y0, 8xy, 4xy, xy
# of checks: 3,3,1,1,3
-max: 11 moves
6 stages: 8y0, 4y0, y0, 8xy, 4xy, xy
# of checks: 1,1,3,1,1,3
-max: 10 moves
8 stages: 8y0, 4y0, 2y0, y0, 8xy, 4xy, 2xy, xy
# of checks: 1,1,1,1,1,1,1,1
-max: 8 moves
so determine efficiency i just need to get some timing speeds.
C=ticks per check
S=ticks per stage shift
T=ticks per subtraction
4 stage: 20C + 4s + 20T
5 stage: 11C + 5s + 11T
6 stage: 10C + 6s + 10T
8 stage: 8C + 8s + 8T
Just a guess but if i can keep the stage shift ticks to a minimum, 8 stages will pay off. working on implementing the multipliers and check circuits is another story. some wont add delay and some may be quicker to just put through and check false on a major compare rather than on a minor redundancy check.
So to start we want to divide the 2 hex digits AB by 2 hex digits XY AB/XY=MN
didn't like your list layout =P
although there is a major flaw using a repeat check, the first repeat can be up to 15 times, this can be fixed by increasing stages. And we can determine the most effecient with some simple math once i get some numbers to go off of.
Max amount of checks (excluding final stage and starter checks)
4 stages: y0, 8xy, 4xy, xy
# of checks: 15,1,1,3
-max: 20 moves
5 stages: 4y0, y0, 8xy, 4xy, xy
# of checks: 3,3,1,1,3
-max: 11 moves
6 stages: 8y0, 4y0, y0, 8xy, 4xy, xy
# of checks: 1,1,3,1,1,3
-max: 10 moves
8 stages: 8y0, 4y0, 2y0, y0, 8xy, 4xy, 2xy, xy
# of checks: 1,1,1,1,1,1,1,1
-max: 8 moves
so determine efficiency i just need to get some timing speeds.
C=ticks per check
S=ticks per stage shift
T=ticks per subtraction
4 stage: 20C + 4s + 20T
5 stage: 11C + 5s + 11T
6 stage: 10C + 6s + 10T
8 stage: 8C + 8s + 8T
Just a guess but if i can keep the stage shift ticks to a minimum, 8 stages will pay off. working on implementing the multipliers and check circuits is another story. some wont add delay and some may be quicker to just put through and check false on a major compare rather than on a minor redundancy check.