Abstract
In this paper we present a method that maps a loop-free multilevel combinational circuit into Look-Up Table (LUT) based Field Programmable Gate Arrays (FPGAs) using permissible functions. When mapping a minimized circuit into LUTs, a characteristic difference between an LUT and simple gates causes ineffective use of the LUT. Using permissible functions, the circuit is adroitly adapted for an LUT that has n inputs, one output, and can implement any n-variable Boolean function. We have implemented this method and carried out some experiments. Results show that this method is useful to refine initial mapping to LUTs.
Original language | English |
---|---|
Pages | 215-218 |
Number of pages | 4 |
Publication status | Published - 1996 |
Externally published | Yes |
Event | Proceedings of the 1996 9th International Conference on VLSI Design - Bangalore, India Duration: Jan 3 1996 → Jan 6 1996 |
Other
Other | Proceedings of the 1996 9th International Conference on VLSI Design |
---|---|
City | Bangalore, India |
Period | 1/3/96 → 1/6/96 |
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering