By Topic

Multi-Way System Partitioning into a Single Type or Multiple Types of FPGAs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. J. -H. Huang ; UCLA Computer Science Department, Los Angeles, CA ; A. B. Kahng

This paper considers the problem of partitioning a circuit into a collection of subcircuits, such that each subcircuit is feasible for some device from an FPGA library, and the total cost of devices is minimized. We propose a three-phase heuristic that uses ordering, clustering, and dynamic programming to achieve good solutions. Experimental comparisons are made with the previous methods of [Circuit Partitioning for Huge Logic Emulation Systems][Cost Minimization of Partitions into Multiple Devices].

Published in:

Field-Programmable Gate Arrays, 1995. FPGA '95. Proceedings of the Third International ACM Symposium on

Date of Conference: