A fast division algorithm for SIMD-neurocomputers
M. Pfister · 2002
Some learning algorithms for neural networks adapt the size of the learning step using some kind of second order information. It is sometimes difficult to implement them on SIMD-neurocomputers, optimized for multiply-accumulate operations, because no division routine is provided, or because the standard algorithms are very inefficient for this kind of architecture. In this paper, the author introduces QuickDiv, a fast method to approximate the integer division for signed 16-bit integers. The method is a mixture of table lookup and interpolation. Although QuickDiv does not yield exact results, the error between the approximation and the exact integer division is small enough for neural network learning. The steps of the algorithm are almost independent from the arguments, so that it can be efficiently implemented in SIMD-parallel computers.>