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 条
  • [21] Design of 4-bit Flash Analog to Digital Converter using CMOS Comparator in Tanner Tool
    Kakde, Nupur S.
    Deshmukh, Amol Y.
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2015, 15 (05): : 66 - 70
  • [22] Scalable Tree-Based Architectures for IPv4/v6 Lookup Using Prefix Partitioning
    Le, Hoang
    Prasanna, Viktor K.
    IEEE TRANSACTIONS ON COMPUTERS, 2012, 61 (07) : 1026 - 1039
  • [23] Design of Comparator Using Domino Logic and CMOS Logic
    Rangari, Abhishek V.
    Gaidhani, Yashika A.
    PROCEEDINGS OF 2016 ONLINE INTERNATIONAL CONFERENCE ON GREEN ENGINEERING AND TECHNOLOGIES (IC-GET), 2016,
  • [24] Incremental mining of sequential patterns using prefix tree
    Chen, Yue
    Guo, Jiankui
    Wang, Yaqin
    Xiong, Yun
    Zhu, Yangyong
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2007, 4426 : 433 - +
  • [25] Efficient Sign Detection using Parallel Prefix Adder
    Arthireena, S.
    Shanmugavadivel, G.
    2017 IEEE INTERNATIONAL CONFERENCE ON ELECTRICAL, INSTRUMENTATION AND COMMUNICATION ENGINEERING (ICEICE), 2017,
  • [26] Design and Characterization of Parallel Prefix Adders using FPGAs
    Hoe, David H. K.
    Martinez, Chris
    Vundavalli, Sri Jyothsna
    PROCEEDINGS SSST 2011: 43RD IEEE SOUTHEASTERN SYMPOSIUM ON SYSTEM THEORY, 2011, : 168 - 172
  • [27] Parallel Dynamics Computation Using Prefix Sum Operations
    Yang, Yajue
    Wu, Yuanqing
    Pan, Jia
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2017, 2 (03): : 1296 - 1303
  • [28] Fast Modular Multiplication using Parallel Prefix Adder
    Zode, Pravin P.
    Deshmukh, Raghavendra B.
    PROCEEDINGS ON 2014 2ND INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGY TRENDS IN ELECTRONICS, COMMUNICATION AND NETWORKING (ET2ECN), 2014,
  • [29] Parallel biological sequence comparison using prefix computations
    Aluru, Srinivas
    Futamura, Natsuhiko
    Mehrotra, Kishan
    Proceedings of the International Parallel Processing Symposium, IPPS, 1999, : 653 - 659
  • [30] Parallel biological sequence comparison using prefix computations
    Aluru, S
    Futamura, N
    Mehrotra, K
    IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 653 - 659