mapping algorithm for large-scale field programmable analog array (fpaa)

of 21/21
ISPD’2005, San Francisco April 5, 2005 Mapping Algorithm for Large-scale Field Programmable Analog Array (FPAA) Faik Baskaya, Sasank Reddy, Sung Kyu Lim, Tyson Hall, and David Anderson School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, GA 30332 {baskaya, sreddy, limsk, tyson, dva}@ece.gatech.edu

Post on 13-Jan-2016

26 views

Category:

Documents

2 download

Embed Size (px)

DESCRIPTION

Mapping Algorithm for Large-scale Field Programmable Analog Array (FPAA). Faik Baskaya, Sasank Reddy, Sung Kyu Lim, Tyson Hall, and David Anderson School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, GA 30332 - PowerPoint PPT Presentation

TRANSCRIPT

CREST TemplateMapping Algorithm for Large-scale Field Programmable Analog Array (FPAA)
Faik Baskaya, Sasank Reddy, Sung Kyu Lim, Tyson Hall, and David Anderson
School of Electrical and Computer Engineering
Georgia Institute of Technology
ISPD’2005, San Francisco April 5, 2005
*
Analog devices are preferred for low power operation
* Gene Frantz, “Digital Signal Processor Trends”, IEEE Micro, Nov 2000
Power consumption trends
in DSP microprocessors
*
Array of Computational Analog Blocks (CAB)
Discrete time and continuous time versions
Not LUT based => heterogeneous resources
Interconnect lines not segmented => less routing options
Device/interconnect constraints different from FPGA => existing methods do not easily apply!
ISPD’2005, San Francisco April 5, 2005
*
Former IMP EPAC: 150 kHz
Former Motorola MPAA *: 200 kHz
Continuous Time CMOS/Bipolar FPAA
Lee-Gulak’1995: 125 kHz
Floating-gate based RASP: 11 MHz
CAD tools
*Now distributed by Anadigm
*
*
Clustering maximizes type1 use
R ~ 10 kW (switch on resistance)
Cx = S (all switch C’s on a line)
ISPD’2005, San Francisco April 5, 2005
*
components
switch
matrix
*
Larger scale
Non-volatile memory unit
Programmable on resistance
Linear Voltage-Current characteristics
*
*netlist description
.device fpaa1.dev
mm2 11 12 13
vm1 8 9 12 13 x x x x 4 5 x x
.l2constraints op1 ca1 cg1…
*
Small circles => routing switches
*
Constraints
User constraints: certain components have to be in the same CAB
Device constraints: each CAB can accommodate certain number of components of each type
Net constraints: each CAB can have a maximum number of nets for intra-CAB and inter-CAB connections
ISPD’2005, San Francisco April 5, 2005
*
Pre-cluster user-defined components
Order circuit components
Find the best CAB
Merge the component & CAB
If no CAB available
Compute utilization
*
3. Assign groups/components to the best available CABs
i. High priority (scarce) components
ii. User defined groups
pf1
cf1
nf1
mm1
CAB1
CAB2
CAB3
CAB4
ps6
ps5
vm1
op1
cg1
ca1
mm2
CAB1
CAB2
CAB3
CAB4
ps6
ps5
vm1
CAB1
CAB2
CAB3
CAB4
ps6
ps5
vm1
op1
cg1
ca1
*
Check availability of the CAB
Device constrains
Net constraints
Resulting CAB occupancy
ISPD’2005, San Francisco April 5, 2005
*
Inter-CAB Interconnect Reduction
If a component has too many connections to fit in “ANY” CAB:
Select CAB with smallest violation
Look for components to reduce inter-CAB interconnects
pkey: number of nets NOT between component and CAB
skey: number of nets between component and CAB
Pick the lowest pkey & break ties with higher skey
cutsize:
*
Recent Progress
FPAA clustering has been improved to include net-driven, path-driven and a hybrid of net/path-driven approaches
Net-driven minimizes inter-CAB connections
ISPD’2005, San Francisco April 5, 2005
*
We cluster each circuit w/ four different cell ordering methods:
random, net-driven, net-path driven & path-driven
ISPD’2005, San Francisco April 5, 2005
*
1.184
1.124
1.135
1.164
Sheet1
architecture
fpaa1
fpaa2
fpaa3
dimension
Sheet4
Sheet3
Sheet4
Sheet3
Sheet4
Sheet3
Sheet4
Sheet3
*
We require low power reconfigurable analog devices for signal processing applications
Floating gate based FPAA provides a large-scale solution
We developed an algorithm for clustering targeting floating gate based FPAA
ISPD’2005, San Francisco April 5, 2005
*
Clustering
Placement
Routing
Optimal FPAA Architecture Selection
*
1.09
1.1
1.11
1.12
1.13
1.14
1.15
1.16
1.17
1.18
1.19
randomnet-drivennet/path-
driven
path-driven