Scipediacontent: Scipediacontent moved page Draft Content 548998927 to Ronak Fahmy 2016a

2021-02-03T18:22:23Z

Scipediacontent moved page Draft Content 548998927 to Ronak Fahmy 2016a

Scipediacontent: Created page with " == Abstract == Resource sharing in the mapping of an algorithm to an architecture allows the same resource to be scheduled for different uses in different cycles, generally..."

2021-02-03T18:22:19Z

Created page with " == Abstract == Resource sharing in the mapping of an algorithm to an architecture allows the same resource to be scheduled for different uses in different cycles, generally..."

New page

== Abstract ==

Resource sharing in the mapping of an algorithm to an architecture allows the same resource to be scheduled for different uses in different cycles, generally at the cost of increased schedule length. Multi-pumping is a method whereby a resource is clocked at a frequency that is a multiple of the surrounding circuit, thereby offering multiple executions per global clock, and therefore sharing in the same clock cycle. This concept maps well to FPGA architectures, where hard macro blocks are typically capable of running at higher frequencies than standard logic. While this technique has been demonstrated for multipliers, modern DSP blocks are more complex with multiple computational nodes. In this paper, we apply multi-pumping to minimise DSP block usage, while taking advantage of the multiple nodes they support. The proposed approach uses, on average, 39% fewer DSP blocks, at a cost of 19% more LUTs and 7% more registers.

== Original document ==

The different versions of the original document can be found in:

* [http://wrap.warwick.ac.uk/80841/7/WRAP_fpl2016-ronak.pdf http://wrap.warwick.ac.uk/80841/7/WRAP_fpl2016-ronak.pdf]

* [http://xplorestaging.ieee.org/ielx7/7386271/7393109/07393146.pdf?arnumber=7393146 http://xplorestaging.ieee.org/ielx7/7386271/7393109/07393146.pdf?arnumber=7393146],
: [http://dx.doi.org/10.1109/fpt.2015.7393146 http://dx.doi.org/10.1109/fpt.2015.7393146]

* [https://dblp.uni-trier.de/db/conf/fpt/fpt2015.html#RonakF15 https://dblp.uni-trier.de/db/conf/fpt/fpt2015.html#RonakF15],
: [http://wrap.warwick.ac.uk/80841 http://wrap.warwick.ac.uk/80841],
: [http://wrap-test.warwick.ac.uk/74989 http://wrap-test.warwick.ac.uk/74989],
: [https://academic.microsoft.com/#/detail/2202125064 https://academic.microsoft.com/#/detail/2202125064]

← Older revision	Revision as of 18:22, 3 February 2021
(No difference)

Ronak Fahmy 2016a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 548998927 to Ronak Fahmy 2016a

Scipediacontent: Created page with " == Abstract == Resource sharing in the mapping of an algorithm to an architecture allows the same resource to be scheduled for different uses in different cycles, generally..."