In the wafer production process, cost is an important factor. Due to the requirement of different chips, different dice arrangements are needed to generate these chips.
This study proposes a placement and cut algorithm suitable for the dicing plan. Besides the best locations, this study considers the best cut to decrease production cost by decreasing the slicing collision chances in a dicing plan. A hierarchical algorithm is used for placement and cut algorithm. Firstly, initialize the location for different chips to simplify the input. Secondly, use slicing tree for the arrangement of the chip placement with the minimum cut. A simulated annealing algorithm combined with a vertical and horizontal conflict and coloring theorem are used to optimize the placement and cut for wafer floor plan.
In the cutting conflict decision period of coloring algorithm (used as an objective function of the SA algorithm), two different methods are compared. The first one considers enumeration of the width and height of each chip to decide if they conflict with each other. The other uses a segment tree data structure to decrease the computation time. The second method not only out performs the first one in run time but also shows an intuitively reasonable cut results that maximize the chip number.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com