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

[1]  Miodrag Potkonjak,et al.  An Approach For Power Minimization Using Transformations , 1992, Workshop on VLSI Signal Processing.

[2]  U. Ko,et al.  A self-timed method to minimize spurious transitions in low power CMOS circuits , 1994, Proceedings of 1994 IEEE Symposium on Low Power Electronics.

[3]  Anantha P. Chandrakasan,et al.  Low-power Signal Processing Systems , 1992, Workshop on VLSI Signal Processing.

[4]  Earl E. Swartzlander,et al.  Optimizing Arithmetic Elements For Signal Processing , 1992, Workshop on VLSI Signal Processing.

[5]  Anantha P. Chandrakasan,et al.  Low-power CMOS digital design , 1992 .