On Optimum Switch Box Designs for 2-D FPGAs

Therefore to verify that a design is hyper universal

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ely determined by and , in an optimum which is denoted by . A global routing is called primitive if it does not contain two unequal nets of size . If a -global routing is not primitive, then we can combine the unequal nets of size into nets of size to obtain a primitive -global routing . Any detailed global routing of will induce a detailed global routing of by simply deleting the edges of those one edge trees representing the nets of size two in which are obtained by combining the unequal nets of size in . Therefore, to verify that a -design is hyper-universal, we need only to show that each primitive global routing is detailed routable. ¥ ¥ U¥ H£ E  ¥ ¥ I P £ E ¨ ¨ ¨   §¢  SR " 2  I P QA¢  GE F 4 B 2 1 ¨ C2 1 D2 1 ¨¨ 8  B2 1 [email protected] ¨ ¨ 976531  8 2 1 4 2 $  ) 0$ ¥ '&$ £% (!  #¥ £ " " "" " #¥  "  £   £ !   C box  wire segment 1 23 4 ¥ track ID vertical channel ¥ §¤  ¥  ¥ ¨¤ ¡ ¥ ¦¥  ¤¢ £  ¥ ¨ § ©¤ ¥ ¨ ¥  ¤¢ £ ¡ ¥ ¦¥  ¤¢ £ ¥ ¨©¥¤¤  ¤¢ £ ¥ ¦¥  §¢ £   ¥ U¥  £ ¥ U¥  £   ¥ ¤  £ E  ¥ ¦¥  £ ¥R £ ©  . ¡ ¤   †R   †R ¥ HR  £  ¥ HR  £  ...
View Full Document

Ask a homework question - tutors are online