Scalable Digital CMOS Comparator Using a Parallel Prefix Tree

被引:22
|
作者
Abdel-Hafeez, Saleh [1 ]
Gordon-Ross, Ann [2 ]
Parhami, Behrooz [3 ]
机构
[1] Jordan Univ Sci & Technol, Irbid 22110, Jordan
[2] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA
[3] Univ Calif Santa Barbara, Dept Elect & Comp Engn, Santa Barbara, CA 93106 USA
基金
美国国家科学基金会;
关键词
High-speed arithmetic; high-speed wide-bit comparator architecture; parallel prefix tree structure; HIGH-PERFORMANCE; DYNAMIC LOGIC;
D O I
10.1109/TVLSI.2012.2222453
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 inverted right perpendicularlog(4) Ninverted left perpendicular + inverted right perpendicularlog(16) Ninverted left perpendicular + 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-mu m TSMC technology at 1 GHz.
引用
收藏
页码:1989 / 1998
页数:10
相关论文
共 50 条
  • [1] Area-Efficient Parallel-Prefix Binary Comparator
    Panda, Amit Kumar
    Palisetty, Rakesh
    Ray, Kailash Chandra
    2019 IEEE INTERNATIONAL SYMPOSIUM ON SMART ELECTRONIC SYSTEMS (ISES 2019), 2019, : 12 - 16
  • [2] A Novel Floating Point Comparator Using Parallel Tree Structure
    Samuel, Anuja T.
    Senthilkumar, Jawahar
    2015 INTERNATIONAL CONFERENCED ON CIRCUITS, POWER AND COMPUTING TECHNOLOGIES (ICCPCT-2015), 2015,
  • [3] Scalable and parallel aggregated bit vector packet classification using prefix computation model
    Srinivasan, T.
    Dhanasekar, N.
    Nivedita, M.
    Dhivyakrishnan, R.
    Azeezunnisa, A. A.
    PAR ELEC 2006: INTERNATIONAL SYMPOSIUM ON PARALLEL COMPUTING IN ELECTRICAL ENGINEERING, PROCEEDINGS, 2006, : 139 - +
  • [4] Scalable Parallel Prefix Solvers for Discrete Ordinates Transport in Multidimensions
    Pautz, Shawn D.
    Pandya, Tara M.
    Adams, Marvin L.
    NUCLEAR SCIENCE AND ENGINEERING, 2011, 169 (03) : 245 - 261
  • [5] A scalable parallel lookup framework avoiding longest prefix match
    Liang, ZY
    Xu, K
    Wu, JP
    INFORMATION NETWORKING: NETWORKING TECHNOLOGIES FOR BROADBAND AND MOBILE NETWORKS, 2004, 3090 : 616 - 625
  • [6] A Comprehensive Exploration of the Parallel Prefix Adder Tree Space
    Ene, Teodor-Dumitru
    Stine, James E.
    2021 IEEE 39TH INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD 2021), 2021, : 125 - 129
  • [7] A parallel Poisson generator using parallel prefix
    Lu, TC
    Hou, YS
    Chen, RJ
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1996, 31 (03) : 33 - 42
  • [8] A Scalable Fully-Digital Differential Analog Voltage Comparator
    Gupta, Ashima
    Singh, Anil
    Agarwal, Alpana
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2022, 31 (04)
  • [9] VERSATILE CMOS COMPARATOR WITH ADJUSTABLE WINDOW AND DIGITAL INPUT REFERENCE
    SISKOS, S
    HATZOPOULOS, AA
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1993, 74 (06) : 933 - 938
  • [10] Prefix Sequence: Optimization of Parallel Prefix Adders using Simulated Annealing
    Moto, Takayuki
    Kaneko, Mineo
    2018 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2018,