Sign detection and comparison networks with a small number of transitions

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/su...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 12th Symposium on Computer Arithmetic pp. 59 - 66
Main Authors Ercegovac, M.D., Lang, T.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1995
Subjects
Arithmetic
Circuits
CMOS technology
Computer science
Delay
Design engineering
Latches
Power dissipation
Semiconductor device modeling
Signal design
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:0818670894
9780818670893
DOI:10.1109/ARITH.1995.465376