Professional Documents
Culture Documents
CAD For IC Design: (MEL ZG641)
CAD For IC Design: (MEL ZG641)
CAD For IC Design: (MEL ZG641)
(MEL ZG641)
Lecture 7 8: Floorplanning
1 Introduction
2 Problem definition
3 Cost functions
4 Terminology
5 Slicing Floorplan
Input:
– A set of n rectangular modules S = {1, 2, ..., n}
– S1 and S2 are partition of S
– Interconnection matrix of size n × n
– A list of N triplets (Ai , ri , si ) A: area, r and s are lower and upper bound
constraints of the shape
– Lower (p) and upper bound (q) constraints for enveloping rectangle
containing n blocks
Output:
– Area of each module ≤ Ai
– Aspect ratio (H/W) should be within r and s
– Each rectangle should be large enough to accommodate the given
module
– No space left (may be rotated)
– The enveloping rectangle aspect ratio should be within p an q
1 Minimum area
2 Minimum wire-length
3 Maximum routability
4 Minimum delay
5 Any combination of above
Queue is dynamic
Queue is dynamic
Cost function is a weighted sum of area and the overall length as:
cost = α × A + β × L
Rectangular dissection:
– Subdivision of a rectangle by a finite number of horizontal and
vertical line segments
Rectangular dissection:
– Subdivision of a rectangle by a finite number of horizontal and
vertical line segments
Slicing structure:
– Rectangular dissection that can be obtained by repetitively
subdividing rectangles horizontally and vertically into smaller
rectangles