A new algorithm for division in hardware
Vitit Kantabutra
Abstract
Vitit Kantabutra
Abstract
This paper presents a new algorithm for fast hardware division, where two or three dividend bits are retired per iteration. The advantage that this algorithm has over radix-4 SRT is that it is much simpler requiring no lookup table and requiring the comparison of only one two-bit operand pair per iteration. Due to its simplicity, the new algorithm is much easier to implement and verify than radix-4 SRT and is quite likely to be faster as well.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents a new algorithm for fast hardware division, where two or three dividend bits are retired per iteration. The advantage that this algorithm has over radix-4 SRT is that it is much simpler requiring no lookup table and requiring the comparison of only one two-bit operand pair per iteration. Due to its simplicity, the new algorithm is much easier to implement and verify than radix-4 SRT and is quite likely to be faster as well.
Key concepts: Operand, Computer science, Lookup table, Division (mathematics), Division algorithm, Algorithm, Table (database), Arithmetic