High-speed redundant reciprocal approximation

Integration, the VLSI Journal

Volumn 28, Issue 1, 1999, Pages 1-12

  Seidel, Peter Michael ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DIGITAL ARITHMETIC; FORMAL LOGIC; MULTIPLYING CIRCUITS; REDUNDANCY;

BOOTH RECORDING; MULTIPLICATIVE DIVISION; REDUNDANT RECIPROCAL APPROXIMATION;

MICROPROCESSOR CHIPS;

EID: 0032597969     PISSN: 01679260     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9260(99)00008-5     Document Type: Article

References (23)

1. S.F. Oberman, Design issues in high performance floating point arithmetic units, Ph.D. Thesis, Stanford, January 1997.
2. Flynn M.J. On division by functional iteration. IEEE Trans. Comput. C-19:1970;702-706.
3. D.L. Fowler, J.E. Smith, An accurate, high speed implementation of division by reciprocal approximation, in: Proceedings of the 9th Symposium on Computer Arithmetic, Vol. 9, IEEE, New York, September 1989, pp. 60-67.
4. Anderson S.F., Earle J.G., Goldschmidt R.E., Powers D.M. The IBM system 360 Model 91: floating-point unit. IBM J. Res. Dev. 11:1967;34-53.
5. R.E. Goldschmidt, Applications of division by convergence, Master's Thesis, MIT, Cambridge, June 1964.
6. Soderquist P., Leeser M. Area and performance tradeoffs in floating-point divide and square-root implementations. ACM Comput. Surveys. 28(3):1996;518-564.
7. D. Das Sarma, D. Matula, Faithful interpolation in reciprocal tables, in: Proceedings of the 13th Symposium on Computer Arithmetic, Vol 13, IEEE, New York, 1997, pp. 82-91.
8. M. Ito, N. Takagi, S. Yajima, Efficient initial approximation and fast converging methods for division and square root, in: Proceedings of the 12th Symposium on Computer Arithmetic, Vol. 12, IEEE, New York, 1995, pp. 2-9.
9. Ito M., Takagi N., Shuzo S. Efficient initial approximation for multiplicative division and square root by multiplication with operand modification. IEEE Trans. Comput. 46(4):1997;495.
10. Schulte M.J., Omar J., Swartzlander E.E. Optimal initial approximations for the Newton-Raphson division algorithm. Comput. 53:1994;233-242.
11. D. Das Sarma, D. Matula, Faithful bipartite ROM reciprocal tables, in: Proceedings of the 12th Symposium on Computer Arithmetic, Vol. 12, IEEE, New York, 1995, pp. 17-28.
12. Das Sarma D., Matula D.W. Measuring the accuracy of ROM reciprocal tables. IEEE Trans. Comput. 43(8):1994;932-940.
13. Ferrari D. A division method using a parallel multiplier. IEEE Trans. Electron Comput. EC-16:1967;224-226.
14. Wong D., Flynn M. Fast division using accurate quotient approximations to reduce the number of iterations. IEEE Trans. Comput. 41(8):1992;981-995.
15. G.W. Bewick, Fast multiplication: algorithms and implementation, Ph.D. Thesis, Stanford University, March 1994.
16. Booth A.D. A signed binary multiplication technique. Quart. J. Mech. Appl. Math. 4(2):1951;236-240.
17. P.E. Madrid, B. Millar, E.E. Swartzlander, Modified Booth algorithm for high radix multiplication, IEEE Comput. Design Conference, 1992, pp. 118-121.
18. W.J. Paul, P.M. Seidel, On the complexity of Booth recoding, Proceedings of the '3rd Conference on Real Numbers and Computers, RNC3', April 1998, pp. 199-218.
19. M. Daumas, D.W. Matula, Recoders for partial compression and rounding, Technical Report 97-01, Laboratoire de l'Informatique du Paralllisme, Lyon, France, 1997.
20. M. Ercegovac, T. Lang, Montuschi, Very high radix division with selection by rounding and prescaling, in: Proceedings of the 11th Symposium on Computer Arithmetic, Vol. 11, IEEE, New York, 1993, pp. 112-119.
21. IEEE standard for binary floating-point arithmetic, ANSI/IEEE754-1985, New York, 1985.
22. S.F. Oberman, M.J. Flynn, Fast IEEE rounding for division by functional iteration, Technical Report CSL-TR-96-700, Stanford, July 1996.
23. Oklobdzija V.G., Villeger D., Liu S.S. A Method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach. IEEE Trans. Comput. 45(3):1996;294-306.