Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

The number of gates required for popcount scales linearly with the input size. It's much, much smaller than a multiplier.


No, it would scale logarithmically if you want to minimize latency.


It cannot scale logarithmically because you need at least a linear number of gates to represent the inputs.

It doesn't have to scale superlinearly either, because the natural circuit using a linear number of adders is already of a logarithmic depth, which is best possible asymptotically.


The gate depth scales logarithmically, and that determines how many cycles it takes, or (worse) how fast your cycles can be, if you want the answer in one cycle.


A lot of complexity could be eschewed if processors weren't faster than 100 Mhz.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: