Division algorithms - From Past to Present Chance to Improve Area Time and Complexity for Digital Applications

Abstract

Algorithm is the way of performing any task in a correct way to reach desired goal. Algorithm is very important factor in any digital world. In digital world, is complicated to implement arithmetical operations. Arithmetic and logical unit stands to be a very vital unit of any embedded or digital processors. Following Moore's Law density of logic units has increased tremendously over couple of decades, which provides enough availability of resources to implement all arithmetic operations. Amongst addition, subtraction, multiplication and division, division is the toughest one to implement digitally. Till date, many different algorithms were developed to provide better result to division implementation in digital hardware. Generally, the major aspects that must be considered are quotient convergence rate, hardware primitives, overheads, and mathematical formulation. Usually division algorithms have five different classes and several types. Many practical dividers are made up of hybrid class concept. In today's high-speed digital life, it is important to implement correct division. This paper is focused on the study of different algorithms to understand how they work, which their limitations are and how it is possible to improve them and the possibility of developing new division algorithms.