Gate array implementation of on-line algorithms for floating-point operations

  • Paul K. -G. Tu
  • Miloŝ D. Ercegovac
Article

Abstract

We present gate array designs of on-line arithmetic units for radix-2 floating-point addition, multiplication and division operations. Performance and complexity characteristics of the implementations of on-line arithmetic units are discussed and compared with those of the compatible conventional floating-point algorithms implemented in the same technology.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M.D. Ercegovac, “On-line arithmetic: an overview,” inProceedings of the SPIE, Real Time Signal Processing VII, vol. 495, San Deigo, CA, 1984, pp. 86–93.Google Scholar
  2. 2.
    P.K.-G. Tu,On-line arithmetic algorithms for efficient implementations. PhD Dissertation, University of California, Los Angeles, 1990.Google Scholar
  3. 3.
    M.J. Irwin and R.M. Owens, “Digit-pipelined arithmetic as illustrated by the Paste-Up system: A tutorial,”IEEE Computer, 1987, pp. 61–73.Google Scholar
  4. 4.
    O. Watanuki, “Floating-point on-line arithmetic for highly concurrent digit-serial computation: application to mesh problems.” Technical Report CSD810529, Computer Science Department, UCLA, May 1981.Google Scholar
  5. 5.
    M.D. Ercegovac, “A general hardware-oriented method for evaluation of functions and computations in a digital computer,”IEEE Transactions on Computers, vol. C-26, 1977, pp. 667–680.MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    V. Oklobdzija and M.D. Ercegovac, “An on-line square root algorithm,”IEEE Transactions on Computers, vol. C-31, 1982, pp. 70–75.CrossRefGoogle Scholar
  7. 7.
    K.S. Trivedi and M.D. Ercegovac, “On-line algorithms for division and multiplication,”IEEE Transactions on Computers, vol. C-26, July 1977, pp. 681–687.MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    O. Watanuki and M.D. Ercegovac, “Floating-point on-line arithmetic: algorithms,” inProceedings of the 5th Symposium on Computer Arithmetic,” 1981, pp. 81–86.Google Scholar
  9. 9.
    M.D. Ercegovac, “A higher-radix division with simple selection of quotient digits,” inProceedings of IEEE 1983 Sixth Symposium on Computer Arithmetic,” 1983, pp. 94–98.Google Scholar
  10. 10.
    M.D. Ercegovac and T. Lang, “A division algorithm with prediction of quotient digits,” inProceedings of the Seventh Symposium on Computer Arithmetic, Urbana, Illinois, 1985.Google Scholar
  11. 11.
    M.D. Ercegovac and T. Lang, “Simple radix-4 division with divisor scaling”, Technical Report CSD 870025, UCLA Computer Science Department, March 1987.Google Scholar
  12. 12.
    P.K.-G. Tu and M.D. Ercegovac, “A radix-4 on-line division algorithm”, inProceedings of the 8th Symposium on Computer Arithmetic, 1987, pp. 181–187.Google Scholar
  13. 13.
    G.S. Taylor, “Radix 16 SRT dividers with overlapped quotient selection stages”, inProceedings of the 7th Symposium on Computer Arithmetic, 1985, pp. 64–71.Google Scholar

Copyright information

© Kluwer Academic Publishers 1991

Authors and Affiliations

  • Paul K. -G. Tu
    • 1
  • Miloŝ D. Ercegovac
    • 2
  1. 1.Advanced Workstation DivisionIBM CorporationAustin
  2. 2.Computer Science DepartmentUniversity of CaliforniaLos Angeles

Personalised recommendations