### Abstract

An initial circuit is partitioned into multi-field programmable gate arrays (FPGA) chips using an algorithm based on recursive bi-partitioning of a circuit. In each bipartitioning, the algorithm searches a partitioning position of a circuit such that each of the partitioned subcircuits is accommodated in each FPGA chip, making the number of signal nets between chips as small as possible. Experimental results show that it decreases the maximum number of I/O blocks per chip by a maximum of 49% compared with other conventional algorithms.

Original language | English |
---|---|

Pages (from-to) | 1765-1776 |

Number of pages | 12 |

Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |

Volume | E78-A |

Issue number | 12 |

Publication status | Published - 1995 Dec 1 |

### ASJC Scopus subject areas

- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Circuit partitioning algorithm with replication capability for multi-FPGA systems'. Together they form a unique fingerprint.

## Cite this

Togawa, N., Sato, M., & Ohtsuki, T. (1995). Circuit partitioning algorithm with replication capability for multi-FPGA systems.

*IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences*,*E78-A*(12), 1765-1776.