ACM Home Page
Please provide us with feedback. Feedback
On designing ULM-based FPGA logic modules
Full text PdfPdf (243 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays table of contents
Monterey, California, United States
Pages: 3 - 9  
Year of Publication: 1995
ISBN:0-89791-743-X
Authors
Shashidhar Thakur  Department of Computer Sciences, University of Texas at Austin
D. F. Wong  Department of Computer Sciences, University of Texas at Austin
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/201310.201311
What is a DOI?

ABSTRACT

In this paper, we give a method to design FPGA logic modules, based on an extension of classical work on designing Universal Logic Modules (ULM). Specifically, we give a technique to design a class of logic modules that specialize to a large number of functions under complementations and permutations of inputs, bridging of inputs and assignment of 0/1 to inputs. Thus, a lot of functions can be implemented using a single logic module. The significance of our work lies in our ability to generate a large set of such logic modules. A choice can be made from this set based on design criteria. We demonstrate the technique by generating a set of 471 8-input functions that have a much higher coverage than the 8-input cells employed by Actel's FP-GAs. Our functions can specialize to up to 23 times the number of functions that Actel functions can. We also show that by carefully optimizing these functions one can obtain multi-level implementations of them that have delays within 10% of the delays of Actel modules. We demonstrates the effectiveness of these modules in mapping benchmark circuits. We observed a 16% reduction in area and a 21% reduction in delay using our logic modules instead of Actel's on these circuits.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
X. Chen and X. Wu. Derivation of universal logic modules, for n > 3, by algebraic means. IEE Proc., 128(5):205-211, September 1981.
2
 
3
E.M. Sentovich et al. SIS' A system for sequential circuit synthesis. Technical Report UCB/ERL M92/41, Dept. of Electrical Engg. and Computer Science, Univ. of California, Berkeley, CA 94720, 1992.
 
4
K. Keutzer. Impact of library size on the quality of automated synthesis. In Proceedings of ICCAD, pages 120-123. ACM/IEEE, 1990.
 
5
 
6
F. Mailhot and G. De Micheli. Algorithms for technology mapping based on binary decision diagrams and on Boolean operations. IEEE Trans. CAD/ICAS, 12(5)'599-620, May 1993.
 
7
J. Mohnke and S. Malik. Permutation and phase independent Boolean comparison. In Proceedings of EDAC, 1993.
 
8
F. P. Preparata and D.E. Muller. Generation of near-optimal universal boolean functions. JCCS, 4:93-102, April 1970.
 
9

CITED BY  9
 
 

Collaborative Colleagues:
Shashidhar Thakur: colleagues
D. F. Wong: colleagues

Peer to Peer - Readers of this Article have also read: