Download:
|
by Zeljko Zilic, Zvonko G. Vranesic
Proceedings of ACM/SIGDA FPGA-96
http://www.eecg.toronto.edu/~zeljko/ulmlong.ps.Z
Add To MetaCart
Abstract:
Many modern FPGAs use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. Since permutations and negation of signals are virtually costless operations in FPGAs, it is possible to employ logic blocks that realize only a subset of all functions, while the rest can be obtained by permuting and negating the inputs. Such blocks, known as Universal Logic Modules (ULMs), have only recently been considered for application in FPGAs. In this paper we propose a class of ULMs useful in the FPGA environment. Methodology for systematic development of such blocks is presented, based on BDD description of logic functions. We give an explicit construction of a 3-input LUT replacement that requires only 5 programming bits, which is the optimum for such ULMs. A realistic size 4-input LUT replacement is obtained which uses 13 programming bits. Such logic blocks are especially important when FPGAs are used in a reconfigurable manner, because they can reduce the time and memory needed for changing the configuration.
Citations
|
22
|
A time-multiplexed fpga architecture for logic emulation
– Jones, Lewis
- 1995
|
|
19
|
A rst generation dpga implementation
– Tau, Eslick, et al.
- 1995
|
|
19
|
Boolean matching using generalized Reed-Muller forms
– Tsai, Marek-Sadowska
- 1994
|
|
17
|
Sentovich et al, "SIS: A System for Sequential Circuit Analysis
– M
- 1992
|
|
13
|
Optimum and suboptimum algorithms for input encoding and its relationship to logic minimization
– Yang, Ciesielski
- 1991
|
|
11
|
On designing ULM-based FPGA logic modules
– Thakur, Wong
- 1995
|
|
9
|
Universal logic gate for FPGA design
– Lin, Marek-Sadowska, et al.
- 1994
|
|
3
|
Graph-Based Methods for Boolean Function Manipulation
– Bryant
- 1986
|
|
3
|
A high-speedFPGA using programmable minitiles
– Chow, Seo, et al.
- 1993
|
|
2
|
Results of the Synthesis of Optimal Networks of AND and OR Gates for FourVariable Switching Functions
– Culliney, Young, et al.
- 1979
|
|
2
|
Counting Theorems and their Applications to Classification of Switching Functions", Recent Developments in Switching Theory, edited by Amar Mukhopadhyay
– Harrison
- 1971
|
|
1
|
Configurable Logic Design and Application Book
– Corporation
- 1995
|
|
1
|
Design Rules for CMC 0.8-micron BiCMOS, a Version of BATMOS
– Research
- 1993
|
|
1
|
Universal Logic Modules", Recent Developments in Switching Theory, edited by Amar Mukhopadhyay
– Stone
- 1971
|
