Patent ID: 11886786
Assignee: FUZHOU UNIVERSITY
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 3:
4. The two-step X-architecture Steiner minimum tree construction method according to claim 3, wherein S11 is specifically as follows:
the edge-vertex encoding strategy uses an edge of a spanning tree and a PS selection of the edge to represent an edge of a candidate X-architecture Steiner tree; the PS selection is used to convert the edge of the spanning tree into an X-architecture edge of an X-architecture Steiner tree; each PS has four selections: selection 0, selection 1, selection 2 and selection 3; if a net to be routed comprises n pins, each candidate XST comprises (n−1) spanning tree edges, (n−1) bits of PS selections, and a numeral representing the fitness of one particle; and due to the fact that two pins of each edge of one spanning tree are represented by two numerals, the total length of each particle code is 3(n−1)+1.