6.4 BIBLIOGRAPHY

[AND1967] S. F. Anderson, J. G. Earle, R. E. Goldschmidt, and D. M. Powers, The IBM System/360 Model 91: Floating-point execution unit. IBM J. Res. Dev., 11 (Jan.): 34–53 (1967).

[ATK1968] D. E. Atkins, Higher-radix division using estimates of the divisor and partial remainders. IEEE Trans. Comput., C-17(10): 925–934 (1968).

[BRI1993] W. S. Briggs and D.W. Matula, A 17 × 69 bit multiply and add unit with redundant binary feedback and single cycle latency. In: Proceedings of the 11th IEEE Symposium on Computer Arithmetic, July 1993, pp. 163–170.

[COR1999] M. A. Cornea-Hasegan, R. A. Golliver, and P. Markstein, Correctness proofs outline for Newton–Raphson based floating-point divide and square root algorithms: In: Proceedings of the 14th IEEE Symposium on Computer Arithmetic, 1999, pp. 96–105.

[DAS1995] D. DasSarma and D. W. Matula, Faithfull bipartite ROM reciprocal tables. In Proceedings of the 12th IEEE Symposium Computer Arithmetic, 1995 pp. 17–28.

[EDE1997] A. Edelman, The mathematics of the Pentium division bug. SIAM Rev. 39(1): 54–67 (1997).

[ERC1983] M. D. Ercegovac, A higher radix division with simple selection of quotient digits. In Proceedings of the 6th IEEE Symposium Computer Arithmetic, July 1983, pp. 94–98.

[ERC1987] M. D. Ercegovac and T. Lang, On-the-fly conversion of redundant into conventional representations. IEEE Trans. Comput., 36(7): 895–897 (1987).

[ERC1990] M. D. Ercegovac and T. Lang, Simple radix-4 division with operands scaling. IEEE Trans. Comput., 39(9): 1204–1207 (1990).

[ERC1992] M. D. Ercegovac and T. Lang, On-the-fly rounding. IEEE Trans. Comput. 41,(12):1497–1503 (1992).

[ERC2004] M. D. Ercegovac and T. Lang, Digital Arithmetic, Morgan Kaufmann, San Francisco, CA, 2004.

[EVE2003] G. Even, P.-M. Seidel, and W. E. Ferguson, A parametric error analysis of Goldschmidt's division algorithm. In: Proceedings of the 16th IEEE Symposium on Computer Arithmetic, June 2003.

[FAN1989] J. Fandrianto, Algorithm for high-speed shared radix-8 division and radix-8 square root. In Proceedings of the Ninth IEEE Symposium on Computer Arithmetic, July 1989, pp. 68–75.

[FER 1967] D. Ferrari, A division method using a parallel multiplier. IEEE Trans. Comput., 16: 224–226, (April 1967).

[FLY1970] M. J. Flynn, On division by functional iteration. IEEE Trans. Comput. 19: (August 1970).

[FLY1997] M. J. Flynn, Modern Research in Computer Arithmetic, Stanford Architecture and Arithmetic Group, Stanford Technical Report, 1997.

[FLY2001] M. J. Flynn and S. F. Oberman, Advanced Computer Arithmetic Design, Wiley-Interscience, Hoboken, NJ, 2001.

[FRE1961] C. V. Freiman, Statistical analysis of certain binary division algorithms. IRE Proc. 49: 91–103 (1961).

[GOL1964] R. Goldschmidt, Applications of Division by Convergence. Master's thesis, MIT, June 1964.

[MON1994] P. Montuschi and L. Ciminiera, Radix-8 division with over-redundant digit set. J. VLSI Signal Processing 7 (3): 259–270 (1994).

[NAD1956] M. Nadler, A high speed electronic arithmetic unit for automatic computing machines. Acta Tech. (Prague), 6: 464–478 (1956).

[OBE1994] S. F. Oberman and M. J. Flynn, Design issues in floating point division. Technical Report No. CSL-TR-94-647, Computer Systems Laboratory, Stanford University, December 1994.

[OBE1995] S. F. Oberman and M. J. Flynn, An analysis of division algorithms and implementations. Stanford Technical Report CSL-TR-95-675, July 1995.

[OBE1997] S. F. Oberman and M. J. Flynn, Division algorithms and implementations. IEEE Trans. Comput. 46: 833–854 (Aug. 1997).

[OBE1999] S. F. Oberman, Floating point division and square root algorithms and implementation in the AMD-K7 microprocessor. In: Proceedings of the 14th IEEE Symposium on Computer Arithmetic, April 1999, pp. 106–115.

[PAR1999] B. Parhami, Computer Arithmetic, Algorithms and Hardware Designs, Oxford University Press, New York, 1999.

[QUA1992] N. Quach and M. Flynn, A radix-64 floating-point divider. Technical Report CSL-TR-92–529, Computer Systems Laboratory, Stanford University, June 1992.

[ROB1958] J. E. Robertson, A new class of digital division methods. IRE Trans. Electron. Comput., EC-7: 218–222 (Sept. 1958).

[SCHM1999] M. S. Schmookler, R. C. Agarwal, and F. G. Gustavson, Series approximation methods, for divide and square root in the Power3 Microprocessor. In: Proceedings of the 14th IEEE Symposium Computer Arithmetic, April 1999, pp. 116–123.

[SCHW1999] E. M. Schwarz, R.M. Smith, and C. A. Krygowski, The S/390 G5 floating point unit supporting hex and binary architectures. In: Proceedings of the 14th IEEE Symposium on Computer Arithmetic, April 1999, pp. 258–265.

[SRI1995] H. Srinivas and K. Parhi, A fast radix-4 division algorithm and its architecture. IEEE Trans. Comput. 44(6): 826–831 (1995).

[SUT2004] G. Sutter, G. Bioul, and J.-P. Deschamps, Comparative study of SRT-dividers in FPGA. In: Lecture Notes in Computer Science, Vol. 3203, Springer-Verlag, 2004, pp. 209–220.

[SVO1963] A. Svoboda, An algorithm for division. Stroje na Zpracovani Informaci, 9: 25–34 (1963).

[SWE1957] J. Cocke and D. W. Sweeney, High speed arithmetic in a parallel device. IBM Technical Report, February 1957.

[TAY1985] G. S. Taylor, Radix 16 SRT dividers with overlapped quotient selection stages. In: Proceedings of the Seventh IEEE Symposium on Computer Arithmetic, June 1985, pp. 64–71.

[TOC1958] T. D. Tocher, Techniques of multiplication and division for automatic binary computer. Q. J. Mech. Appl. Math., 2: 364–384 (1958).