A VARIABLE PARTITIONING ALGORITHM OF BDD FOR FPGA TECHNOLOGY MAPPING

Citation
Jh. Jiang et al., A VARIABLE PARTITIONING ALGORITHM OF BDD FOR FPGA TECHNOLOGY MAPPING, IEICE transactions on fundamentals of electronics, communications and computer science, E80A(10), 1997, pp. 1813-1819
Citations number
23
Categorie Soggetti
Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture","Computer Science Information Systems
ISSN journal
09168508
Volume
E80A
Issue
10
Year of publication
1997
Pages
1813 - 1819
Database
ISI
SICI code
0916-8508(1997)E80A:10<1813:AVPAOB>2.0.ZU;2-#
Abstract
Field Programmable Gate Arrays (FPGA's) are important devices for rapi d system prototyping. Roth-Karp decomposition is one of the most popul ar decomposition techniques for Look-Up Table (LUT)-based FPGA technol ogy mapping. In this paper, we propose a novel algorithm based on Bina ry Decision Diagrams (BDD's) for selecting good lambda set variables i n Roth-Karp decomposition to minimize the number of consumed configura ble logic blocks (CLB's) in FPGA's. The experimental results on a set of benchmarks show that our algorithm can produce much better results than the similar works of the previous approaches [1], [4].