3 ms·
One thing to note is that this is a bit-serial adder. If you use this to perform, say, 32-bit arithmetic, then the effective clock rate is about 3GHz. Half th
by klyrs 6y ago
One thing to note is that this is a bit-serial adder. If you use this to perform, say, 32-bit arithmetic, then the effective clock rate is about 3GHz. Half that for 64-bit. Compare this to a PCIe4 bus, which is clocked at 16GT/s -- that is, each "lane" runs at 16GHz and is used to transmit data around serially instead of routing more wires around to make a wider bus. That's readily-available (damn the chip shortages) tech, but we can't buy 16GHz general-purpose processors.
- mlyle 6y agoIt's a bit-serial adder not for any technical reason other than it's a convenient benchmark for characterization of the logic within. You could obviously use the process to make wide adders with faster clock speeds than stacking serial adders in front of each other.
- klyrs 6y agoI'm sorry, but that's not obvious. Given that we've got PCI circuits running at 16GHz, why don't chipmakers give us full-scale processors with those faster clock speeds? Bit-serial adders are extremely simple circuits with a single carry register, which can run at essentially the full speed of the underlying switching devices. Ripple-carry adders have a circuit depth proportional to the number of bits in the adder -- they're only stable when the clock is substantially slower than the switching time (proportional to the circuit depth), because the carry signal needs to propagate through all of the 1-bit adders.
- mlyle 6y ago> I'm sorry, but that's not obvious. Given that we've got PCI circuits running at 16GHz, why don't chipmakers give us full-scale processors with those faster clock speeds? That's not what I said. I'm just saying that it's obvious that if you wanted a fast 64 bit adder on the process, you'd build a carry lookahead adder or other fast adder, not stack a single bit adder 64 times. Saying "YOU NEED TO MULTIPLY PROP TIME BY 64" seems kinda dishonest. I said: > > You could obviously use the process to make wide adders with faster clock speeds than stacking serial adders in front of each other. Do you really think the optimum thing is going to be stacking 64 of these in a row?
- klyrs 6y agoAh, I misread you -- yes, there are obviously faster adder circuits. My point is that they won't have such impressive clock rates as this serial adder can achieve.
- deepnotderp 6y agoBut for CPUs no one uses ripple carry, they use high radix adders like Kogge-Stone
- deleted 6y ago[deleted]
- deleted 6y ago[deleted]
- Symmetry 6y agoNothing you said was incorrect but I'm afraid people might take away a misconception. So, the adders you find in a modern processor are probably going to be a carry-bypass adder or something like that. For a constant factor more transistors you can complete your addition in sqrt(n_bits) time rather than n_bits. There are also tree adders which can can perform their calculations in log(n) time but take n^2 transistors but nobody uses those. Most modern processors have pipeline stages where you have one transistor driving 4 other 10 to 30 times or the equivalent. You can do that even with 64 bits in a clock cycle with a carry-bypass but not a serial adder. https://en.wikipedia.org/wiki/Carry-skip_adder https://en.wikipedia.org/wiki/Carry-skip_adder