By Topic

Input-driven partitioning methods and application to synthesis on table-lookup-based FPGAs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
P. Abouzeid ; Inst. Nat. Polytech. de Grenoble, France ; B. Babba ; M. Crastes de Paulet ; G. Saucier

A synthesis approach for a set of Boolean functions on table-lookup-based field programmable gate arrays is proposed. Synthesis is considered as a global problem and, therefore, includes suitable factorization techniques as well as decomposition methods relying on the factored form. The factorization step looks for lexicographical expressions of Boolean functions. Some trade-offs between a strict input-driven decomposition and a maximal cell filling strategy are presented. The approach is applied to the Xilinx XC3000 and XC4000 series. Decomposition techniques both for area and speed optimization are detailed and their performance is compared to all available performance results

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:12 ,  Issue: 7 )