In order to deal with hierarchical routing with delay and bandwidth constraints, a new topology aggregation algorithm called stair method was proposed.
针对时延—带宽约束的层次路由问题，提出了楼梯法这一全新的拓扑聚集算法。
A method to design connection switch for FPGA of the hierarchical interconnection resource is presented. Maze routing algorithm has been used to analyze the architecture of connection switch.
提出了一种层次式布线资源FPGA连线开关的设计方法，采用迷宫算法，对连线开关的结构进行了分析。
应用推荐