A compacter takes as input a VLSI layout and produces as output an equivalent layout of smaller area. An effective compaction system frees the designer from the details of the design rules, and hence, increases his or her productivity and on the other hand produces high quality layouts. A general framework for compaction on a torus is introduced. This problem comes up whenever an array of identical cells has to compacted. The framework is instantiated by several specific compaction algorithms: one-dimensional compaction without and with automatic job insertion and two-dimensional compaction
Symbolic layout and layout compaction are closely related topics. Symbolic layout captures more of a...
Memory compaction is a technique for reclaiming cells containing garbage that are scattered over the...
A new method of compaction for VLSI circuits is presented. Compaction is done simultaneously in two ...
A compacter takes as input a VLSI layout and produces as output an equivalent layout of smaller area...
A compacter takes as input a VLSI layout and produces as output an equivalent layout of smaller are...
This paper presents a survey and a taxonomy of layout compaction algorithms, which are an essential ...
In this paper, a new incremental algorithm for layout compaction is proposed. In addition to its lin...
The work of F.M. Maley (Proc. Chapel Hill Conf. on VLSI, p.261-83, 1985) on one-dimensional compacti...
SIGLETIB: RO 1829 (1985,8) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Information...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1984. Simultaneously published ...
Partial reconfiguration allows parts of the reconfigurable chip area to be configured without affect...
This paper describes a new approach for IC layout and compaction. The compaction problem is translat...
In this paper we study the two-dimensional compaction of integrated circuit layouts. A curvilinear r...
The efficiency of a symbolic compactor is closely related to the quality of the physical layout prod...
AbstractIn this paper we consider the 1-dimensional compaction problem when the layout area contains...
Symbolic layout and layout compaction are closely related topics. Symbolic layout captures more of a...
Memory compaction is a technique for reclaiming cells containing garbage that are scattered over the...
A new method of compaction for VLSI circuits is presented. Compaction is done simultaneously in two ...
A compacter takes as input a VLSI layout and produces as output an equivalent layout of smaller area...
A compacter takes as input a VLSI layout and produces as output an equivalent layout of smaller are...
This paper presents a survey and a taxonomy of layout compaction algorithms, which are an essential ...
In this paper, a new incremental algorithm for layout compaction is proposed. In addition to its lin...
The work of F.M. Maley (Proc. Chapel Hill Conf. on VLSI, p.261-83, 1985) on one-dimensional compacti...
SIGLETIB: RO 1829 (1985,8) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Information...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1984. Simultaneously published ...
Partial reconfiguration allows parts of the reconfigurable chip area to be configured without affect...
This paper describes a new approach for IC layout and compaction. The compaction problem is translat...
In this paper we study the two-dimensional compaction of integrated circuit layouts. A curvilinear r...
The efficiency of a symbolic compactor is closely related to the quality of the physical layout prod...
AbstractIn this paper we consider the 1-dimensional compaction problem when the layout area contains...
Symbolic layout and layout compaction are closely related topics. Symbolic layout captures more of a...
Memory compaction is a technique for reclaiming cells containing garbage that are scattered over the...
A new method of compaction for VLSI circuits is presented. Compaction is done simultaneously in two ...