ISPD’2005, San Francisco April 5, 2005 Mapping Algorithm for Large-scale Field Programmable Analog Array (FPAA) Faik Baskaya, Sasank Reddy, Sung Kyu Lim,

Slides:



Advertisements
Similar presentations
FPGA (Field Programmable Gate Array)
Advertisements

Presentation of Designing Efficient Irregular Networks for Heterogeneous Systems-on-Chip by Christian Neeb and Norbert Wehn and Workload Driven Synthesis.
ECE 506 Reconfigurable Computing Lecture 6 Clustering Ali Akoglu.
NATIONAL INSTITUTE OF SCIENCE & TECHNOLOGY Presented by: Susman Das Technical Seminar Presentation FPAA for Analog Circuit Design Presented by Susman.
Institute of Applied Microelectronics and Computer Engineering College of Computer Science and Electrical Engineering, University of Rostock Slide 1 Spezielle.
Architecture Design Methodology. 2 The effects of architecture design on metrics:  Area (cost)  Performance  Power Target market:  A set of application.
Lecture 26: Reconfigurable Computing May 11, 2004 ECE 669 Parallel Computer Architecture Reconfigurable Computing.
ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.
Spring 08, Jan 15 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Introduction Vishwani D. Agrawal James J. Danaher.
Chapter 2 – Netlist and System Partitioning
Supply Voltage Degradation Aware Analytical Placement Andrew B. Kahng, Bao Liu and Qinke Wang UCSD CSE Department {abk, bliu,
Lecture 3: Field Programmable Gate Arrays II September 10, 2013 ECE 636 Reconfigurable Computing Lecture 3 Field Programmable Gate Arrays II.
Local Unidirectional Bias for Smooth Cutsize-delay Tradeoff in Performance-driven Partitioning Andrew B. Kahng and Xu Xu UCSD CSE and ECE Depts. Work supported.
Physical Design Outline –What is Physical Design –Design Methods –Design Styles –Analysis and Verification Goal –Understand physical design topics Reading.
Evolution of implementation technologies
The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays Steven J.
CS 151 Digital Systems Design Lecture 38 Programmable Logic.
Introduction to FPGA and DSPs Joe College, Chris Doyle, Ann Marie Rynning.
1 A survey on Reconfigurable Computing for Signal Processing Applications Anne Pratoomtong Spring2002.
ECE 506 Reconfigurable Computing Lecture 8 FPGA Placement.
General FPGA Architecture Field Programmable Gate Array.
Authors: Jia-Wei Fang,Chin-Hsiung Hsu,and Yao-Wen Chang DAC 2007 speaker: sheng yi An Integer Linear Programming Based Routing Algorithm for Flip-Chip.
Escape Routing For Dense Pin Clusters In Integrated Circuits Mustafa Ozdal, Design Automation Conference, 2007 Mustafa Ozdal, IEEE Trans. on CAD, 2009.
Lecture 2: Field Programmable Gate Arrays September 13, 2004 ECE 697F Reconfigurable Computing Lecture 2 Field Programmable Gate Arrays.
Power Reduction for FPGA using Multiple Vdd/Vth
1 Coupling Aware Timing Optimization and Antenna Avoidance in Layer Assignment Di Wu, Jiang Hu and Rabi Mahapatra Texas A&M University.
CAD for Physical Design of VLSI Circuits
LOPASS: A Low Power Architectural Synthesis for FPGAs with Interconnect Estimation and Optimization Harikrishnan K.C. University of Massachusetts Amherst.
Un/DoPack: Re-Clustering of Large System-on-Chip Designs with Interconnect Variation for Low-Cost FPGAs Marvin Tom* Xilinx Inc.
Open Discussion of Design Flow Today’s task: Design an ASIC that will drive a TV cell phone Exercise objective: Importance of codesign.
TSV-Aware Analytical Placement for 3D IC Designs Meng-Kai Hsu, Yao-Wen Chang, and Valerity Balabanov GIEE and EE department of NTU DAC 2011.
1 Rapid Estimation of Power Consumption for Hybrid FPGAs Chun Hok Ho 1, Philip Leong 2, Wayne Luk 1, Steve Wilton 3 1 Department of Computing, Imperial.
Solving Hard Instances of FPGA Routing with a Congestion-Optimal Restrained-Norm Path Search Space Keith So School of Computer Science and Engineering.
March 20, 2007 ISPD An Effective Clustering Algorithm for Mixed-size Placement Jianhua Li, Laleh Behjat, and Jie Huang Jianhua Li, Laleh Behjat,
An Efficient Clustering Algorithm For Low Power Clock Tree Synthesis Rupesh S. Shelar Enterprise Microprocessor Group Intel Corporation, Hillsboro, OR.
1 Moore’s Law in Microprocessors Pentium® proc P Year Transistors.
CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
J. Christiansen, CERN - EP/MIC
Programmable Logic Devices
Introduction to FPGA Created & Presented By Ali Masoudi For Advanced Digital Communication Lab (ADC-Lab) At Isfahan University Of technology (IUT) Department.
Field Programmable Gate Arrays (FPGAs) An Enabling Technology.
Design Space Exploration for Application Specific FPGAs in System-on-a-Chip Designs Mark Hammerquist, Roman Lysecky Department of Electrical and Computer.
Tao Lin Chris Chu TPL-Aware Displacement- driven Detailed Placement Refinement with Coloring Constraints ISPD ‘15.
Congestion Estimation and Localization in FPGAs: A Visual Tool for Interconnect Prediction David Yeager Darius Chiu Guy Lemieux The University of British.
EE3A1 Computer Hardware and Digital Design
Topics Architecture of FPGA: Logic elements. Interconnect. Pins.
Simultaneous Analog Placement and Routing with Current Flow and Current Density Considerations H.C. Ou, H.C.C. Chien and Y.W. Chang Electronics Engineering,
1 Synthesizing Datapath Circuits for FPGAs With Emphasis on Area Minimization Andy Ye, David Lewis, Jonathan Rose Department of Electrical and Computer.
1 5. Application Examples 5.1. Programmable compensation for analog circuits (Optimal tuning) 5.2. Programmable delays in high-speed digital circuits (Clock.
EDA (Circuits) Overview Paul Hasler. Extent of Circuits (Analog/Digital) Analog ~ 20% of IC market since 1970 Hearing aids Automotive Biomedical Digital.
Routing Wire Optimization through Generic Synthesis on FPGA Carry Hadi P. Afshar Joint work with: Grace Zgheib, Philip Brisk and Paolo Ienne.
ECE 506 Reconfigurable Computing Lecture 5 Logic Block Architecture Ali Akoglu.
Introduction to Field Programmable Gate Arrays (FPGAs) EDL Spring 2016 Johns Hopkins University Electrical and Computer Engineering March 2, 2016.
CALTECH CS137 Winter DeHon 1 CS137: Electronic Design Automation Day 8: January 27, 2006 Cellular Placement.
1 Architecture of Datapath- oriented Coarse-grain Logic and Routing for FPGAs Andy Ye, Jonathan Rose, David Lewis Department of Electrical and Computer.
Time-borrowing platform in the Xilinx UltraScale+ family of FPGAs and MPSoCs Ilya Ganusov, Benjamin Devlin.
ELEC 7770 Advanced VLSI Design Spring 2016 Introduction
HeAP: Heterogeneous Analytical Placement for FPGAs
Andrew B. Kahng and Xu Xu UCSD CSE and ECE Depts.
Incremental Placement Algorithm for Field Programmable Gate Arrays
ELEC 7770 Advanced VLSI Design Spring 2014 Introduction
Chapter 2 – Netlist and System Partitioning
ELEC 7770 Advanced VLSI Design Spring 2012 Introduction
ELEC 7770 Advanced VLSI Design Spring 2010 Introduction
FPGA Glitch Power Analysis and Reduction
HIGH LEVEL SYNTHESIS.
A New Hybrid FPGA with Nanoscale Clusters and CMOS Routing Reza M. P
Measuring the Gap between FPGAs and ASICs
Chapter 3b Leakage Efficient Chip-Level Dual-Vdd Assignment with Time Slack Allocation for FPGA Power Reduction Prof. Lei He Electrical Engineering Department.
Presentation transcript:

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 {baskaya, sreddy, limsk, tyson,

ISPD’2005, San Francisco April 5, Motivation: Gene’s law* Signal processing systems require low power Analog devices are preferred for low power operation * Gene Frantz, “Digital Signal Processor Trends”, IEEE Micro, Nov 2000 Power consumption trends in DSP microprocessors Contribution of analog design

ISPD’2005, San Francisco April 5, Field Programmable Analog Arrays (FPAA) 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, Previous Work Discrete Time (switched capacitor based) FPAA Former IMP EPAC: 150 kHz Former Motorola MPAA *: 200 kHz Continuous Time CMOS/Bipolar FPAA Lee-Gulak’1995: 125 kHz Fast Analog Solutions TRAC: 4 MHz Floating-gate based RASP: 11 MHz CAD tools Ganesan-Vemuri: DAC’2001 Wang-Vrudhula: Mixed Design of Integrated Circuits and Systems, 2001 *Now distributed by Anadigm

ISPD’2005, San Francisco April 5, Floating gate based FPAA V fg V tun Floating gate PFET switch Computational Analog Block (CAB) components 2D array of CABs

ISPD’2005, San Francisco April 5, Interconnect Analysis Three types of interconnects: type1: intra-CAB type2: inter-CAB, intra-column type3: inter-CAB, inter-column Clustering determines type1 vs. types 2&3 Clustering maximizes type1 use Vertical/horizontal wires are not segmented (unlike FPGA) R ~ 10 k  (switch on resistance) C x =  (all switch C’s on a line)

ISPD’2005, San Francisco April 5, Layout of a single CAB in FPAA components switch matrix

ISPD’2005, San Francisco April 5, Advantages of floating-gate based FPAA Larger scale More components per CAB More CABs per chip More component variety Floating gate PFET switch technology Non-volatile memory unit Programmable on resistance Linear Voltage-Current characteristics

ISPD’2005, San Francisco April 5, Analog Circuit Modeling *netlist description.device fpaa1.dev vcc 1 0 in1 2 0 in2 3 0 out1 4 0 out2 5 0 op cg1 6 0 nf cf mm vm x x x x 4 5 x x.l2constraints op1 ca1 cg1….end - + In1 max min In2 max min C 4 (SOS) InOut 4*4 Vector Multiplier Out2Out1 op1 mm1 cf1 nf1 mm2vm1 pf1 cg1 ca1 In2 Out1 Out2 In1 gnd vcc ps1 ps2 ps3 ps4 ps5 ps6 Extracting a directed graph from an analog circuit

ISPD’2005, San Francisco April 5, FPAA device modeling 8*8 FPAA and its graph based representation Small circles => routing switches Large circles => CABs

ISPD’2005, San Francisco April 5, Problem Formulation Objective Minimum number of CABs Minimum number of inter-CAB connections 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, Overview of FPAA Clustering Simple (but effective) greedy heuristic 1.Pre-cluster user-defined components 2.Order circuit components 3.For each component in order 1.Find the best CAB 2.Merge the component & CAB 3.If no CAB available 1.allow constraint violation 2.fix it by adding more neighbors 4.Compute utilization

ISPD’2005, San Francisco April 5, FPAA Clustering Algorithm 1. Determine constrained groups 2. Modified Hyper Edge Coarsening (MHEC) ordering 3. Assign groups/components to the best available CABs i. High priority (scarce) components ii. User defined groups iii. Remaining components in MHEC ascending order pf1 cf1 nf1 mm1 CAB1 CAB2 CAB3CAB4 ps6 ps5 vm1 op1 cg1 ca1 mm2 CAB1CAB2 CAB3 CAB4 ps6 ps5 vm1 CAB1 CAB2 CAB3CAB4 ps6 ps5 vm1 op1 cg1 ca1

ISPD’2005, San Francisco April 5, How to select the best CAB? Check availability of the CAB Device constrains Net constraints If available, rank the CAB in favor of: Resulting CAB occupancy Net increase in intra-CAB connections Net decrease in inter-CAB connections Select CAB with highest rank

ISPD’2005, San Francisco April 5, 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: before => 6 nets after => 5 nets

ISPD’2005, San Francisco April 5, 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 Path-driven considers path length balance FPAA Placement has been implemented

ISPD’2005, San Francisco April 5, Experimental Setup FPAA Architectures benchmarks  We cluster each circuit w/ four different cell ordering methods: random, net-driven, net-path driven & path-driven

ISPD’2005, San Francisco April 5, Results

ISPD’2005, San Francisco April 5, Conclusion 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, Future Work Complete FPAA Physical Synthesis Tool including: Clustering Placement Routing Synthesize circuits => measurements Elaborate FPAA switch vs wire analysis Optimal FPAA Architecture Selection

ISPD’2005, San Francisco April 5, Thank you