• DocumentCode
    3048536
  • Title

    A flexible DSP block to enhance FPGA arithmetic performance

  • Author

    Parandeh-Afshar, Hadi ; Cevrero, Alessandro ; Athanasopoulos, Panagiotis ; Brisk, Philip ; Leblebici, Yusuf ; Ienne, Paolo

  • Author_Institution
    Sch. of Comput. & Commun. Sci., Ecole Polytech. Fed. de Lausanne (EPFL), Lausanne, Switzerland
  • fYear
    2009
  • fDate
    9-11 Dec. 2009
  • Firstpage
    70
  • Lastpage
    77
  • Abstract
    We propose a new DSP block for use in modern high-performance FPGAs. Current DSP blocks contain fixed-bitwidth multipliers that can be combined efficiently to form larger multipliers. Our approach is similar, but includes a bypass layer following the partial product generator that exposes the compressor tree used for partial product reduction directly to the user. As a consequence, the proposed DSP block can accelerate multi-input addition operations in addition to multiplication. To increase the flexibility of the device, the partial product reduction tree used within our DSP block uses a fixed-function compression logic along with a field programmable compressor tree (FPCT), the latter of which is user-configurable to meet the needs of the application at hand. Multi-input addition operations can be mapped directly onto the FPCT without compromising any of the other functionality of the DSP block.
  • Keywords
    digital signal processing chips; field programmable gate arrays; DSP block; FPGA arithmetic performance; field programmable compressor tree; fixed-bitwidth multipliers; fixed-function compression logic; multi-input addition operations; partial product generator; Acceleration; Adders; Circuit synthesis; Delay; Digital arithmetic; Digital signal processing; Field programmable gate arrays; High performance computing; Routing; Table lookup;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Field-Programmable Technology, 2009. FPT 2009. International Conference on
  • Conference_Location
    Sydney, NSW
  • Print_ISBN
    978-1-4244-4375-8
  • Electronic_ISBN
    978-1-4244-4377-2
  • Type

    conf

  • DOI
    10.1109/FPT.2009.5377638
  • Filename
    5377638