The switch-pattern exploration method that we presented in the last chapter suffers from the same downside as most of the previous attempts to automate solution of this design problem: It produces highly irregular switch-patterns. In this chapter, largely based on our paper previously published at the 2023 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, under the title “Regularity Matters: Designing Practical FPGA Switch-Blocks”, we extend the method by combining it with Integer Linear Programming (ILP) so that it produces only those solutions that conform to arbitrary definitions of regularity.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Searching for Regular Switch-Patterns

  • Stefan Nikolić

摘要

The switch-pattern exploration method that we presented in the last chapter suffers from the same downside as most of the previous attempts to automate solution of this design problem: It produces highly irregular switch-patterns. In this chapter, largely based on our paper previously published at the 2023 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, under the title “Regularity Matters: Designing Practical FPGA Switch-Blocks”, we extend the method by combining it with Integer Linear Programming (ILP) so that it produces only those solutions that conform to arbitrary definitions of regularity.