CAD For IC Design: (MEL ZG641)

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 28

CAD for IC Design

(MEL ZG641)

Lecture 7 8: Floorplanning

August 14, 2021

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 1 / 15


Outline

1 Introduction

2 Problem definition

3 Cost functions

4 Terminology

5 Slicing Floorplan

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 2 / 15


Introduction

Tasks to be followed sequentially to obtain layout from specification:


1 Layout hierarchy
2 Computing overall silicon area
3 To determine the aspect ratios of each module
4 Pin and IO pad locations
5 Placement
6 Routing (clock and power/ground signal)

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 3 / 15


Introduction

VLSI circuit as a set of rectangular blocks with interconnection

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 4 / 15


Introduction

VLSI circuit as a set of rectangular blocks with interconnection

Placing blocks on a 2-d surface such that no two blocks overlap

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 4 / 15


Introduction

VLSI circuit as a set of rectangular blocks with interconnection

Placing blocks on a 2-d surface such that no two blocks overlap

Certain objectives are to be optimized

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 4 / 15


Introduction

More flexible than placement

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 5 / 15


Introduction

More flexible than placement

Block orientation, shapes and sizes may be chosen for optimization or


to fulfill user specified constraints

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 5 / 15


Problem Definition

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

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 6 / 15


Floorplanning model

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

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 7 / 15


Example

Figure: Modules to be placed

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 8 / 15


Cost functions

For a given problem the number of possible solution is very large

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 9 / 15


Cost functions

For a given problem the number of possible solution is very large

For an unbounded total area it is infinite

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 9 / 15


Cost functions

For a given problem the number of possible solution is very large

For an unbounded total area it is infinite

Objective function allows to select the best possible solution

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 9 / 15


Cost functions

1 Minimum area
2 Minimum wire-length
3 Maximum routability
4 Minimum delay
5 Any combination of above

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 10 / 15


Performance

Speed is treated as the deciding factor

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 11 / 15


Performance

Speed is treated as the deciding factor

Decided by identifying the critical path

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 11 / 15


Performance

Speed is treated as the deciding factor

Decided by identifying the critical path

Implementation where the connected modules are placed nearby are


considered better for minimizing the interconnect delay

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 11 / 15


Performance

To find a feasible floorplan with minimum overall area

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 12 / 15


Performance

To find a feasible floorplan with minimum overall area

Rectangles are kept in sorted queue (W /H)

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 12 / 15


Performance

To find a feasible floorplan with minimum overall area

Rectangles are kept in sorted queue (W /H)

Queue is dynamic

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 12 / 15


Performance

To find a feasible floorplan with minimum overall area

Rectangles are kept in sorted queue (W /H)

Queue is dynamic

Cost function is a weighted sum of area and the overall length as:

cost = α × A + β × L

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 12 / 15


Terminology

Rectangular dissection:
– Subdivision of a rectangle by a finite number of horizontal and
vertical line segments

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 13 / 15


Terminology

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

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 13 / 15


Slicing Floorplan

Slicing tree (slicing floorplan tree):


– Similar to binary tree with leaves (rectangle) and nodes
(vertical/horizontal cut lines)
– More than one slicing tree is possible for a given structure

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 14 / 15


Slicing Floorplan

Slicing tree (slicing floorplan tree):


– Similar to binary tree with leaves (rectangle) and nodes
(vertical/horizontal cut lines)
– More than one slicing tree is possible for a given structure
Slicing floorplans:
– Floorplan that corresponds to a slicing structure is called slicing
floor plan

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 14 / 15


Slicing Floorplan

Slicing tree (slicing floorplan tree):


– Similar to binary tree with leaves (rectangle) and nodes
(vertical/horizontal cut lines)
– More than one slicing tree is possible for a given structure
Slicing floorplans:
– Floorplan that corresponds to a slicing structure is called slicing
floor plan
Non-slicing floorplans:
– Floorplan that corresponds to non-slicing structure is called
non-slicing floorplan (wheel)

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 14 / 15


Example

Figure: Obtain slicing tree for the above floor plan

Lecture 7 8: Floorplanning CAD for IC Design August 14, 2021 15 / 15

You might also like