Graph based analysis of 2-D FPGA routing

@article{Wu1996GraphBA,
  title={Graph based analysis of 2-D FPGA routing},
  author={Yu-Liang Wu and Shuji Tsukiyama and Malgorzata Marek-Sadowska},
  journal={IEEE Trans. on CAD of Integrated Circuits and Systems},
  year={1996},
  volume={15},
  pages={33-44}
}
In this paper, we study the two-dimensional FPGA, Xilinx-like routing architectures and present the first known computational complexity results for them. The routing problem is formulated as a two-dimensional interval packing problem and is proved to be NP-complete with or without doglegs. Next, we consider other routing structures obtained from the industrial one by arbitrarily changing switch box connection topology while maintaining the same connection flexibility. There is an exponentially… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS