A new IEEE compliant floating-point rounding algorithm for computing the rounded product from a carry-save representation of the product is presented. The new rounding algorithm is compared with the rounding algorithms of Yu and Zyner and of Quach et al. For each rounding algorithm, a logical description and a block diagram is given and the latency is analyzed. We conclude that the new rounding algorithm is the fastest rounding algorithm, provided that an injection (which depends only on the rounding mode and the sign) can be added in during the reduction of the partial products into a carry-save encoded digit string. In double precision the latency of the new rounding algorithm is 12 logic levels compared to 14 logic levels in the algorithm of Quach et al., and 16 logic levels in the algorithm of Yu and Zyner.
|Number of pages||8|
|State||Published - 1999|
|Event||Proceedings of the 14th IEEE Symposium on Computer Arithmetic, ARITH-14 - Adelaide, SA, Aust|
Duration: 14 Apr 1999 → 16 Apr 1999
|Conference||Proceedings of the 14th IEEE Symposium on Computer Arithmetic, ARITH-14|
|City||Adelaide, SA, Aust|
|Period||14/04/99 → 16/04/99|