Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Large multipliers with less DSP blocks

Florent de Dinechin 1 Bogdan Pasca 1 
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Recent computing-oriented FPGAs feature DSP blocks including small embedded multipliers. A large integer multiplier, for instance for a double-precision floating-point multiplier, consumes many of these DSP blocks. This article studies three non-standard implementation techniques of large multipliers: the Karatsuba-Ofman algorithm, non-standard multiplier tiling, and specialized squarers. They allow for large multipliers working at the peak frequency of the DSP blocks while reducing the DSP block usage. Their overhead in term of logic resources, if any, is much lower than that of emulating embedded multipliers. Their latency overhead, if any, is very small. Complete algorithmic descriptions are provided, carefully mapped on recent Xilinx and Altera devices, and validated by synthesis results.
Document type :
Conference papers
Complete list of metadata
Contributor : Florent de Dinechin Connect in order to contact the contributor
Submitted on : Tuesday, January 27, 2009 - 2:43:37 PM
Last modification on : Friday, February 4, 2022 - 3:19:52 AM
Long-term archiving on: : Friday, October 12, 2012 - 10:20:15 AM


Files produced by the author(s)


  • HAL Id : ensl-00356421, version 1



Florent de Dinechin, Bogdan Pasca. Large multipliers with less DSP blocks. Field Programmable Logic and Applications, Aug 2009, Czech Republic. ⟨ensl-00356421⟩



Record views


Files downloads