Algorithm analysis and mapping environment for adaptive computing systems (poster abstract)

  • Authors:
  • Eric K. Pauer;Paul D. Fiore;John M. Smith;Cory S. Myers

  • Affiliations:
  • -;-;-;-

  • Venue:
  • FPGA '00 Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Our team is developing an integrated algorithm analysis and mapping environment for migrating a dataflow representation of a signal processing algorithm into an Adaptive Computing System (ACS) consisting of FPGAs. This environment allows designers to transform signal processing algorithms into FPGA-based hardware faster, by an order of magnitude, than is currently possible. Our approach has been to focus on three areas of capability critical to the success of adaptive computing: algorithm analysis, algorithm mapping, and smart generators. These capabilities are being implemented as extensions to the Ptolemy design environment developed at the University of California, Berkeley (http://ptolemy.cecs.berkeley.edu). Our tools were used to automatically implement a Winograd DFT and a high speed linear FM detector. In both cases, our tools simulated the algorithm, selected appropriate fixed point representations, and generated the VHDL implementations. The final FPGA designs were obtained by synthesizing the VHDL and performing place and route with commercial tools.