Skip to content

Algorithms

Radhakrishna Sanka edited this page Oct 13, 2017 · 6 revisions

GRID Connections

Example is for horizontalConnect, if its verticalConnect everything will still be similar. This algorithm generates enough connections to minimally

algorithm automatic horizontal connections for grid:

input: Left Component - lc, Right Component - rc

output: Connection List - connlist

lcts <- find terminals on the right side of lc
rcts <- find terminal on the left side of rc

n_lcts <- size of lcts collection
n_rcts <- size of rcts collection

if n_lcts < n_rcts then
   small <- lcts
   big <- rcts
   smalln <- n_lcts
else
   small <- rcts
   big <- lcts
   smalln <- n_rcts
endif

loop i = 1 .. smalln

   add new connection between lc and rc into connlist

end loop


2.5D Design File Generation

This algorithm specifies how the design files should be generated by going through the different features and depth it will be.

foreach logical_layer:

   create hashmap<depth, [features]>

   foreach component in logical_layer:
      put features into hashmap based on depth
   end

   foreach connection in logical_layer:
      put feature into bashmap based on depth
   end

   foreach depth in hashmap:
      create n output svg/eps/DXF
   end

end
Clone this wiki locally