loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE Symposium on FPGAs for Custom Computing Machines
Implementation of RNS Addition and RNS Multiplication into FPGAs
Napa Valley, California
April 15-April 17
ISBN: 0-8186-8900-5
Luiz Maltar, COPPE-Universidade Federal do Rio de Janeiro
Felipe M.G. França, COPPE-Universidade Federal do Rio de Janeiro
Vladimir C. Alves, COPPE-Universidade Federal do Rio de Janeiro
Cláudio L. Amorim, COPPE-Universidade Federal do Rio de Janeiro
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.
Citation:
Luiz Maltar, Felipe M.G. França, Vladimir C. Alves, Cláudio L. Amorim, "Implementation of RNS Addition and RNS Multiplication into FPGAs," fccm, pp.331, IEEE Symposium on FPGAs for Custom Computing Machines, 1998
Usage of this product signifies your acceptance of the Terms of Use.