IEICE TRANSACTIONS on Fundamentals
Red-Black Interval Trees in Device-Level Analog Placement
Summary :
The traditional way of approaching device-level placement problems for analog layout is to explore a huge search space of absolute placement representations, where cells are allowed to illegally overlap during their moves. This paper presents a novel exploration technique for analog placement, operating on a subset of tree representations of the layout, where the typical presence of an arbitrary number of symmetry groups of devices is directly taken into account during the search of the solution space. The efficiency of the novel approach is due to the use of red-black interval trees, data structures employed to support operations on dynamic sets of intervals.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.12 pp.3127-3135
- Publication Date
- 2003/12/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
- Category
- Analog Design
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sarat C. MARUVADA, Karthik KRISHNAMOORTHY, Florin BALASA, Lucian M. IONESCU, "Red-Black Interval Trees in Device-Level Analog Placement" in IEICE TRANSACTIONS on Fundamentals,
vol. E86-A, no. 12, pp. 3127-3135, December 2003, doi: .
Abstract: The traditional way of approaching device-level placement problems for analog layout is to explore a huge search space of absolute placement representations, where cells are allowed to illegally overlap during their moves. This paper presents a novel exploration technique for analog placement, operating on a subset of tree representations of the layout, where the typical presence of an arbitrary number of symmetry groups of devices is directly taken into account during the search of the solution space. The efficiency of the novel approach is due to the use of red-black interval trees, data structures employed to support operations on dynamic sets of intervals.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_12_3127/_p
Copy
@ARTICLE{e86-a_12_3127,
author={Sarat C. MARUVADA, Karthik KRISHNAMOORTHY, Florin BALASA, Lucian M. IONESCU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Red-Black Interval Trees in Device-Level Analog Placement},
year={2003},
volume={E86-A},
number={12},
pages={3127-3135},
abstract={The traditional way of approaching device-level placement problems for analog layout is to explore a huge search space of absolute placement representations, where cells are allowed to illegally overlap during their moves. This paper presents a novel exploration technique for analog placement, operating on a subset of tree representations of the layout, where the typical presence of an arbitrary number of symmetry groups of devices is directly taken into account during the search of the solution space. The efficiency of the novel approach is due to the use of red-black interval trees, data structures employed to support operations on dynamic sets of intervals.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Red-Black Interval Trees in Device-Level Analog Placement
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3127
EP - 3135
AU - Sarat C. MARUVADA
AU - Karthik KRISHNAMOORTHY
AU - Florin BALASA
AU - Lucian M. IONESCU
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2003
AB - The traditional way of approaching device-level placement problems for analog layout is to explore a huge search space of absolute placement representations, where cells are allowed to illegally overlap during their moves. This paper presents a novel exploration technique for analog placement, operating on a subset of tree representations of the layout, where the typical presence of an arbitrary number of symmetry groups of devices is directly taken into account during the search of the solution space. The efficiency of the novel approach is due to the use of red-black interval trees, data structures employed to support operations on dynamic sets of intervals.
ER -
English
