Minimizing the longest routing wires of large-scale flux circuits

Sponsor: Intelligence Advanced Research Projects Activity (IARPA)

Development of a routing tools for single flux quantum (SFQ) circuits. The routing tools aims at finding connection wire paths of all nets of a SFQ circuit while satisfying design rule check. The following is for elaboration: The routing tools are further optimized to identify critical nets with the longest routed wire length and to re-route their nets for a shorter wire length. The routing algorithm for the re-route process is a maze routing algorithm which searches wire paths with the lowest cost of routing individual nets.

Related work: