A FULLY PARALLEL ALGORITHM FOR RESIDUE TO BINARY CONVERSION

被引：6
作者：
BARSI, F [1 ]
PINOTTI, MC [1 ]
机构：
[1] CNR,IST ELABORAZ INFORMAZ,I-56100 PISA,ITALY
来源：
INFORMATION PROCESSING LETTERS | 1994年 / 50卷 / 01期
关键词：
CHINESE REMAINDER THEOREM; VLSI COMPLEXITY; COMPUTER ARITHMETICS; PARALLEL ALGORITHMS; RNS TO BINARY CONVERSION; RESIDUE NUMBER SYSTEM; VLSI ARCHITECTURES;
D O I：
10.1016/0020-0190(94)90036-1
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A new method for converting numbers from a residue system to a binary notation is proposed which is based upon an original formulation of the Chinese Remainder Theorem. To prove its effectiveness in VLSI implementations a converter is presented and evaluated following a general VLSI model of computation. The proposed structure compares favourably with preceding results presented in the literature; in particular, the time which is required to perform conversion is O(log s), with s representing the total number of input bits.
引用
收藏
页码：1 / 8
页数：8
相关论文
共 15 条
[1]   A VLSI ALGORITHM FOR DIRECT AND REVERSE CONVERSION FROM WEIGHTED BINARY NUMBER SYSTEM TO RESIDUE NUMBER SYSTEM [J].
ALIA, G ;
MARTINELLI, E .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1984, 31 (12) :1033-1039
[2]  
ALIA G, 1991, IEEE T COMPUT, V40
[3]   MOD M ARITHMETIC IN BINARY-SYSTEMS [J].
BARSI, F .
INFORMATION PROCESSING LETTERS, 1991, 40 (06) :303-309
[4]  
BARSI F, 1993, 5 U PER DEP MATH TEC
[5]   A REGULAR LAYOUT FOR PARALLEL ADDERS [J].
BRENT, RP ;
KUNG, HT .
IEEE TRANSACTIONS ON COMPUTERS, 1982, 31 (03) :260-264
[6]   EFFICIENT VLSI NETWORKS FOR CONVERTING AN INTEGER FROM BINARY-SYSTEM TO RESIDUE NUMBER SYSTEM AND VICE VERSA [J].
CAPOCELLI, RM ;
GIANCARLO, R .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1988, 35 (11) :1425-1430
[7]  
CHAKRABORTI NB, 1986, IEEE T COMPUT, V35, P762, DOI 10.1109/TC.1986.1676829
[8]   FAST AND FLEXIBLE ARCHITECTURES FOR RNS ARITHMETIC DECODING [J].
ELLEITHY, KM ;
BAYOUMI, MA .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1992, 39 (04) :226-235
[9]  
HUANG K, 1979, COMPUTER ARITHMETIC
[10]   AREA TIME OPTIMAL VLSI INTEGER MULTIPLIER WITH MINIMUM COMPUTATION TIME [J].
MEHLHORN, K ;
PREPARATA, FP .
INFORMATION AND CONTROL, 1983, 58 (1-3) :137-156
12