Implementation of RNS addition and RNS multiplication into FPGAs
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
- We investigate whether arithmetic operations based on Residue Number systems (RNS) are cost-effective solutions to implement DSP applications into reconfigurable hardware. We simulated several RNS addition and multiplication implementations by varying the RNS parameters. For RNS addition, our results show that it can be implemented into a 3-stage 80.6- 92.5 MHz pipeline using about 22 to 33 FPGA's logic cells. For RNS multiplication, the attainable speed range was between 78.1 and 87.7 MHz, for operand lengths varying between 5 and 8 bits. Overall, a hybrid solution that combines logical elements and blocks of RAM is the best option, producing better average performance across the whole range of operand lengths.Keywords
This publication has 3 references indexed in Scilit:
- VLSI implementation of residue adders based on binary addersIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992
- Novel approaches to the design of VLSI RNS multipliersIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992
- Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic TransformsIEEE Transactions on Computers, 1980