Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 220,830,729 papers from all fields of science
Search
Sign In
Create Free Account
Field-programmable gate array
Known as:
Field programmable logic array
, Programmable gate array
, Fpga
Expand
A field-programmable gate array (FPGA) is an integrated circuit designed to be configured by a customer or a designer after manufacturing – hence…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ARM Cortex-A9
Air-Cobot
Antifuse
Application-specific integrated circuit
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Activity Estimation for Field-Programmable Gate Arrays
J. Lamoureux
,
S. Wilton
International Conference on Field-Programmable…
2006
Corpus ID: 602740
This paper examines various activity estimation techniques in order to determine which are most appropriate for use in the…
Expand
Highly Cited
2001
Highly Cited
2001
Implementing a fuzzy system on a field programmable gate array
Michael McKenna
,
B. Wilamowski
IJCNN'01. International Joint Conference on…
2001
Corpus ID: 1689414
Fuzzy controllers are traditionally implemented in a microprocessor and they produce relatively raw surfaces. The purpose of this…
Expand
Highly Cited
2001
Highly Cited
2001
Compiling occam into Field-Programmable Gate Arrays
I. Page
2001
Corpus ID: 3832635
We describe a compiler which maps programs expressed in a subset of occam into netlist descriptions of parallel hardware. Using…
Expand
Highly Cited
2001
Highly Cited
2001
Secure configuration of Field Programmable Gate arrays
T. Kean
2001
Corpus ID: 195711067
Although SRAM programmed Field Programmable Gate Arrays (FPGA's) have come to dominate the industry due to their density and…
Expand
Highly Cited
2000
Highly Cited
2000
Field-Programmable Gate Arrays
Saburo Muroga
The VLSI Handbook
2000
Corpus ID: 42218387
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement…
Expand
Highly Cited
1996
Highly Cited
1996
An approach for testing programmable/configurable field programmable gate arrays
Wei-Kang Huang
,
F. Lombardi
Proceedings of 14th VLSI Test Symposium
1996
Corpus ID: 41079027
This paper presents a new general technique for testing field programmable gate arrays (FPGAs) by fully exploiting their…
Expand
Highly Cited
1995
Highly Cited
1995
Universal test complexity of field-programmable gate arrays
Tomoo Inoue
,
H. Fujiwara
,
H. Michinishi
,
T. Yokohira
,
T. Okamoto
Proceedings of the Fourth Asian Test Symposium
1995
Corpus ID: 34259772
A field-programmable gate array (FPGA) can implement arbitrary logic circuits in the field. In this paper we consider universal…
Expand
Highly Cited
1995
Highly Cited
1995
Three-dimensional field-programmable gate arrays
M. J. Alexander
,
J. Cohoon
,
Jared L. Colflesh
,
John Karro
,
Gabriel Robins
Proceedings of Eighth International Application…
1995
Corpus ID: 8100186
Motivated by improving FPGA performance, we propose a new three-dimensional (3D) FPGA architecture, along with a fabrication…
Expand
Highly Cited
1994
Highly Cited
1994
An Optoelectronic 3-D Field Programmable Gate Array
J. Depreitere
,
H. Neefs
,
+5 authors
I. Veretennicoff
International Conference on Field-Programmable…
1994
Corpus ID: 45284503
Traditional Field-Programmable Gate Arrays suffer from a lack of routing resources when implementing complex logic designs. This…
Expand
Highly Cited
1991
Highly Cited
1991
Xmap: a technology mapper for table-lookup field-programmable gate arrays
K. Karplus
28th ACM/IEEE Design Automation Conference
1991
Corpus ID: 7054577
Conversion from BLIF to If-then-else DAGS This paper presents a new algorithm, Xmap, for doing mapping from multi-level logic to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE