9th International Conference on VLSI Design: VLSI in Mobile Communication
Self timed division and square-root extraction
Bangalore, INDIA
January 03-January 06
ISBN: 0-8186-7228-5
A. Guyot, Integrated Syst. Design Group, TIMA-UJF, Grenoble, France
M. Renaudin, Integrated Syst. Design Group, TIMA-UJF, Grenoble, France
B. El Hassan, Integrated Syst. Design Group, TIMA-UJF, Grenoble, France
V. Levering, Integrated Syst. Design Group, TIMA-UJF, Grenoble, France
This paper describes a self-timed integrated circuit for division and square-root extraction. First it concentrates on the development and the proof of a new mathematical algorithm. Then the design methodology and the architecture of a self-timed circuit implementing a simplified version of the algorithm is presented. The algorithm relies on two functional blocks, each simple enough to be fully detailed at the logic level in this paper. Besides its simplicity, the novelty of the algorithm lies in the fact that it delivers the quotient or the square root in conventional binary notation. The final remainder only has to be eventually converted.
Index Terms:
pipeline arithmetic; dividing circuits; integrated circuit design; iterative methods; self-timed integrated circuit; square-root extraction; mathematical algorithm; design methodology; functional blocks; logic level; quotient; binary notation; division; pipelined arithmetic
Citation:
A. Guyot, M. Renaudin, B. El Hassan, V. Levering, "Self timed division and square-root extraction," vlsid, pp.376, 9th International Conference on VLSI Design: VLSI in Mobile Communication, 1996