• DocumentCode
    2780076
  • Title

    Series approximation methods for divide and square root in the Power3TM processor

  • Author

    Agarwal, Ramesh C. ; Gustavson, Fred G. ; Schmookler, Martin S.

  • Author_Institution
    Res. Div., IBM Corp., Yorktown, NY, USA
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    116
  • Lastpage
    123
  • Abstract
    The Power3 processor is a 64-bit implementation of the PowerPCTM architecture and is the successor to the Power2TM processor for workstations and servers which require high performance floating point capability. The previous processors used Newton-Raphson algorithms for their implementations of divide and square root. The Power3 processor has a longer pipeline latency, which would substantially increase the latency for these instructions. Instead, new algorithms based on power series approximations were developed which provide significantly better performance than the Newton-Raphson algorithm for this processor. This paper describes the algorithms, and then shows how both the series based algorithms and the Newton-Raphson algorithms are affected by pipeline length. For the Power3, the power series algorithms reduce the divide latency by over 20% and the square root latency by 35%
  • Keywords
    Newton-Raphson method; floating point arithmetic; pipeline arithmetic; Newton-Raphson algorithms; Power3 processor; Power3TM processor; divide; high performance floating point; pipeline; power series approximations; square root; Algorithm design and analysis; Approximation methods; Delay; Frequency; Hardware; Microprocessor chips; Pipelines; Reduced instruction set computing; Silicon; Table lookup;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Arithmetic, 1999. Proceedings. 14th IEEE Symposium on
  • Conference_Location
    Adelaide, SA
  • ISSN
    1063-6889
  • Print_ISBN
    0-7695-0116-8
  • Type

    conf

  • DOI
    10.1109/ARITH.1999.762836
  • Filename
    762836