By Topic

An algorithm for mapping non-complete binary trees to cellular architecture 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

2 Author(s)
B. T. Drucker ; Dept. of Electr. Eng., Portland State Univ., OR, USA ; M. Chrzanowska-Jeske

With the emergence of deep-submicron fabrication processes, routing is fast surpassing logic as the most important factor in total circuit area and speed. Accordingly, mapping algorithms are needed which can efficiently control critical path length. Our method minimizes critical paths while embedding single-output switching functions to cellular-architecture arrays. We use binary trees to represent functions and target a generic square cell array similar to architectures of Atmel AT6 and Xilinx 6200 FPGAs. We compare our mapping results with other approaches for several MCNC benchmarks. For non-complete trees, longest paths of most circuits are within 2× the path lengths of the original trees, and on average 17 to 32 percent better than other approaches.

Published in:

Circuits and Systems, 1997. Proceedings of the 40th Midwest Symposium on  (Volume:2 )

Date of Conference:

3-6 Aug. 1997