FPGA
1998
ACM
13 years 9 months ago
1998
ACM
It has become clear that large embedded con gurable memory arrays will be essential in future FPGAs. Embedded arrays provide high-density high-speed implementations of the storage...
FPGA
1998
ACM
13 years 9 months ago
1998
ACM
FPGA
1998
ACM
13 years 9 months ago
1998
ACM
In designing FPGAs, it is important to achieve a good balance between the number of logic blocks, such as Look-Up Tables (LUTs), and wiring resources. It is dicult to nd an optim...
FPGA
1998
ACM
13 years 9 months ago
1998
ACM
Three factors are driving the demand for rapid FPGA compilation. First, as FPGAs have grown in logic capacity, the compile computation has grown more quickly than the compute powe...
FPGA
1998
ACM
13 years 9 months ago
1998
ACM
In this paper, we present a new retiming-based technology mapping algorithm for look-up table-based eld programmable gate arrays. The algorithm is based on a novel iterative proce...
FPGA
1998
ACM
13 years 9 months ago
1998
ACM
FPGA
1998
ACM
13 years 9 months ago
1998
ACM
The goal of this paper is to perform a timing optimization of a circuit described by a network of cells on a target structure whose connection delays have discrete values following...
FPGA
1998
ACM
13 years 9 months ago
1998
ACM
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in large FPGAs. Traditional partitioning methods estimate the capacity of an FPGA...
FPGA
1998
ACM
13 years 9 months ago
1998
ACM
FPGA
1998
ACM
13 years 9 months ago
1998
ACM
