Module placement with boundary constraints using the sequence-pair representation

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455)

• Publication date

  2001-01-30

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/ASPDAC.2001.913360
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast evaluation of sequence pair in block placement by longest common subsequence computation

  2001cited by this paper
• B*-trees: a new representation for non-slicing floorplans

  2000cited by this paper
• An O-tree representation of non-slicing floorplan and its applications

  1999cited by this paper
• Arbitrary convex and concave rectilinear block packing using sequence-pair

  1999cited by this paper
• Slicing floorplans with boundary constraint

  1999cited by this paper
• Module placement for analog layout using the sequence-pair representation

  1999cited by this paper
• Slicing floorplans with range constraint

  1999cited by this paper
• Sequence-pair based placement method for hard/soft/pre-placed modules

  1998cited by this paper
• The channeled-BSG: a universal floorplan for simultaneous place/route with IC applications

  1998cited by this paper
• Slicing floorplans with pre-placed modules

  1998cited by this paper
• Arbitrary rectilinear block packing based on sequence pair

  1998cited by this paper
• Module placement on BSG-structure with pre-placed modules and rectilinear modules

  1998cited by this paper
• Rectilinear block placement using sequence-pair

  1998cited by this paper
• Topology constrained rectilinear block packing for layout reuse

  1998cited by this paper
• A mapping from sequence-pair to rectangular dissection

  1997cited by this paper
• VLSI/PCB placement with obstacles based on sequence-pair

  1997cited by this paper
• General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure

  1997cited by this paper
• VLSI module placement based on rectangle-packing by the sequence-pair

  1996cited by this paper
• Module placement on BSG-structure and IC layout applications

  1996cited by this paper
• A New Algorithm for Floorplan Design

  1986cited by this paper

• PARSAC: Fast, Human-quality Floorplanning for Modern SoCs with Complex Design Constraints

  2024cites this paper
• Congestion Estimation Using Various Floorplan Techniques in 28nm Soc Design

  2020cites this paper
• Constraint propagation in physical design of circuits

  2020cites this paper
• Scheduling under the network of temporo-spatial proximity relationships

  2017cites this paper
• Handling precedence constraints in scheduling problems by the sequence pair representation

  2015cites this paper
• Hierarchical Optimization-Based Approach for Two-Dimensional Rectangular Layout Design Problems

  2014cites this paper
• Fully Dynamic Evaluation of Sequence Pair

  2013cites this paper
• Floorplanning with boundary constraints by using AE-TCG

  2013influential citation
• Application of Area Predicted TCG Algorithm in Floorplanning with Boundary Constraint

  2011cites this paper
• Performance-driven analog placement considering boundary constraint

  2010cites this paper
• New perspectives in VLSI design automation: deterministic packing by Sequence Pair

  2010cites this paper
• Modern Floorplanning with Boundary Clustering Constraint

  2009cites this paper
• VLSI Floorplanning with Boundary Constraints Based on Single-Sequence Representation

  2009cites this paper
• VLSI floorplanning with boundary constraints using generalized polish expression

  2006cites this paper
• Multi-bend bus driven floorplanning

  2005cites this paper
• Fixed-outline floorplanning with constraints through instance augmentation

  2005cites this paper
• A unified framework for generating all propagation functions for logic errors and events

  2004cites this paper
• Placement constraints in floorplan design

  2004cites this paper
• TCG-S: orthogonal coupling of P*-admissible representations for general floorplans

  2004cites this paper
• Analytical technique for macrocell placement optimization with multiple constraints

  2003cites this paper
• A simulated annealing approach with sequence-pair encoding using a penalty function for the placement problem with boundary constraints

  2003influential citation
• A Block Placement Algorithm with Predefined Coordinate Alignment Constraint Based on Sequence Pair Representation

  2003cites this paper
• Selected sequence-pair: an efficient decodable packing representation in linear time using sequence-pair

  2003cites this paper
• Non-slicing floorplans with boundary constraints using generalized Polish expression

  2003cites this paper
• Sequence-pair based placement with boundary constraints

  2002cites this paper
• TCG-S: orthogonal coupling of P/sup */-admissible representations for general floorplans

  2002cites this paper
• An efficient decoding method of sequence-pair

  2002cites this paper
• Module placement with boundary constraints using B*-trees

  2002influential citation
• Fundamental algorithms for physical design planning of VLSI

  2002cites this paper
• Module placement with boundary constraints using O-tree representation

  2002cites this paper
• Orthogonal Coupling of P-admissible Representations for Non-slicing Floorplans Track 1 . 1 : Placement and Floorplanning Techniques

  2001cites this paper
• VLSI/PCB placement with predefined coordinate alignment constraint based on sequence pair

  2001cites this paper