
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Technology Mapping for FPGAs with Composite Logic Block Architectures
HsienHo CHUANG C. Bernard SHUNG
Publication
IEICE TRANSACTIONS on Information and Systems
Vol.E79D
No.10
pp.13961404 Publication Date: 1996/10/25 Online ISSN:
DOI: Print ISSN: 09168532 Type of Manuscript: Special Section PAPER (Special Issue on Synthesis and Verification of Hardware Design) Category: Logic Synthesis Keyword: technology mapping, FPGA, subject graph, pattern graph,
Full Text: PDF(730.8KB)>>
Summary:
A new technology mapping algorithm is developed on a general model of FPGA with composite logic block architectures, consisting of different sizes of lookup tables (LUTs) and possibly different logic gates. In additions, the logic blocks may have hardwired connections and limit accessible fanouts. Xilinx XC4000 is one example containing LUTs of different sizes and AT&T ORCA is another example containing both LUTs and logic gates. We use a multiplefanout pattern graph library to model the composite logic block and a premapping technique to generate the subject graph dynamically. A new matching algorithm and a new covering algorithm are also developed for the subject graph covering. The experimental results show that our algorithm is an effective technology mapper for FPGAs with composite logic block architectures, especially for larger circuits. Over a set of MCNC benchmarks, our algorithm requires on the average 4.25% fewer CLBs than PPR, 6.79% fewer CLBs than TEMPT, and 2,79% fewer CLBs than ASYL when used as the XC4000 mapper. Over a set of larger benchmarks, our algorithm outperforms PPR by 13.70%. Very encouraging results were obtained when our algorithm is used as an ORCA mapper, while there was no prior published results.

