ABSTRACT
There are two different approaches to the development of algorithms for highspeed division. The more conventional approach uses add/subtract and shift operations, while the second relies on multiplication. The operation count in the first approach is linearly proportional to the word size, n. The number of steps in the second approach is logarithmically proportional to n, but each individual step is more complex. The first approach is discussed in this chapter while the second is presented in Chapter 8.
