Efficient RNS to binary converters for the new 4-moduli set {2n, 2n+1-1, 2n-1, 2n-1-1}

被引：2

作者：

Esmaeildoust, Mohammad ^{[1
]}

Navi, Keivan ^{[1
]}

Taheri, MohammadReza ^{[2
]}

Molahosseini, Amir Sabbagh ^{[3
]}

Khodambashi, Siavash ^{[1
]}

机构：

[1] Shahid Beheshti Univ, Fac Elect & Comp Engn, Tehran, Iran

[2] Islamic Azad Univ, Dept Comp Engn, Sci & Res Branch, Tehran, Iran

[3] Islamic Azad Univ, Dept Comp Engn, Kerman Branch, Kerman, Iran

来源：

IEICE ELECTRONICS EXPRESS | 2012年 / 9卷 / 01期

关键词：

computer arithmetic; residue number system (RNS); RNS to binary (reverse) converter; moduli sets;

D O I：

10.1587/elex.9.1

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, we propose efficient designs of residue number system (RNS) to binary converter for the balanced moduli set {2(n), 2(n+1) - 1, 2(n) - 1, 2(n-1) - 1} where n has even values. This new moduli set is completely free from modulo-(2(k) + 1)-type which results in high-speed modulo arithmetic channels for RNS. Also, mixed-radix conversion (MRC) algorithm is used to achieve both an arithmetic-based and reduced-complexity two-level RNS to binary converter architectures. The proposed moduli set provides fast arithmetic operation with higher speed of the reverse converter comparing to other five moduli set which is found in literature.

引用

页码：1 / 7

页数：7

共 50 条

[31] An efficient reverse converter for the 4-moduli set {2n-1, 2n, 2n+1, 22n+1} based on the new Chinese remainder theorem
Cao, B
Chang, CH
Srikanthan, T
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2003, 50 (10) : 1296 - 1303
[32] A Scaler Design for the RNS Three-Moduli Set {2n+1-1, 2n, 2n-1} Based on Mixed-Radix Conversion
Hiasat, Ahmad
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2020, 29 (03)
[33] A New RNS Scaler for {2n-1, 2n, 2n+1}
Low, Jeremy Yung Shern
Chang, Chip Hong
2011 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2011, : 1431 - 1434
[34] 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
[35] Residue-to-Binary converters for the seven moduli set {2n-5-1, 2n-3-1, 2n-2+1, 2n-1-1, 2n-1+1, 2n, 2n+1} for n even
Latha, M. V. N. Madhavi
Rachh, Rashmi Ramesh
Mohan, P. V. Ananda
2019 IEEE ASIA PACIFIC CONFERENCE ON POSTGRADUATE RESEARCH IN MICROELECTRONICS AND ELECTRONICS (PRIMEASIA 2019): INNOVATIVE CAS TOWARDS SUSTAINABLE ENERGY AND TECHNOLOGY DISRUPTION, 2019, : 37 - 40
[36] {2n+1, 2n+k, 2n-1} :: A new RNS moduli set extension
Chaves, R
Sousa, L
PROCEEDINGS OF THE EUROMICRO SYSTEMS ON DIGITAL SYSTEM DESIGN, 2004, : 210 - 217
[37] AN EFFICIENT REVERSE CONVERTER FOR THE NEW FOUR-MODULI SET {22n, 2n+1-1, 2n/2+1, 2n/2-1}
Noorimehr, Mohammadreza
Hosseinzadeh, Mehdi
Farshidi, Reza
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2011, 20 (07) : 1341 - 1355
[38] 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
[39] 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
[40] Fast sign-detection algorithm for residue number system moduli set {2n-1, 2n, 2n+1-1}
Niras, Cheeckottu Vayalil
Kong, Yinan
IET COMPUTERS AND DIGITAL TECHNIQUES, 2016, 10 (02): : 54 - 58

← 1 2 3 4 5 →