High Speed Comparator for the Moduli {2n, 2n-1, 2n+1}

被引：1
|
作者：
Li, Lei [1 ]
Li, Guodong [1 ]
Zhao, Yingxu [1 ]
Yin, Pengsheng [1 ]
Zhou, Wanting [1 ]
机构：
[1] Univ Elect Sci & Technol China, Res Inst Elect Sci & Technol, Chengdu 611731, Sichuan, Peoples R China
来源：
IEICE ELECTRONICS EXPRESS | 2013年 / 10卷 / 21期
基金：
中国国家自然科学基金;
关键词：
Residue number systems (RNS); comparator; NUMBER SYSTEM; RESIDUE;
D O I：
10.1587/elex.10.20130628
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
{2(n), 2(n) - 1, 2(n) + 1} is one of the most commonly used moduli in residue number systems. In this express, we propose a novel comparator for the moduli {2(n), 2(n) - 1, 2(n) + 1}. Based on the proposed architecture, we can design high speed comparator for the moduli {2(n), 2(n) - 1, 2(n) + 1}, which is the fastest among all known comparators for the moduli {2(n), 2(n) - 1, 2(n) + 1}. The performance of the proposed comparator is evaluated and compared with the earlier fast comparators for the moduli {2(n), 2n - 1, 2n + 1}, based on a simple gate-count and gate-delay model. The proposed comparator can improve the state-of-art by 8% on the average in terms of area and 6% on the average in terms of performance delay.
引用
收藏
页数：6
相关论文
共 50 条
  • [21] A Unified Addition Structure for Moduli Set {2n-1, 2n, 2n+1} Based on a Novel RNS Representation
    Timarchi, Somayeh
    Fazlali, Mahmood
    Cotofana, Sorin D.
    2010 IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, 2010, : 247 - 252
  • [22] MRC-Based RNS Reverse Converters for the Four-Moduli Sets {2n+1, 2n-1, 2n, 22n+1-1} and {2n+1, 2n-1, 22n, 22n+1-1}
    Sousa, Leonel
    Antao, Samuel
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2012, 59 (04) : 244 - 248
  • [23] High speed reverse converter for new five-moduli set {2n, 22n+1-1, 2n/2-1, 2n/2+1, 2n+1}
    Esmaeildoust, Mohammad
    Navi, Keivan
    Taheri, MohammadReza
    IEICE ELECTRONICS EXPRESS, 2010, 7 (03): : 118 - 125
  • [24] Efficient Reverse Converter Designs for the New 4-Moduli Sets {2n-1, 2n, 2n+1, 22n+1-1} and {2n-1, 2n+1, 22n, 22n+1} Based on New CRTs
    Molahosseini, Amir Sabbagh
    Navi, Keivan
    Dadkhah, Chitra
    Kavehei, Omid
    Timarchi, Somayeh
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2010, 57 (04) : 823 - 835
  • [25] Efficient VLSI Implementation of 2n Scaling of Signed Integer in RNS {2n-1, 2n, 2n+1}
    Tay, Thian Fatt
    Chang, Chip-Hong
    Low, Jeremy Yung Shern
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (10) : 1936 - 1940
  • [26] New Algorithm for Signed Integer Comparison in Four-Moduli Superset {2n, 2n-1, 2n+1, 2n+1-1}
    Tay, Thian Fatt
    Chang, Chip-Hong
    2014 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS (APCCAS), 2014, : 519 - 522
  • [27] IMAGE ENCRYPTION AND DECRYPTION IN RNS DOMAIN BASED ON {2n, 22n+1-1, 2n+1, 2n-1} MODULI SET
    Reddy, P. Venkata Narasa
    Karumuri, Rajasekhar
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON COMMUNICATION AND ELECTRONICS SYSTEMS (ICCES), 2016, : 414 - 418
  • [28] Residue to binary number converters for (2n-1,2n,2n+1)
    Wang, YK
    Song, XY
    Aboulhamid, M
    PROCEEDINGS OF THE 8TH GREAT LAKES SYMPOSIUM ON VLSI, 1998, : 174 - 178
  • [29] Residue-to-binary arithmetic converter for moduli set {2n-1,2n,2n+1,2n+1-1}
    Mathew, J
    Radhakrishnan, D
    Srikanthan, T
    PROCEEDINGS OF THE IEEE-EURASIP WORKSHOP ON NONLINEAR SIGNAL AND IMAGE PROCESSING (NSIP'99), 1999, : 190 - 193
  • [30] Design of Reverse Converters for General RNS Moduli Sets {2k, 2n-1, 2n+1, 2n+1-1} and {2k, 2n-1, 2n+1, 2n-1-1} (n even)
    Patronik, Piotr
    Piestrak, Stanislaw J.
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2014, 61 (06) : 1687 - 1700
12345