loading...
High-Radix Implementation of IEEE Floating-Point Addition
Cape Cod, Massachusetts, USA June 27-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2005.2617th IEEE Symposium on Computer Arith ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Peter-Michael Seidel, Southern Methodist University
We are proposing a micro-architecture for high-performance IEEE floating-point addition that is based on a (non-redundant) high-radix representation of the floating-point operands. The main improvement of the proposed IEEE FP addition implementation is achieved by avoiding the computation of full alignment and normalization shifts which impose major delays in conventional implementations of IEEE FP addition. This reduction is achieved at the cost of wider operand interfaces and an increased complexity for IEEE compliant rounding. We present a detailed discussion of an IEEE FP adder implementation using the proposed high-radix format and explain the specific benefits and challenges of the design.
Citation:
Peter-Michael Seidel, "High-Radix Implementation of IEEE Floating-Point Addition," arith, pp.99-106, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.