- Examples of an FPGA computation
Hartmut F.-W. Sadrozinski, Jinyuan Wu · 2011
It is convenient to choose N = 2m, that is, 256, 512, 1024, etc., so that the division can be simply implemented as a bit shift. In fact, the “shift” operation in FPGA usually is just choosing corresponding bits while feeding the data to a later stage, and consumes no real silicon resource.