AN RNS TO BINARY CONVERTER IN 2N + 1, 2N, 2N - 1 MODULI SET

被引：39

作者：

PREMKUMAR, AB

机构：

[1] School of Applied Sciences, Nanyang Technological University, Division of Computer Engineering

来源：

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING | 1992年 / 39卷 / 07期

关键词：

D O I：

10.1109/82.160172

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

This paper describes a residue number system to binary converter that converts numbers in the moduli set 2n + 1,2n,2n - 1. This moduli set is an extension of the more popular set, 2n + 1,2n,2n - 1. A low complexity implementation using some properties of modular arithmetic is proposed. The converter does not use any explicit modulo operation in the evaluation as is normally done in Chinese remainder theorem.

引用

页码：480 / 482

页数：3

共 10 条

[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]

ARAMBEPOLA B, 1991, IEEE INT S CIRCUITS, P2951

[3] 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

[4] AN EFFICIENT RESIDUE TO BINARY CONVERTER DESIGN [J].

IBRAHIM, KM ;

SALOUM, SN .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1988, 35 (09) :1156-1158

[5]

MOHAN PVA, 1991, IEEE INT S CIRC SYST, P1541

[6] RESIDUE TO BINARY CONVERSION FOR RNS ARITHMETIC USING ONLY MODULAR LOOK-UP TABLES [J].

SHENOY, AP ;

KUMARESAN, R .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1988, 35 (09) :1158-1162

[7]

SODERSTRAND M.A., 1986, RESIDUE NUMBER SYSTE

[8]

Szabo N., 1967, RESIDUE ARITHMETIC I

[9]

Waser S., 1982, INTRO ARITHMETIC DIG

[10]

YASSINE HM, 1991, JUN IEEE INT S CIRC, P2947

← 1 →