1999 Fiscal Year Final Research Report Summary
Study of the implementation method for Newral Network Argoritm with a Multi-Context Dynamically Reconfigurable FPGA
| Project/Area Number |
09680338
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Osaka University |
|---|
Principal Investigator |
KITAMICHI Junji Graduate School of Engineering Science, Osaka University, Tutor, 情報処理教育センター, 講師 (20234271)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
HIGASHINO Teruo Graduate School of Engineering Science, Osaka University, Professor, 大学院・基礎工学研究科, 教授 (80173144)
FUNABIKI Nobuo Graduate School of Engineering Science, Osaka University, Assistant Professor, 大学院・基礎工学研究科, 助教授 (70263225)
|
|---|
| Project Period (FY) |
1997 – 1999
|
| Keywords | Dynamically Reconfigurable Logic / Multi Context / FPGA / Simulated Annealing / Greedy / Partition / CAD / Neural Network |
|---|
| Research Abstract |
In this study, We propose an implementation method of a Multi-Context Dynamically Reconfigurable FPGA and a CAD algorithm for optimal use of it. Multi-Context Dynamically Reconfigurable FPGA is a VLSI which can be programmed during system operation with better reconfiguration time-efficiency than conventional Reconfigurable FPGA. We evaluated the hardware cost to add the Multi-Context Dynamically Reconfigurable FPGA by the result of synthesis of the hardware description of the Multi-Context Dynamically Reconfigurable FPGA. And We also evaluated the improvement of CLB (Configurable Logic Block) or bus usage by the implementation of the Neural Network Algorithm compared with conventional Reconfigurable FPGA. The CAD algorithm for Multi-Context FPGA minimizes reconfiguration time overhead proportional to the amount of the reconfiguration data. It inputs a finite state machine and outputs subsets of states called pages which is a reconfiguration unit of Multi-Context FPGA. The performance of the proposed algorithm is demonstrated experimentally.
|
