Efficient design of 32-bit comparator using carry look-ahead logic

The comparator is of paramount importance in many digital systems as it plays an important role in almost all hardware sorters. In this paper, the design of a 32-bit comparator is proposed based on the logic of a parallel prefix adder. This circuit computes only the final carry or borrow using the structure of a modified prefix adder and employs it to compare the two given numbers, thereby achieving a latency of O(log n). The proposed comparator circuit has been compared (both qualitatively and quantitatively) with the existing ones and is shown to achieve an efficiency of 21% in overall delay and reduction of 30% in power.

[1]  David Harris,et al.  A taxonomy of parallel prefix networks , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[2]  Michael J. Schulte,et al.  A combined two's complement and floating-point comparator , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[3]  Tero Sillanpaeae,et al.  Comparator Circuit , 2002, Tolerance Analysis of Electronic Circuits Using MATHCAD.

[4]  Shun-Wen Cheng.  A high-speed magnitude comparator with small transistor count , 2003, 10th IEEE International Conference on Electronics, Circuits and Systems, 2003. ICECS 2003. Proceedings of the 2003.

[5]  Anantha P. Chandrakasan,et al.  Low Power Digital CMOS Design , 1995 .

[6]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[7]  Shun-Wen Cheng.  Arbitrary long digit integer sorter HW/SW co-design , 2003, ASP-DAC '03.

[8]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[9]  Jennifer Eyre,et al.  DSP Processors Hit the Mainstream , 1998, Computer.