Sciweavers

FPGA
1998
ACM

Boolean Matching for Complex PLBs in LUT-based FPGAs with Application to Architecture Evaluation

13 years 7 months ago
Boolean Matching for Complex PLBs in LUT-based FPGAs with Application to Architecture Evaluation
In this paper, we developed Boolean matching techniques for complex programmable logic blocks (PLBs) in LUT-based FPGAs. A complex PLB can not only be used as a K-input LUT, but also can implement some wide functions of more than K variables. We apply previous and develop new functional decomposition methods to match wide functions to PLBs. We can determine exactly whether a given wide function can be implemented with a XC4000 CLB or other three PLB architectures (including the XC5200 CLB). We evaluate functional capabilities of the four PLB architectures on implementing wide functions in MCNC benchmarks. Experiments show that the XC4000 CLB can be used to implement up to 98% of 6-cuts and 88% of 7-cuts in MCNC benchmarks, while two of the other three PLB architectures have a smaller cost in terms of logic capability per silicon area. Our results are useful for designing future logic unit architectures in LUT based FPGAs.
Jason Cong, Yean-Yow Hwang
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where FPGA
Authors Jason Cong, Yean-Yow Hwang
Comments (0)