<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05067088</id>
  <dt>j</dt>
  <an>05067088</an>
  <augroup>
    <au>Wires, Kent E.</au>
    <au>Schulte, Michael J.</au>
  </augroup>
  <ti>Reciprocal and reciprocal square root units with operand modification and multiplication.</ti>
  <so>J. VLSI Signal Process. Syst. Signal Image Video Technol. 42, No. 3, 257-272 (2006).</so>
  <py>2006</py>
  <pu>Springer, Norwell, MA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>reciprocal</ut>
    <ut>reciprocal square root</ut>
    <ut>computer arithmetic</ut>
    <ut>function approximation</ut>
    <ut>table lookup</ut>
    <ut>Newton-Raphson iteration</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s11265-006-4186-0</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Reciprocals and reciprocal square roots are used in several digital signal processing, multimedia, and scientific computing applications. This paper presents high-speed methods for computing reciprocals and reciprocal square roots. These methods use a table lookup, operand modification, and multiplication to obtain an initial approximation. This is followed by a modified Newton-Raphson iteration, which improves the accuracy of the initial approximation. The initial approximation and Newton-Raphson iteration employ specialized hardware to reduce the delay, area, and power dissipation. The application of these methods is illustrated through the design of reciprocal and reciprocal square root units for operands in the IEEE single precision format. These designs are pipelined to produce a new result every clock cycle.</ab>
    <rv></rv>
  </abgroup>
</item>