Skip to Main content Skip to Navigation
Conference papers

Arithmetic core generation using bit heaps

Nicolas Brunie 1, 2, 3 Florent de Dinechin 1, 2, 4 Matei Istoan 1, 4 Guillaume Sergent 1 Kinga Illyes 5 Bogdan Popa 5 
2 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
4 SOCRATE - Software and Cognitive radio for telecommunications
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : A bit heap is a data structure that holds the unevaluated sum of an arbitrary number of bits, each weighted by some power of two. Most advanced arithmetic cores can be viewed as involving one or several bit heaps. We claim here that this point of view leads to better global optimization at the algebraic level, at the circuit level, and in terms of software engineering. To demonstrate it, a generic software framework is introduced for the definition and optimization of bit heaps. This framework, targeting DSP-enabled FPGAs, is developed within the open-source FloPoCo arithmetic core generator. Its versatility is demonstrated on several examples: multipliers, complex multipliers, polynomials, and discrete cosine transform.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Florent de Dinechin Connect in order to contact the contributor
Submitted on : Friday, November 29, 2013 - 4:06:43 PM
Last modification on : Friday, September 30, 2022 - 4:12:05 AM
Long-term archiving on: : Saturday, April 8, 2017 - 2:54:19 AM


Files produced by the author(s)


  • HAL Id : ensl-00738412, version 2


Nicolas Brunie, Florent de Dinechin, Matei Istoan, Guillaume Sergent, Kinga Illyes, et al.. Arithmetic core generation using bit heaps. 23rd International Conference on Field Programmable Logic and Applications, Sep 2013, Porto, Portugal. pp.1-8. ⟨ensl-00738412v2⟩



Record views


Files downloads