LOGIC SYNTHESIS FOR FIELD-PROGRAMMABLE GATE ARRAYS

Citation
Tt. Hwang et al., LOGIC SYNTHESIS FOR FIELD-PROGRAMMABLE GATE ARRAYS, IEEE transactions on computer-aided design of integrated circuits and systems, 13(10), 1994, pp. 1280-1287
Citations number
21
Categorie Soggetti
Computer Application, Chemistry & Engineering","Computer Science Hardware & Architecture
ISSN journal
02780070
Volume
13
Issue
10
Year of publication
1994
Pages
1280 - 1287
Database
ISI
SICI code
0278-0070(1994)13:10<1280:LSFFGA>2.0.ZU;2-5
Abstract
In this paper, we consider the problem of configuring Field Programmab le Gate Arrays (FPGA's) so that some given function is computed by the device. Obtaining the information necessary to configure a FPGA entai ls both logic synthesis and logic embedding. Due to the very constrain ed nature of the embedding process, this problem differs from traditio nal multilevel logic synthesis in that the structure (or lack thereof) of the synthesized logic is much more important. Furthermore, a metri c-like literal count is much less important. We present a communicatio n complexity-based decomposition technique that appears to be more sui table for FPGA synthesis than other multilevel logic synthesis methods . The key is that our logic optimization technique based on reducing c ommunication complexity is good enough to allow a simple technology ma pping to work well for FPGA devices.