loading...
Sign detection and comparison networks with a small number of transitions
Bath, England July 19-July 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.1995.46537612th 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 
   
M.D. Ercegovac, Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
T. Lang, Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
We present an approach to reducing the average number of signal transitions (T,,) in the design of sign-detection and comparison of magnitudes. Our approach reduces T/sub av/ from 21n/8 (n-operand precision in bits) to 4.5 in the case of iterative implementation, and from about n to roughly k+n/2/sup k-1/ in the tree network implemented with k-bit modules. We also discuss comparison of small numbers. The approach is applicable to other arithmetic problems.
Index Terms:
digital arithmetic; flip-flops; sign detection; comparison networks; signal transitions; iterative implementation; tree network; k-bit modules
Citation:
M.D. Ercegovac, T. Lang, "Sign detection and comparison networks with a small number of transitions," arith, pp.59, 12th IEEE Symposium on Computer Arithmetic (ARITH-12 '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.