algorithms for automatic length compensation of busses in analog integrated circuits
Algorithms for the length-compensation of bus geometries are presented. The algorithms are capable of automatically rerouting busses such that individual trace lengths are equalized, for an arbitrary number of traces, an arbitrary distribution of starting trace lengths, as well as arbitrary trace widths and intertrace spacings. Algorithms are also presented that allow the automatic adaptation to given space constraints and the observance of minimum structure sizes.
length compensation virtual terminals paired nets routing net bundles bus routing analog routing rf ic-layout eda