%0 Journal Article
	%A Jae Young Park and  Soongyu Kwon and  Kyu Han Kim and  Hyeong Geon Lee and  Jong Tae Kim
	%D 2012
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 62, 2012
	%T Low Cost Chip Set Selection Algorithm for Multi-way Partitioning of Digital System
	%U https://publications.waset.org/pdf/7406
	%V 62
	%X This paper considers the problem of finding low cost
chip set for a minimum cost partitioning of a large logic circuits. Chip
sets are selected from a given library. Each chip in the library has a
different price, area, and I/O pin. We propose a low cost chip set
selection algorithm. Inputs to the algorithm are a netlist and a chip
information in the library. Output is a list of chip sets satisfied with
area and maximum partitioning number and it is sorted by cost. The
algorithm finds the sorted list of chip sets from minimum cost to
maximum cost. We used MCNC benchmark circuits for experiments.
The experimental results show that all of chip sets found satisfy the
multiple partitioning constraints.
	%P 145 - 147