Efficient tree topology for FPGA interconnect network

  • Authors:
  • Marrakchi Zied;Mrabet Hayder;Amouri Emna;Mehrez Habib

  • Affiliations:
  • Paris 6 university, Paris, France;Paris 6 university, Paris, France;Paris 6 university, Paris, France;Paris 6 university, Paris, France

  • Venue:
  • Proceedings of the 18th ACM Great Lakes symposium on VLSI
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an improved Tree-based architecture that unifies two unidirectional programmable networks: A predictible downward network based on the Butter y-Fat-Tree topology, and an upward network using hierarchy. Studies based on Rent's Rule show that switch requirements in this architecture grow slower than in traditional Mesh topologies. New tools are developed to place and route several benchmark circuits on this architecture. Experimental results show that the Tree-based architecture can implement MCNC benchmark circuits with an average gain of 54% in total area compared with Mesh architecture.