W
whit3rd
Guest
In binary ripple counters, many bits change on a
clock tick (lowest bit changes every time, bit#2 changes half
the time, bit #3 changes every fourth clock...) so there\'s
a log(N) scaling for N-bit counters\' average bit-change cost.
Capacitive energy loss thus favors a Gray code for counting
with minimal energy cost, (1) being the cost of each tick
incrementing the counter. There\'s some overhead, though,
because the determination of the \'next\' Gray code transition requires
a hidden internal logic behind the displayed bits.
What is the Gray counter scaling on transitions including the
hidden logic as well as the output bits?
clock tick (lowest bit changes every time, bit#2 changes half
the time, bit #3 changes every fourth clock...) so there\'s
a log(N) scaling for N-bit counters\' average bit-change cost.
Capacitive energy loss thus favors a Gray code for counting
with minimal energy cost, (1) being the cost of each tick
incrementing the counter. There\'s some overhead, though,
because the determination of the \'next\' Gray code transition requires
a hidden internal logic behind the displayed bits.
What is the Gray counter scaling on transitions including the
hidden logic as well as the output bits?