Presentation 2001/5/11
Selected Sequence-Pair
Chikaaki KODAMA, Kunihiro FUJIYOSHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose "selected sequence-pair", sequence-pair with limited number of adjacent cross. The feature of selected sequence-pair is that it can represent any rectangle packing similarly as sequence-pair can. Then we propose the algorithm to convert, in linear time, sequence-pair without. adjacent cross to Q-sequence which is a recently proposed method to represent. rectangular dissection. We improve this algorithm to another one which can enumerate all adjacent crosses on selected sequence-pair in linear time and show that we can obtain the packing under the HV-constraints of selected sequence-pair in linear time by combining these algorithms and conventional methods.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) sequence-pair / packing / adjacent / cross / Q-sequence
Paper # VLD2001-17
Date of Issue

Conference Information
Committee VLD
Conference Date 2001/5/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To VLSI Design Technologies (VLD)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Selected Sequence-Pair
Sub Title (in English)
Keyword(1) sequence-pair
Keyword(2) packing
Keyword(3) adjacent
Keyword(4) cross
Keyword(5) Q-sequence
1st Author's Name Chikaaki KODAMA
1st Author's Affiliation Fujitsu LTD.()
2nd Author's Name Kunihiro FUJIYOSHI
2nd Author's Affiliation Department of Electrical and Electronic Engineering Tokyo University of Agriculture & Technology
Date 2001/5/11
Paper # VLD2001-17
Volume (vol) vol.101
Number (no) 46
Page pp.pp.-
#Pages 8
Date of Issue