Scribd
Upload
18 views3 pages

Unit Iii

This document covers key concepts in floor planning and routing, including parameters of local routing problems, definitions of floor planning and slicing floorplans, and the stages and goals of routing. It outlines optimization problems, algorithms used in routing, and the distinction between gridded and gridless routing. Additionally, it introduces terms such as abut, permutability, and wheel floorplans, providing a comprehensive overview of the subject matter.

Uploaded by

alaguvel3
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views3 pages

Unit Iii

This document covers key concepts in floor planning and routing, including parameters of local routing problems, definitions of floor planning and slicing floorplans, and the stages and goals of routing. It outlines optimization problems, algorithms used in routing, and the distinction between gridded and gridless routing. Additionally, it introduces terms such as abut, permutability, and wheel floorplans, providing a comprehensive overview of the subject matter.

Uploaded by

alaguvel3
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

UNIT-III

FLOOR PLANNING AND ROUTING

PART-A

1. List the parameters characterizing the local routing problem? (or) List the types of local
routing problems?

 The number of wiring layers.


 The orientation of wire segments in a given layer.
 Gridded or gridless routing.
 The presence or absence of obstacles.
 The positioz of the terminals.
 Permutabiliry of terminals.
 Electrically equivalent terminals.
2. What is floor planning?

Before placement, one can estimate the area to be occupied by the various
subblocks and together with a precise or estimated interconnection pattern, try to allocate
distinct regions of the integrated circuit to the specific subblocks. This process is called
floorplanning.

3. What is slicing floorplan?

If the children of all composite cells can be obtained by bisecting the cell
horizontally or vertically, the floorplan is called a slicing floorplan. So, in a slicing
floorplan a composite cell is made by combining its children horizontally or vertically. A
natural way to represent a slicing floorplan is by means of a slicing tree.

4. Define abut?

When two cells that need to be electrically connected have their terminals in the
right order and separated correctly, the cells can simply be put against each other without
the necessity for a routing channel in between them. Such cells are said to abut.

5. What are the Optimization Problems in Floorplanning?


 Mapping of a structural description to a floorplan
 Floorplan sizing
 Generation of flexible cells.

6. How to formulate the sizing problem for slicing floorplans?


 Construct the shape function of the top-level composite cell in a bottom-up
fashion starting with the lowest level and combining shape functions while
moving upwards.
 Choose the optimal shape of the top-level cell.
 Propagate the consequences of the choice for the optimal shape down the slicing
tree until the shapes of all leaf cells are fixed.
7. What are the stages in routing?

Routing is normally performed in two stages. The first stage, called global or
loose routing, determines through which wiring channels a connection will run. The
second stage, called local or detailed routing, fixes the precise paths that a wire will
take (its position inside a channel and its layer).
8. What are the steps in Lees algorithm?
 wave propagation
 backtracing
 cleanup.
9. What are the types of routing?
 Area routing
 Channel routing
 Global routing
10. What are the goals of routing?
 Minimal interconnection length
 Minimization of height of routing area
11. What are the models used in Channel Routing?
 All wires run along orthogonal grid lines with uniform separation'
 There are two wiring layers.
 Horizontal segments are put on one layer and vertical segments on the other
one.
 For each net, the wiring is realized by a single horizontal segment, with vertical
segments connecting it to all terminals of the net. An exception is made when
cycles in thevertical constraint graph (see later on) occur. In this case the problem
cannot be solved unless at least one net in each cycle is realized with two horizontal
segments.

12. What are the algorithms used in local routing?


 Vertical constraint graph
 Horizontal constraint graph

13. Define wheel floorplan?


A single horizontal and vertical line does not segregate the parts. The children of
a given cell cannot be obtained by bisection. This is called as wheel or spiral floorplan.

14. Define permutability?

Permutabiliry of terminals means that, sometimes the router is allowed to


interchange terminals because they arefunctionally equivalent.
15. What is meant by Gridded or gridless routing.
In gridded routing, all wire segments run along lines of an orthogonal grid with
uniform spacing between the lines. In gridless routing, wires of different widths as well
as contacts are explicitly represented.

PART- B

1. Describe the concept of floor planning.


2. Explain robust channel routing algorithm with suitable example.
3. Describe the shape functions, floor plan sizing in floor planing.
4. Describe about rectilinear steiner tree algorithm.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy