Large multipliers with less DSP blocks - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Large multipliers with less DSP blocks

(1) , (1)
1
Florent de Dinechin
Bogdan Pasca
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR2009-03.pdf (115.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ensl-00356421 , version 1 (27-01-2009)

Identifiers

  • HAL Id : ensl-00356421 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More