Efficient large integer squarers on FPGA

Simin Xu, Suhaib A. Fahmy, Ian V. Mcloughlin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

This paper presents an optimised high throughput architecture for integer squaring on FPGAs. The approach reduces the number of DSP blocks required compared to a standard multiplier. Previous work has proposed the tiling method for double precision squaring, using the least number of DSP blocks so far. However that approach incurs a large overhead in terms of look-up table (LUT) consumption and has a complex and irregular structure that is not suitable for higher word size. The architecture proposed in this paper can reduce DSP block usage by an equivalent amount to the tiling method while incurring a much lower LUT overhead: 21.8% fewer LUTs for a 53-bit squarer. The architecture is mapped to a Xilinx Virtex 6 FPGA and evaluated for a wide range of operand word sizes, demonstrating its scalability and efficiency. © 2013 IEEE.
Original languageEnglish (US)
Title of host publicationProceedings - 21st Annual International IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2013
Pages198-201
Number of pages4
DOIs
StatePublished - Aug 12 2013
Externally publishedYes

Fingerprint Dive into the research topics of 'Efficient large integer squarers on FPGA'. Together they form a unique fingerprint.

Cite this