A simultaneous technology mapping, placement, and global routing algorithm for field-programmable gate arrays

  • Authors:
  • Nozomu Togawa;Masao Sato;Tatsuo Ohtsuki

  • Affiliations:
  • Dept. of Electronics and Communication Engineering, Waseda University, 3-4-1 Okubo, Shinjuku, Tokyo 169, Japan;Dept. of Electronics and Communication Engineering, Waseda University, 3-4-1 Okubo, Shinjuku, Tokyo 169, Japan;Dept. of Electronics and Communication Engineering, Waseda University, 3-4-1 Okubo, Shinjuku, Tokyo 169, Japan

  • Venue:
  • ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

Technology mapping algorithms for LUT (Look Up Table) based FPGAs have been proposed to transfer a Boolean network into logic-blocks. However, since those algorithms take no layout information into account, they do not always lead to excellent results. In this paper, a simultaneous technology mapping, placement and global routing algorithm for FPGAs, Maple, is presented. Mapleis an extended version of a simultaneous placement and global routing algorithm for FPGAs, which is based on recursive partition of layout regions and block sets. Maple inherits its basic processes and executes the technology mapping simultaneously in each recursive process. Therefore, the mapping can be done with the placement and global routing information. Experimental results for some benchmark circuits demonstrate its efficiency and effectiveness.