The document describes the steps of the Stockmeyer algorithm to compute the minimum floorplan area. It involves visiting nodes, where vertical cuts increase width and decrease height in the dimension list, while horizontal cuts decrease width and increase height. For each node, the algorithm joins the left and right dimension lists based on which side contributes the maximum value to produce the resulting dimensions.
The document describes the steps of the Stockmeyer algorithm to compute the minimum floorplan area. It involves visiting nodes, where vertical cuts increase width and decrease height in the dimension list, while horizontal cuts decrease width and increase height. For each node, the algorithm joins the left and right dimension lists based on which side contributes the maximum value to produce the resulting dimensions.
The document describes the steps of the Stockmeyer algorithm to compute the minimum floorplan area. It involves visiting nodes, where vertical cuts increase width and decrease height in the dimension list, while horizontal cuts decrease width and increase height. For each node, the algorithm joins the left and right dimension lists based on which side contributes the maximum value to produce the resulting dimensions.
rm Stockmeyer algorithm to compute the minimum area of the floor-
plan. In case of vertical cut, the width is increasing and the height is decreasing in the dimension list. In case of horizontal cut, the width is decreasing and the height is increasing. (a) Visit node a: Since the cut orientation is vertical; L = {(2, 3), (3, 2)} R = {(2, 4), (4, 2)} (i) Join l 1 = (2, 3) and r 1 = (2, 4): we get (2 + 2, max{3, 4}) = (4, 4). Since the maximum is from R, we join l 1 and r 2 next. (ii) Join l 1 = (2, 3) and r 2 = (4, 2): we get (2 + 4, max{3, 2}) = (6, 3). Since the maximum is from L, we join l 2 and r 2 next. (iii) Join l 2 = (3, 2) and r 2 = (4, 2): we get (3 + 4, max{2, 2}) = (7, 2). Thus, the resulting dimensions are {(4, 4), (6, 3), (7, 2)}.66 PRACTICAL PROBLEMS IN VLSI PHYSICAL DESIGN AUTOMATION (b) Visit node b: Since the cut orientation is horizontal; L = {(4, 2), (2, 4)} R = {(3, 1), (1, 3)} (i) Join l 1 = (4, 2) and r 1 = (3, 1): we get (max{