Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Programming Technologies
1- SRAM Programming Technology
- FPGA connections are
achieved using passtransistors, transmission
gates, or multiplexers
that are controlled by
SRAM cells
- It is used in the devices from Xilinx , Altera,
Plessey, Algotronix, Concurrent Logic and
Toshiba.
Disadvantage:
Its large area. It takes at least five transistors to implement an
SRAM cell, plus at least one transistor to serve as a programmable
switch.
Advantages:
1- fast re-programmability (The FPGA can be programmed an
unlimited number
of times)
2- It requires only standard integrated circuit process technology.
Act-2
LUT inputs
PROM bits
required
Possible functions
Generall
y
nn
2
22
5
32
16
65,536
32
4,294,967,296
- Its disadvantage is that they will be quite large for more than
about five inputs, since the number of memory cells
K needed for a
2
K-input LUT is
Type
Cost of cell /
Total cost /
Total cost /
of IC
of cell
transistor
cell*
transistor*
ROM
bit
1.5
73,000,000,00
109,500,000,00
Plessey
Fine gate
35
500
17,500
Coarse gate
100
20
2000
FPGA
Xilinx FPGA
- The circuits that have internal feedback must be built by using the
gate cell devices.
- The forward transfer function (no internal) such as adder circuit
must be built using either:
Bit cell devices for circuits with less than 16-bit inputs.
Gate cell devices for circuits with more than 16-bit inputs.
Routing
Architecture
- The routing architecture of an FPGA is the manner in which the
programmable switches and wiring segments are positioned to
allow the programmable interconnection of the logic blocks.
A wire segment is a wire
unbroken by programmable
switches. One or more
switches may attach to the
wire segment
A track is a sequence of one
or more wire segments in a
line.
A routing channel is a
group of parallel tracks.
direct implementation- 1
Output
S0
S1
S2
S3
S4
Co
Total
No. of variables
11
11
11
Cost/cell
32
128
128
299
Delay/tg
Output
S0
S1
S2
S3
S4
Co
Total
No. of variables
11
Cost/cell
10
Delay/tg
Output
S0
S1
S2
S3
S4
Co
Total
No. of variables
11
Cost/cell
12
Delay/tg
Another optimized- 4
implementation
Output
S0
S1
S2
S3
S4
Co
Total
No. of variables
11
Cost/cell
16
24
Delay/tg