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

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 20, Issue 12, 2001, Pages 1406-1413

  Tang, Xiaoping ^b   Tian, Ruiqi ^b,c   Wong, D F ^a,b  

^a IEEE   (United States)

^b University of Texas at Austin   (United States)

^c MOTOROLA INC   (United States)

Author keywords

Block placement; Constraint graph; Floorplanning; Longest common subsequence; Sequence pair

Indexed keywords

SEQUENCE PAIRS;

ALGORITHMS; BENCHMARKING; COMPUTATION THEORY; CONSTRAINT THEORY; PROBLEM SOLVING; SIMULATED ANNEALING;

VLSI CIRCUITS;

EID: 0035670932     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.969434     Document Type: Article

References (17)

1. B*-trees: A new representation for nonslicing floorplans
2. An O-tree representation of nonslicing floorplans and its applications
3. A fast algorithm for computing longest common subsequences
4. A priority queue in which initialization and queue operations take O(log log D) time
5. Topology constrained rectilinear block packing for layout reuse
6. VLSI module placement based on rectangle-packing by the sequence pair
7. VLSI/PCB placement with obstacles based on sequence pair
8. Sequence-pair based placement method for hard/soft/pre-placed modules
9. Module placement on BSG-structure and IC layout applications
10. An enhanced perturbing algorithm for floorplan design using the O-tree representation
11. An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem
12. Design and implementation of an efficient priority queue
13. Rectilinear block placement using sequence pair