Cart (Loading....) | Create Account
Close category search window
 

AATMA: an algorithm for technology mapping for antifuse-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
$31 $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)
Mehendale, M. ; Texas Instrum. (India) Pvt. Ltd., Bangalore, India ; Ram Prasad, M.K.

The paper presents AATMA: a technology mapping algorithm for antifuse based FPGAs. The algorithm is independent of the logic module structure. It can handle large libraries with complex functions and uses a signature-matching based approach to achieve high mapping quality and shorter execution times. This makes it a powerful tool not only for mapping designs onto a logic module but also for the design and evaluation of antifuse-based FPGA logic module architectures. The details of the overall algorithm along with the signature matching technique are presented. The experimental results show that AATMA needs upto 15-20% fewer logic modules than MISII and is upto 15 to 20 times faster

Published in:

VLSI Design, 1995., Proceedings of the 8th International Conference on

Date of Conference:

4-7 Jan 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.