Commutative Design Framework (CDF)
- any two-point net may take a complex, arbitrary path
- a path is represented by a sequence of turns
- each turn is a permutation (mapping) function, from track t to track f(t)
- if commutative, the turn sequence can be rewritten in any order
- choose one order corresponding to a canonical form
- numerous complex, arbitrary paths are reduced to same canonical expression
- but different canonical expressions represent different paths to same destination
- choose permutation functions to make canonical expressions diverse,
i.e. reach different tracks
|
|
|