Title :
Sign detection and comparison networks with a small number of transitions
Author :
Ercegovac, Milos D. ; Lang, Tomás
Author_Institution :
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
Abstract :
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 Tav 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/2k-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
Keywords :
digital arithmetic; flip-flops; comparison networks; iterative implementation; k-bit modules; sign detection; signal transitions; tree network; Arithmetic; CMOS technology; Circuits; Computer science; Delay; Design engineering; Latches; Power dissipation; Semiconductor device modeling; Signal design;
Conference_Titel :
Computer Arithmetic, 1995., Proceedings of the 12th Symposium on
Conference_Location :
Bath
Print_ISBN :
0-8186-7089-4
DOI :
10.1109/ARITH.1995.465376
