#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1979

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hiroshi Murata, Kunihiro Fujiyoshi, Shigetoshi Nakatake, Yoji Kajitani
- IEEE Trans. on CAD of Integrated Circuits and…
- 1996

The earliest and the most critical stage in VLSI layout design is the placement. The background of which is the rectangle packing problem: Given set of rectangular modules of arbitrary sizes, place them without overlap on a plane within a rectangle of minimum area. Since the variety of the packing is uncountably infinite, the key issue for successful… (More)

- Shigetoshi Nakatake, Kunihiro Fujiyoshi, Hiroshi Murata, Yoji Kajitani
- Proceedings of International Conference on…
- 1996

A new method of packing the rectangles (modules) is presented with applications to IC layout design. It is based on the bounded-sliceline grid (BSG) structure. The BSG dissects the plane into rooms associated with binary relations ``right-to''and ``above'' such that any two rooms are uniquely in either relation. A packing is obtained through an assignment… (More)

The first and the most critical stage in VLSI layout design is the placement, the background of which is the rectangle packing problem: Given many rectangular modules of arbitrary size, place them without overlapping on a layer in the smallest bounding rectangle. Since the variety of the packing is infinite (two- dimensionally continuous) many, the key… (More)

- Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
- Theor. Comput. Sci.
- 1991

This paper considers a mixed search game, which is a natural generalization of edge-search and node-search games extensively studied so far. We establish a relationship between the mixed-search number of a graph G and the proper-path-width of G introduced by the authors in a previous paper. We also prove complexity results.

- Shigetoshi Nakatake, Kunihiro Fujiyoshi, Hiroshi Murata, Yoji Kajitani
- IEEE Trans. on CAD of Integrated Circuits and…
- 1998

A new method of packing the rectangles is proposed with applications to integarted circuit (IC) layout design. A special work-sheet, called the bounded-sliceline grid, is introduced. It consists of special segments that dissect the plane into rooms to which binary relations “right-of”and “above” are associated such that any two rooms are uniquely in either… (More)

- Changwen Zhuang, Yoji Kajitani, Keishi Sakanushi, Liyan Jin
- DATE
- 2002

After the discussion on the difference between floorplanningand packing in VLSI placement design, this paperadapts the floorplanner that is based on the Q-sequence to apacking algorithm. For the purpose, some empty room insertionis required to guarantee not to miss the optimum packing.To increase the performance in packing, a new move that perturbsthe… (More)

- Shuichi Ueno, Yoji Kajitani, Shin'ya Gotoh
- Discrete Mathematics
- 1988

A floorplan of a bounding box is its dissection into rectangles (rooms) by horizontal and vertical segments. This paper proposes a string data structure called the Quarter-state sequence (or Q sequence) to represent the floorplan. The Q sequence is a concatenation of the states of rooms along the Abe order and is related to the VH graph, which is the union… (More)

- Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
- Discrete Mathematics
- 1994

- Atsushi Takahashi, Yoji Kajitani
- ASP-DAC
- 1997

| It is known that the clock-period in a sequential circuit can be shorter than the maximum signal delay between registers if the clock arrival time to each register is controlled. We propose an algorithm to nd the minimum clock-period of a circuit whose signal propagation delays are given. Experimental results on LGSynth93 benchmarks show that this… (More)