Institution
Xilinx
Company•San Jose, California, United States•
About: Xilinx is a company organization based out in San Jose, California, United States. It is known for research contribution in the topics: Programmable logic device & Integrated circuit. The organization has 2814 authors who have published 5275 publications receiving 91373 citations. The organization is also known as: Xilinx, Inc. & Xilinx (United States).
Topics: Programmable logic device, Integrated circuit, Field-programmable gate array, Signal, Circuit design
Papers published on a yearly basis
Papers
More filters
•
15 May 2000TL;DR: In this paper, a method for implementing a large multiplexer with FPGA lookup tables is presented, where logic that defines a multiplexers is detected and implemented according to the number of inputs and the target FPGAs architecture.
Abstract: A method for implementing a large multiplexer with FPGA lookup tables. Logic that defines a multiplexer is detected and implemented according to the number of inputs and the target FPGA architecture. In one situation, a large multiplexer is implemented in two stages. The first stage implements wide AND functions of each of the input signals using lookup tables and carry logic. In a second stage, the resulting decoded input signals are combined in a wide OR gate again formed from lookup tables and a carry chain. In another situation, the multiplexer is implemented as a tree structure using lookup tables that implement 2:1 multiplexers in combination with other 2:1 multiplexers provided by configurable logic blocks of the FPGA.
78 citations
••
01 Mar 1998TL;DR: A new FPGA architecture based on a patented, novel, segmented routing fabric that is targeted to high performance and predictability but does not sacrifice routability or area efficiency is discussed.
Abstract: In the development of new FPGA architectures, a designer must balance speed, density and routing flexibility. In this paper, we discuss a new FPGA architecture based on a patented [1], novel, segmented routing fabric that is targeted to high performance and predictability but does not sacrifice routability or area efficiency. Current segmented architectures allow much flexibility in routing, but incur large delay penalties when a signal has high fanout or must traverse medium to long distances to reach its target. Reducing the number of programmable interconnect points (PIPs) that a signal must traverse to reach its target, while eliminating the RC delay buildup due to signal fanout, improves design performance and offers highly predictable signal delays.
78 citations
•
26 Apr 1995TL;DR: In this article, a configurable logic array having logic functions which are programmed by loading memory cells which cause the logic array to generate a desired function is presented, where the memory cells can also be used as memory for access by other parts during operation.
Abstract: This invention provides additional circuitry for a configurable logic array having logic functions which are programmed by loading memory cells which cause the logic array to generate a desired function. With the additional circuitry, the memory cells can also be used as memory for access by other parts of the logic array during operation.
78 citations
•
13 Jun 2003TL;DR: In this paper, a computer implemented apparatus and method that automates the entry, modification, analysis, and generation of test benches from electrical circuits, both of which are specified as hardware description language (HDL) files.
Abstract: A computer implemented apparatus and method that automates the entry, modification, analysis, and generation of test benches from electrical circuits, both of which are specified as hardware description language (HDL) files. The computer implemented-method and apparatus also provides a unique mechanism that blends entry and display of timing requirements that must be met by the electric circuit.
77 citations
•
03 Apr 2000TL;DR: In this paper, the output pattern of a first instruction is compared to the input pattern of the second instruction, and if the input and output patterns do not match, then a pattern manipulation instruction is inserted between the first and second instructions.
Abstract: An FPGA configuration provides a virtual instruction. In a generic computation, the output pattern of a first instruction is compared to the input pattern of a second instruction. If the input and output patterns of the first and second instructions do not match, then a pattern manipulation instruction is inserted between the first and second instructions. At this point, the input and output patterns of the first and second instructions should match and the computation task can be completed. The method of providing virtual instructions is applicable to any FPGA. In a standard FPGA, the data stored in the storage elements of the FPGA, such as flip-flops, is retained for the next configuration of the FPGA. In this manner, successive configurations can communicate data using the patterns of the storage elements, thereby allowing standard FPGAs to implement virtual instructions. Alternatively, a standard FPGA could write out data to an external memory using a predetermined pattern of addresses. In a subsequent configuration of the FPGA, the device could read data back from this pattern of addresses in the external memory. This embodiment allows various patterns of addresses, corresponding to data, to be used in any appropriate subsequent configuration of the FPGA. In this manner, the plurality of memory planes, previously provided on the dynamically reconfigurable FPGA, can be implemented off-chip.
77 citations
Authors
Showing all 2816 results
Name | H-index | Papers | Citations |
---|---|---|---|
Jason Cong | 76 | 594 | 24773 |
Jonathan Rose | 58 | 187 | 15223 |
Ashutosh Sabharwal | 57 | 355 | 17926 |
Christoph Studer | 55 | 345 | 11694 |
Stephen M. Trimberger | 53 | 211 | 8806 |
Rodney Anthony Stewart | 51 | 313 | 7191 |
John C. McGrath | 49 | 291 | 13189 |
Sean A. Kelly | 48 | 93 | 11554 |
Song Han | 48 | 134 | 28364 |
Joseph R. Cavallaro | 44 | 374 | 7545 |
Krishna R. Narayanan | 44 | 269 | 6904 |
Farid N. Najm | 43 | 188 | 7530 |
Bernard J. New | 42 | 94 | 4562 |
Mehdi B. Tahoori | 41 | 394 | 6500 |
Steven P. Young | 38 | 181 | 5019 |