Efficient two-level reverse converters for the four-moduli set {2n-1, 2n-1, 2n-1-1, 2n+1-1}

被引:1
作者
Obeidi Daghlavi, Mohammad [1 ]
Noorimehr, Mohammad Reza [2 ]
Esmaeildoust, Mohammad [3 ]
机构
[1] Karoon Inst Higher Educ, Dept Comp Engn, Ahvaz, Iran
[2] Islamic Azad Univ, Ahvaz Branch, Dept Comp Engn, Ahvaz, Iran
[3] Khorramshahr Univ Marine Sci & Technol, Fac Marine Engn, Khorramshahr, Iran
关键词
Residue number system (RNS); Reverse converter; New Chinese remainder theorem1 (new CRT-i); Mixed radix conversion (MRC); Computer arithmetic; HIGH-SPEED REALIZATION; TO-BINARY CONVERTERS; MODULI SET; SUPERSET 2(N)-1; RESIDUE; RNS; IMPLEMENTATION; SCHEME;
D O I
10.1007/s10470-020-01749-z
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, 2 efficient reverse converters are introduced for the four-moduli set {2(n-1), 2(n)-1, 2(n-1)-1, 2(n+1)-1} which offers a high speed arithmetic unit due to its balanced modulus in the form of 2( k) and 2( k)-1. The proposed converters are designed in two-level architecture. ROM free and adder base structures are the advantages of the proposed converters which result in efficient implementation in VLSI circuits. New Chinese remainder theorem 1 (New CRT-I) and mixed radix conversion (MRC) algorithms are used to design the first and second proposed reverse converters, respectively. For the various dynamic ranges (DR), theoretical results based on unit gate model show that the proposed reverse converters have a better Area-Time (AT) metric in comparison to the reverse converters of the other similar four moduli set in the literature. Also based on FPGA implementation results,the proposed convertersoffer lower AT metric on average 12% and 10% when comparing with the latest design for similar the moduli set {2(n), 2(n+1)-1, 2(n)-1, 2(n-1)-1}.
引用
收藏
页码:75 / 87
页数:13
相关论文
共 30 条
[1]   A NEW EFFICIENT MEMORYLESS RESIDUE TO BINARY CONVERTER [J].
ANDRAOS, S ;
AHMAD, H .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1988, 35 (11) :1441-1444
[2]   A full RNS implementation of RSA [J].
Bajard, JC ;
Imbert, L .
IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (06) :769-774
[3]   A reverse converter for the 4-moduli superset {2n-1, 2n, 2n+1, 2n+1+1} [J].
Bhardwaj, M ;
Srikanthan, T ;
Clarke, CT .
14TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 1999, :168-175
[4]   Breaking the 2n-bit carry propagation barrier in residue to binary conversion for the [2n-1, 2n, 2n+1] modula set [J].
Bhardwaj, M ;
Premkumar, AB ;
Srikanthan, T .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1998, 45 (09) :998-1002
[5]   Efficient reverse converters for four-moduli sets {2n-1, 2n, 2n+1, 2n+1-1} and {2n-1, 2n, 2n+1, 2n-1-1} [J].
Cao, B ;
Srikanthan, T ;
Chang, CH .
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2005, 152 (05) :687-696
[6]  
Ciet M, 2003, PROCEEDINGS OF THE 46TH IEEE INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS & SYSTEMS, VOLS 1-3, P806
[7]   Improved RNS FIR filter architectures [J].
Conway, R ;
Nelson, J .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2004, 51 (01) :26-28
[8]   Comments on "A high speed realization of a residue to binary number system converter" [J].
Dhurkadas, A .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1998, 45 (03) :446-447
[9]   Efficient RNS Implementation of Elliptic Curve Point Multiplication Over GF(p) [J].
Esmaeildoust, Mohammad ;
Schinianakis, Dimitrios ;
Javashi, Hamid ;
Stouraitis, Thanos ;
Navi, Keivan .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (08) :1545-1549
[10]   Efficient RNS to binary converters for the new 4-moduli set {2n, 2n+1-1, 2n-1, 2n-1-1} [J].
Esmaeildoust, Mohammad ;
Navi, Keivan ;
Taheri, MohammadReza ;
Molahosseini, Amir Sabbagh ;
Khodambashi, Siavash .
IEICE ELECTRONICS EXPRESS, 2012, 9 (01) :1-7