New reverse converters for the moduli set {2n-3,2n-1,2n+1,2n+3}

被引：32

作者：

Mohan, P. V. Ananda ^{[1
]}

机构：

[1] Elect Corp India Ltd, Bangalore 560052, Karnataka, India

来源：

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS | 2008年 / 62卷 / 09期

关键词：

Residue number systems (RNS); DSP; Three moduli sets; Reverse converters;

D O I：

10.1016/j.aeue.2007.08.008

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, three reverse converters for a recently proposed balanced moduli set {2(n) - 3,2(n) + 1,2(n) - 1,2(n) + 3} are presented. The first proposed converter is based oil mixed radix conversion (MRC) considering two moduli at a time in parallel and combining the residues using MRC. This converter does not need any ROM. This converter is derived through the use of higher Radix Montgomery's modulo multiplication for simplifying the hardware. The other two reverse converter implementations use ROMs as well as combinational logic. One of these is based oil MRC and another is based on Chinese remainder theorern (CRT). All the three proposed designs are compared with,I previously reported converter for this moduli set as well as other converters for three, four and five moduli sets regarding the hardware requirements and conversion time. (C) 2007 Elsevier GmbH. All rights reserved.

引用

页码：643 / 658

页数：16

共 68 条

[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] A full RNS implementation of RSA [J].

Bajard, JC ;

Imbert, L .

IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (06) :769-774

[3] An RNS Montgomery modular multiplication algorithm [J].

Bajard, JC ;

Didier, LS ;

Kornerup, P .

IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (07) :766-776

[4]

BERNARDSON P, 1985, IEEE T CIRCUITS SYST, V32, P298

[5] Breaking the 2n-bit carry propagation barrier in residue to binary conversion for the [2n-1, 2n, 2n+1] modula set [J].

Bhardwaj, M ;

Premkumar, AB ;

Srikanthan, T .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1998, 45 (09) :998-1002

[6]

Bhardwaj M., 1999, IEEE C COMP AR

[7] FAST CONVERSION BETWEEN BINARY AND RESIDUE NUMBERS [J].

BI, G ;

JONES, EV .

ELECTRONICS LETTERS, 1988, 24 (19) :1195-1197

[8] Efficient reverse converters for four-moduli sets {2n-1, 2n, 2n+1, 2n+1-1} and {2n-1, 2n, 2n+1, 2n-1-1} [J].

Cao, B ;

Srikanthan, T ;

Chang, CH .

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2005, 152 (05) :687-696

[9] An efficient reverse converter for the 4-moduli set {2n-1, 2n, 2n+1, 22n+1} based on the new Chinese remainder theorem [J].

Cao, B ;

Chang, CH ;

Srikanthan, T .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2003, 50 (10) :1296-1303

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

← 1 2 3 4 5 6 7 →