Scheduling designs into a time-multiplexed FPGA

  • Authors:
  • Steve Trimberger

  • Affiliations:
  • Xilinx, Inc., 2100 Logic Drive, San Jose, CA

  • Venue:
  • FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
  • Year:
  • 1998

Quantified Score

Hi-index 0.01

Visualization

Abstract

An algorithm is presented for partitioning a design in time. The algorithm devides a large, technology-mapped design into multiple configurations of a time-multiplexed FPGA. These configurations are rapidly executed in the FPGA to emulate the large design. The tool includes facilities for optimizing the partitioning to improve routability, for fitting the design into more configurations than the depth of the critical path and for compressing the critical path of the design into fewer configurations, both to fit the design into the device and to improve performance. Scheduling results are shown for mapping designs into an 8-configuration time-multiplexed FPGA and for architecture investigation for a time-multiplexed FPGA.