Breaking the 2n-bit carry propagation barrier in residue to binary conversion for the [2n-1, 2n, 2n+1] modula set

被引：32
|
作者：
Bhardwaj, M [1 ]
Premkumar, AB
Srikanthan, T
机构：
[1] Siemens Components, Microelect Design Ctr, Singapore 349249, Singapore
[2] Nanyang Technol Univ, Sch Appl Sci, Singapore 639798, Singapore
来源：
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS | 1998年 / 45卷 / 09期
关键词：
modular arithmetic; residue numbers; reverse converters;
D O I：
10.1109/81.721268
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
This brief presents a high speed realization of a residue to binary converter for the {2(n-1),2(n),2(n) + 1} moduli set, which improves upon the best known implementation by almost twice in terms of overall conversion delay. This significant speedup is achieved by using just three extra two input logic gates. Interestingly, by exploiting certain symmetry in operands, we also reduce the hardware requirement of the best known implementation by n - 1 full adders. Finally, the proposed converter eliminates the redundant representation of zero using no extra logic.
引用
收藏
页码：998 / 1002
页数：5
相关论文
共 50 条
  • [1] Comments on "Breaking the 2n-bit carry-propagation barrier in residue to binary conversion for the [2n-1, 2n, 2n+1] moduli set": Author's reply
    Premkumar, AB
    Bhardwaj, M
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 2001, 48 (08): : 1031 - 1031
  • [2] Comments on breaking the 2n-bit carry-propagation barrier in residue to binary conversion for the [2n - 1, 2n, 2n + 1] moduli set (multiple letters)
    Ananda Mohan, P.V.
    Premkumar, A.B.
    Bhardwaj, M.
    IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 2001, 48 (08):
  • [3] 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
  • [4] Residue number system to binary converter for the moduli set (2n-1, 2n-1, 2n+1)
    Hiasat, A
    Sweidan, A
    JOURNAL OF SYSTEMS ARCHITECTURE, 2003, 49 (1-2) : 53 - 58
  • [5] Adder based residue to binary number converters for (2n-1, 2n, 2n+1)
    Wang, Y
    Song, XY
    Aboulhamid, M
    Shen, H
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2002, 50 (07) : 1772 - 1779
  • [6] An Efficient 2n RNS Scaler for Moduli Set {2n-1, 2n, 2n+1}
    Ye, Yanlong
    Ma, Shang
    Hu, Jianhao
    ISISE 2008: INTERNATIONAL SYMPOSIUM ON INFORMATION SCIENCE AND ENGINEERING, VOL 2, 2008, : 511 - 515
  • [7] 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
  • [8] A Residue to Binary Converter for the {2n+2, 2n+1, 2n} Moduli Set
    Gbolagade, Kazeem Alagbe
    Cotofana, Sorin Dan
    2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4, 2008, : 1785 - 1789
  • [9] Fully parallel comparator for the moduli set {2n, 2n-1, 2n+1}
    Eivazi, Shiva Taghipour
    Hosseinzadeh, Mehdi
    Mirmotahari, Omid
    IEICE ELECTRONICS EXPRESS, 2011, 8 (12): : 897 - 901
  • [10] New efficient residue-to-binary converters for 4-moduli set {2n-1, 2n, 2n+1, 2n+1-1}
    Cao, B
    Chang, CH
    Srikanthan, T
    PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL IV: DIGITAL SIGNAL PROCESSING-COMPUTER AIDED NETWORK DESIGN-ADVANCED TECHNOLOGY, 2003, : 536 - 539
12345