By Topic

The circuit designs of an SRAM based look-up table for high performance FPGA architecture

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

3 Author(s)
Mal, P. ; Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH, USA ; Cantin, J.F. ; Beyette, F.R., Jr.

Look-up table (LUT) circuits are the core component of all Field Programmable Gate Arrays (FPGA's) architectures. Although considerable research has been done regarding the high-level architecture of different LUT's, very little has been done on the circuit-level description of the LUT. Though traditional LUT designs use NMOS transistors to implement pass-gates that save area and increase speed, large LUT designs require several pass gates in series. Unfortunately, multiple pass transistors in series will degrade the logic high level and thus jeopardize signal integrity. This paper explores different circuit-level implementations of the LUT circuitry with consideration towards the relative design trade-offs.

Published in:

Circuits and Systems, 2002. MWSCAS-2002. The 2002 45th Midwest Symposium on  (Volume:3 )

Date of Conference:

4-7 Aug. 2002