25. High-Speed Square Root Algorithms

  1. Richard G. Lyons
  1. Mark Allie1 and
  2. Richard Lyons2

Published Online: 11 JUN 2012

DOI: 10.1002/9781118316948.ch25

Streamlining Digital Signal Processing: A Tricks of the Trade Guidebook, Second Edition

Streamlining Digital Signal Processing: A Tricks of the Trade Guidebook, Second Edition

How to Cite

Allie, M. and Lyons, R. (2012) High-Speed Square Root Algorithms, in Streamlining Digital Signal Processing: A Tricks of the Trade Guidebook, Second Edition (ed R. G. Lyons), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9781118316948.ch25

Editor Information

  1. Besser Associates, Mountain View, California, USA

Author Information

  1. 1

    University of Wisconsin–Madison, Madison, Wisconsin, USA

  2. 2

    Besser Associates, Mountain View, California, USA

Publication History

  1. Published Online: 11 JUN 2012
  2. Published Print: 22 JUN 2012

ISBN Information

Print ISBN: 9781118278383

Online ISBN: 9781118316948

SEARCH

Keywords:

  • high-speed square root algorithms, tricks for square root of a number;
  • algorithms, implemented in fixed-point arithmetic;
  • square root of a single value, using iterative methods;
  • NRI method, the Newton-Raphson square root iterative;
  • NIIRF and two magnitude estimation in fixed-point implementation

Summary

This chapter contains sections titled:

  • Newton-Raphson Inverse (NRI) Method

  • Nonlinear IIR Filter (NIIRF) Method

  • Binary-Shift Magnitude Estimation

  • Equiripple-Error Magnitude Estimation

  • Conclusions

  • References

  • Editor Comments