Scalable Digital CMOS Comparator Using a Parallel Prefix Tree

Abstract

Abstract-We present a new comparator design featuring wide-range and high-speed operation using only conventional digital CMOS cells. Our comparator exploits a novel scalable parallel prefix structure that leverages the comparison outcome of the most significant bit, proceeding bitwise toward the least significant bit only when the compared bits are equal. This method reduces dynamic power dissipation by eliminating unnecessary transitions in a parallel prefix structure that generates the N-bit comparison result after log 4 N + log 16 N + 4 CMOS gate delays. Our comparator is composed of locally interconnected CMOS gates with a maximum fan-in and fan-out of five and four, respectively, independent of the comparator bitwidth. The main advantages of our design are high speed and power efficiency, maintained over a wide range. Additionally, our design uses a regular reconfigurable VLSI topology, which allows analytical derivation of the input-output delay as a function of bitwidth. HSPICE simulation for a 64-b comparator shows a worst case input-output delay of 0.86 ns and a maximum power dissipation of 7.7 mW using 0.15-µm TSMC technology at 1 GHz.Index Terms-High-speed arithmetic, high-speed wide-bit comparator architecture, parallel prefix tree structure.

Approximate Arithmetic for Low-Power Image Median Filtering

“…Simulation results are shown in Table 5. Our comparators save more power and are T22 T14 T43 T34 faster than [1,20,27]. The advantages of approximate comparators are considerable (Table 6).…”

Implementation of Circuit Optimization Technique for Digital CMOS Comparator Using Parallel Prefix Tree Architecture

“…Static type A minor modification of [1] is done in implememtation structure proposed by Parhami et.al., by using X-NOR with invertor Table 2.and reason for why moving to transmission gate for 2:1 multiplexer by other logic combinations Table 3.are realized here with tanner EDA simulation tool V.7.0.…”

An Efficient Accuracy Switchable Majority Based Prefix Adder

“…In [13],author present a new comparator design featuring wide-range and high-speed operation using only conventional digital CMOS cells and prefix logic.In [14],author, parallel prefix operation and carry correction techniques are adopted to eliminate the recomputation of carries. In [15],author, proposes an efficient algorithm to synthesize prefix graph structures that yield adders with the best performance-area trade-off, their approach generates prefix graph structures to optimize an objective function such as size of prefix graph subject to constraints like bit-wise output logic level.…”