Selected sequence-pair: An efficient decodable packing representation in linear time using sequence-pair

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 2003-January, Issue , 2003, Pages 331-337

  Kodama, C ^a   Fujiyoshi, K ^a  

^a TOKYO UNIVERSITY OF AGRICULTURE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DISSECTION; SIMULATED ANNEALING;

ADJACENT SOLUTION; CONVENTIONAL METHODS; EMPTY ROOMS; LINEAR TIME; Q SEQUENCE; RECTANGULAR DISSECTION; SELECTED SEQUENCE PAIRS; SEQUENCE PAIR;

COMPUTER AIDED DESIGN;

EID: 4344684112     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2003.1195037     Document Type: Conference Paper

References (19)

1. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani: "Rectangle-packing-based module placement," in IEEE ICCAD, pp.472-479, 1995.
2. H. Murata, K. Fujiyoshi, and M. Kaneko: "VLSI/PCB placement with obstacles based on sequence pair," IEEE Trans. CAD. vol. 17, no.1, pp.60-68, 1998.
3. K. Fujiyoshi, and H. Murata: "Arbitrary convex and concave rectilinear block packing using sequence-pair," IEEE Trans. CAD, vol. 19, no.2, pp.224-233, 2000.
4. T. Takahashi: "An algorithm for finding a maximum weight decreasing sequence in a permutation, motivated by rectangle packing problem," Technical Report IEICE, VLD96-30, pp.31-35, 1996 (in Japanese).
5. X. Tang, R. Tian and D.F. Wong: "Fast evaluation of sequence pair in block placement by longest common subsequence computation" IEEE Trans. CAD, vol.20, no.12, pp. 1406-1413, 2001.
6. J. Lai, M.-S. Lin, T.-C. Wang, and Li-C. Wang: "Module placement with boundary constraints using the sequence-pair representation," in IEEE ASP-DAC, pp.515-520, 2001.
7. H. Murata, K. Fujiyoshi, T. Watanabe, and Y. Kajitani: "A mapping from sequence-pair to rectangular dissection," in IEEE ASP-DAC, pp.625-633, 1997.
8. K. Kiyota, K. Fujiyoshi: "Simulated annealing search though general structure floorplans using sequence-pair," in IEEE ISCAS, pp.III-77-III-80, 2000.
9. K. Sakanushi, and Y. Kajitani, "Counting of the topological dissections by reduct-seq representation," Technical Report IEICE, COMP2000-17, pp.25-32, 2000.
10. K. Sakanushi and Y. Kajitani, "The quarter-state sequence (Q-sequence) to represent the floorplan and applications to layout optimization," in IEEE APCCAS, pp.829-832, 2000.
11. C. Kodama and K. Fujiyoshi: "Selected sequence-pair," Technical Report IEICE, VLD2001-17, pp.65-72, May, 2001 (in Japanese).
12. M. Tsuboi, C. Kodama, K. Sakanushi, K. Fujiyoshi and A. Takahashi "Linear time decodable rectangular dissection to represent arbitrary packing using Q-sequence," in SASIMI, pp.272-278, Oct., 2001.
13. Y. Takashima and H. Murata: "The tight upper bound of the empty rooms in floorplan," in SASIMI, pp.264-271, Oct., 2001.
14. C. Zhuang, K. Sakanushi, L. Jin and Y. Kajitani: "An enhanced Q-sequence augmented with essential empty room insertions and parenthesis trees," in DATE, pp.61-68, Mar., 2002.
15. C. Kodama and K. Fujiyoshi: "An efficient decoding method of sequence-pair," in IEEE APCCAS, vol.2, pp. 131-136, Oct., 2002.
16. C. Kodama and K. Fujiyoshi: "An efficient decoding method of sequence-pair with reduced redundancy," IEICE Trans. Fundamentals, vol.E85-A, no.12, pp.2785-2794, Dec., 2002.
17. K. Fujiyoshi, C. Kodama and K. Kiyota: "An effective MOVE operation for selected sequence-pair," Technical Report IEICE, VLD2002-6. pp.31-36, May, 2002 (in Japanese).
18. L. Stockmeyer: "Optimal orientations of cells in slicing floorplan designs," Info.and Control, vol.57, pp.91-101, 1983.
19. T. Ohtsuki, N. Suzigama and H. Hawanishi: "An optimization technique for integrated circuit layout design." Proc. of ICCST, pp.67-68, 1970.