• DocumentCode
    2142887
  • Title

    Multi-pumping for resource reduction in FPGA high-level synthesis

  • Author

    Canis, Andrew ; Anderson, Jason H. ; Brown, Stephen D.

  • Author_Institution
    ECE Department, University of Toronto, ON, Canada
  • fYear
    2013
  • fDate
    18-22 March 2013
  • Firstpage
    194
  • Lastpage
    197
  • Abstract
    Resource sharing is a classic high-level synthesis (HLS) optimization that saves area by mapping multiple operations to a single functional unit. With resource sharing, only operations scheduled in separate cycles can be assigned to shared hardware, which can result in longer schedules. In this paper, we propose a new approach to resource sharing that allows multiple operations to be performed by a single functional unit in one clock cycle. Our approach is based on multi-pumping, which operates functional units at a higher frequency than the surrounding system logic, typically 2×, allowing multiple computations to complete in a single system cycle. Our approach is particularly effective for DSP blocks on an FPGA, which are used to perform multiply and/or accumulate operations. Our results show that resource sharing using multi-pumping is comparable to traditional resource sharing in terms of area saved, but provides significant performance advantages. Specifically, when targeting a 50% reduction in DSP blocks, traditional resource sharing decreases circuit speed performance by 80%, on average, whereas multi-pumping decreases circuit speed by just 5%. Multi-pumping is a viable approach to achieve the area reductions of resource sharing, with considerably less negative impact to circuit performance.
  • Keywords
    Benchmark testing; Clocks; Digital signal processing; Field programmable gate arrays; Pipelines; Registers; Resource management;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design, Automation & Test in Europe Conference & Exhibition (DATE), 2013
  • Conference_Location
    Grenoble, France
  • ISSN
    1530-1591
  • Print_ISBN
    978-1-4673-5071-6
  • Type

    conf

  • DOI
    10.7873/DATE.2013.053
  • Filename
    6513499