Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem

被引：30

作者：

Chervyakov, N. I. ^{[1
]}

Molahosseini, A. S. ^{[2
]}

Lyakhov, P. A. ^{[1
]}

Babenko, M. G. ^{[1
]}

Deryabin, M. A. ^{[1
]}

机构：

[1] North Caucasian Fed Univ, Dept Appl Math & Math Modelling, Stavropol, Russia

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

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2017年 / 94卷 / 09期

关键词：

Computer arithmetic; residue number systems; chinese remainder theorem; residue-to-binary converter; residue arithmetic; 65Y04; 65Y05; 65Y20; 65Y10; DESIGN; IMPLEMENTATION; CONVERTER; NUMBERS; ADDERS; POWER;

D O I：

10.1080/00207160.2016.1247439

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The residue number system (RNS) is an unconventional number system which can lead to parallel and fault-tolerant arithmetic operations. However, the complexity of residue-to-binary conversion for large number of moduli reduces the overall RNS performance, and makes it inefficient for nowadays high-performance computation systems. In this paper, we present an improved approximate Chinese remainder theorem (CRT) with the aim of performing efficient residue-to-binary conversion for general RNS moduli sets. To achieve this aim, the required number of fraction bits for accurate residue-to-binary conversion is derived. Besides, a method is proposed to substitute fractional calculations by similar computations based on integer numbers to have a hardware amenable algorithm. The proposed approach results in high-speed and low-area residue-to-binary converters for general RNS moduli sets. Therefore, with this conversion method, high dynamic range residue number systems suitable for cryptography and digital signal processing can be designed.

引用

页码：1833 / 1849

页数：17

共 50 条

[1] A High-Speed Residue-to-Binary Converter Based on Approximate Chinese Remainder Theorem [J].

Kucherov, Nikolay N. ;

Kuchukov, Viktor A. ;

Kuchukova, Nataliya N. ;

Shangina, Anastasia E. .

PROCEEDINGS OF THE 2018 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (EICONRUS), 2018, :325-328

[2] Fast residue-to-binary conversion using base extension and the Chinese remainder theorem [J].

Omondi, Amos R. .

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2007, 16 (03) :379-388

[3] Residue-to-binary converters based on New Chinese Remainder Theorems [J].

Wang, Y .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2000, 47 (03) :197-205

[4] A generalized Chinese Remainder Theorem for residue sets with errors [J].

Xia, Xiang-Gen ;

Liu, Kejing .

ADVANCES IN APPLIED AND COMPUTATIONAL MATHEMATICS, 2006, :223-+

[5] A residue-to-binary converter for a new five-moduli set [J].

Cao, Bin ;

Chang, Chip-Hong ;

Srikanthan, Thambipillai .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2007, 54 (05) :1041-1049

[6] Residue-to-binary conversion by the "quotient function" [J].

Dimauro, G ;

Impedovo, S ;

Modugno, R ;

Pirlo, G ;

Stefanelli, R .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 2003, 50 (08) :488-493

[7] Improving the Delay of Residue-to-Binary Converter for a Four-Moduli Set [J].

Molahosseini, Amir Sabbagh .

ADVANCES IN ELECTRICAL AND COMPUTER ENGINEERING, 2011, 11 (02) :37-42

[8] Efficient CRT-based residue-to-binary converter for the arbitrary moduli set [J].

Chen JianWen ;

Yao RuoHe .

SCIENCE CHINA-INFORMATION SCIENCES, 2011, 54 (01) :70-78

[9] Efficient CRT-based residue-to-binary converter for the arbitrary moduli set [J].

JianWen Chen ;

RuoHe Yao .

Science China Information Sciences, 2011, 54 :70-78

[10] Efficient CRT-based residue-to-binary converter for the arbitrary moduli set [J].

CHEN JianWen YAO RuoHe School of Electronic and Information EngineeringSouth China University of Technology Guangzhou China .

ScienceChina(InformationSciences), 2011, 54 (01) :70-78

← 1 2 3 4 5 →