Clustering and partitioning techniques for field-programmable gate arrays
By: by Mehrdad Eslami Dehkordi.
Published: 2006
Language: eng
Number of pages: 152
ISBN-13: 9780494157909
Description: This dissertation consists of two major parts: first, we investigate the circuit clustering problem applicable to hierarchical FPGAs. We propose algorithms for single and multi-level clustering with strategies to reduce the area increase due to node duplication inherent in clustering algorithms. We present clustering algorithms for both combinational and sequential circuits and integrate retiming techniques in our sequential clustering algorithm.The second part of the thesis focuses on a modular partitioning technique for FPGAs. In the modular partitioning framework a circuit is partitioned into groups of modules using the modules on the design hierarchy tree. These partitions then can be used in an incremental design flow for compile time reduction. The idea behind the incremental design flow is to use the compiler information for the partitions in case a part of the design is changed. In case of a change, the previous compiler information for the partitions that correspond to the unchanged parts of the design will be used in the new compilation and only partitions corresponding to the modified portions of the design will be recompiled. This will result in significant compile time reduction. While the main objective of such partitioning is compile time reduction, other features of the design like circuit speed and area should not be degraded after the partitioning process. Experiments show that our proposed partitioning algorithm results in partitioning solution with more than 50% compile time saving for a set of real industrial circuits. This is achieved without any performance degradation.
Notes: Source: Dissertation Abstracts International, Volume: 67-06, Section: B, page: 3323.

Advisor: Stephen Brown.

Thesis (Ph.D.)--University of Toronto, 2006.

Includes bibliographic references.

Electronic version licensed for access by U. of T. users.