Division operation based on Vedic mathematics

The work presented in this paper targets on the Division operation i.e. division. Basic operations like addition, subtraction and multiplication are implemented using Vedic mathematics for various dedicated applications such as RSA encryption and decryption algorithm. The proposed work focuses on division operation which is an important operation in areas such as image processing, networking, signal processing, computer graphics, numerical application, scientific applications and in processor implementation. From the architectural point of view, hardware required by division circuits are usually much larger than the multiplier circuits for same data word length and division operation is generally categories as slow division and fast division. Where slow division is restoring and non-restoring methods and fast division is Newton Raphson and Goldschmidt methods. The Vedic division method is mathematically modeled and tested for feasibility and is compared with earlier implementation like restoring and non-restoring methods. The work carried out on division operation based on Vedic mathematics is limited to one of the Vedic sutra. In this paper the four Sutras are considered for implementation.