An Augmented Line Segment-Based Algorithm with Delayed Overlap Consideration and Reconfigurable Logic for RSMT Problem

Abstract

An Augmented Line Segment-Based (ALSB) algorithm with delayed overlap consideration is proposed for the construction of Rectilinear Steiner Minimum Tree (RSMT). The algorithm incrementally augments the four line segments drawn from each point in four directions. When the line segments of two points interconnect, the edge connecting those two points is included to RSMT. The selection of the L-shaped layout is done after all the edges are identified. After the RSMT edges are selected, the two layouts of each edge are compared based on overlap count, and the layout with maximum overlap is added to RSMT, thereby reducing the total length of RSMT. RSMT has wide application in the field of VLSI during global routing.