By Topic

Technology mapping algorithm for heterogeneous field programmable gate arrays

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
$31 $31
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

2 Author(s)
Lai, Y.-T. ; Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan ; Kao, C.-C.

To maximise device utilisation, a heterogeneous field programmable gate array (FPGA) provides either an array of homogeneous lookup tables (LUTs) of different sizes or an array of physically heterogeneous LUTs. It is shown that heterogeneous FPGAs have a significant number of desirable attributes. A technology mapping algorithm is proposed for heterogeneous FPGAs. The technology mapping problem is first formulated as a flow network problem. Then, an algorithm based on the min-cost max-flow algorithm is presented to select a proper set of feasible LUTs for various objectives. Two objectives: (i) the minimum number of LUTs; and (ii) the total area composed of LUTs and routing area are discussed. The algorithm is tested on the MCNC benchmark circuits and produces better characteristics than existing LUT based FPGA mapping algorithms.

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:149 ,  Issue: 6 )