A Novel Approximate Divider using Binomial Expansion

This paper presents a novel approximate divider circuit using binomial expansion. The circuit is approximated using the division between A and $L = {2^{\left\lfloor {{{\log }_2}B} \right\rfloor }}$, where ⌊log2 B⌋ is the most significant bit value of the divisor B. After that, we use the sum of binomial coefficient to approximate the values. The approximate divider is much simpler and can be implemented using shift and add operations. Moreover, the complexity of the method is $\mathcal{O}(n)$, where n is the number of bits. Experimental results show that the probability of errors is less than 0.18. The approximate circuit is useful for circuit applications contain rigorous and massive arithmetic operations such as artificial intelligence circuits.