[libre-riscv-dev] [isa-dev] FP reciprocal sqrt extension proposal

[lkcl]

On Friday, July 12, 2019 at 11:07:14 PM UTC+8, Bill Huffman wrote:
> The rounding isn't difficult in an N-bit at a time algorithm that doesn't have a redundant result representation.  For a Newton-Raphson implementation or a redundant result implementation, rounding is more difficult.

Thank you Bill (also Andrew) for the insights.

L.