Efficient CRT-based residue-to-binary converter for the arbitrary moduli set

被引：3

作者：

Chen JianWen ^{[1
]}

Yao RuoHe ^{[1
]}

机构：

[1] S China Univ Technol, Sch Elect & Informat Engn, Guangzhou 510640, Guangdong, Peoples R China

来源：

SCIENCE CHINA-INFORMATION SCIENCES | 2011年 / 54卷 / 01期

基金：

中国国家自然科学基金;

关键词：

RNS; Chinese Remainder Theorem; difference correction; modular arithmetic; residue-to-binary; arbitrary moduli set; NUMBER SYSTEM; RNS CONVERTER; ALGORITHM; DIVISION; 2(N)+1;

D O I：

10.1007/s11432-010-4133-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The conversion from residue to weighted binary representation plays an important role in the residue number system. Based on Chinese Remainder Theorem, a new residue-to-binary converter using arbitrary moduli set is proposed. The new converter uses the difference-correction algorithm for the conversion output and eliminates the modulo M operation, where M is the dynamic range of the residue number system. The sizes of the multipliers and modular multipliers in the new converter are small, thereby reducing the area and delay of the proposed converter. Simulation and synthesis results indicate that the new converter is more area-time efficient than the published converters based on Chinese Remainder Theorem.

引用

页码：70 / 78

页数：9

共 37 条

[21] A high-speed residue-to-binary converter for three-moduli (2k, 2k-1, 2k-1-1) RNS and a scheme for its VLSI implementation
Wang, W
Swamy, MNS
Ahmad, MO
Wang, Y
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2000, 47 (12) : 1576 - 1581
[22] Efficient Any Source Overlay Multicast In CRT-Based P2P Networks - A Capacity-Constrained Approach
Roy, Indranil
Maddali, Koushik
Kaluvakuri, Swathi
Rekabdar, Benafsheh
Liu, Ziping
Gupta, Bidyut
Debnath, Narayan C.
2019 IEEE 17TH INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS (INDIN), 2019, : 1351 - 1357
[23] An Effective New CRT Based Reverse Converter for a Novel Moduli Set {22n+1-1, 22n+1,22n-1}
Bankas, Edem Kwedzo
Gbolagade, Kazeem Alagbe
Cotofana, Sorin Dan
PROCEEDINGS OF THE 2013 IEEE 24TH INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS (ASAP 13), 2013, : 142 - 146
[24] Efficiency Reverse Converter for 4-Moduli Set {22n, 22n+1-1, 2n+1, 2n-1} Based on New CRT-II
Siao, Siang-Min
Kuo, Yuan-Ching
Sheu, Ming-Hwa
Lin, Xin-Kun
Chen, Tzu-Hsiung
INDUSTRIAL INSTRUMENTATION AND CONTROL SYSTEMS II, PTS 1-3, 2013, 336-338 : 1852 - +
[25] Residue to binary converter for the extended four moduli set {2k, 2n−1, 2n+1, 2n+1+1} for n odd
M V N Madhavi Latha
Rashmi Ramesh Rachh
P V Ananda Mohan
Sādhanā, 48
[26] Residue to binary converter for the extended four moduli set {2k, 2n-1, 2n+1, 2n+1+1} for n odd
Latha, M. V. N. Madhavi
Rachh, Rashmi Ramesh
Mohan, P. V. Ananda
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2023, 48 (02):
[27] New Residue to Binary converters for the moduli set {2k, 2k-1, 2k-1-1}
Mohan, P. V. Ananda
2008 IEEE REGION 10 CONFERENCE: TENCON 2008, VOLS 1-4, 2008, : 379 - 384
[28] An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
Selianinau, Mikhail
INTERNATIONAL JOURNAL OF COMPUTATIONAL METHODS, 2020, 17 (10)
[29] High Speed Residue to Binary Converter for the New Four-Moduli Set {22n, 2 n+1, 2 n/2+1, 2 n/2-1}
Noorimehr, M. R.
Hosseinzadeh, M.
Farshidi, R.
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2014, 39 (04) : 2887 - 2893
[30] An Efficient Reverse Converter for the Three-Moduli Set (2n+1-1, 2n, 2n-1)
Hiasat, Ahmad
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2017, 64 (08) : 962 - 966

← 1 2 3 4 →