Rapid Prototyping Using Field Programmable Devices

Allen C.-H. WuDepartment of Computer Science

Tsing Hua UniversityHsinchu, Taiwan 30043, ROC

email: chunghaw@cs.nthu.edu.tw

Outline

Introduction to programmable logic devices and rapid prototyping.

FPGA design technologies and applications. Logic emulation. Reconfigurable computing and systems.

Part I

Introduction to Programmable Logic Devices and Rapid Prototyping

Programmable Logic Devices

SPLDs (simple PLDs). CPLDs (complex PLDs). FPGAs (field programmable gate arrays). SPGAs (system-programmable gate arrays).

Programmable Interconnect Components

FPID: I-Cube. - Dynamic switching. - Communication switches, network routes. - 32-320 programmable I/O ports. - Up to 150 MHz clock frequency.

FPIC: Aptix. - 1024 programmable I/O ports.

Universal designs. Useable gates < 1,500 gates. Speed is the main advantage. 0.5um CMOS -> 3.5ns logic delays

-> 200 MHz. Market is shrinking 5-7% per year.

Rising densities/performance and declining prices => become a good choice for many applications.

100K gates today, 250K gates by 1998. Low-density CPLD (32 macrocells/44 pins) -

> 5ns logic delays, high-density CPLD (128 macrocells/100 pins) -> 7.5ns.

SRAM-programmed

Antifuse-programmed

EPROM-programmed

Actel ACT1 & 2Quicklogic’s pASICCrosspoint’s CP20K

Island Cellular

Xilinx LCAAT&T OrcaAltera Flex

ToshibaPlesser’s ERAAtmel’s CLi

Altera’s MAXAMD’s MachXilinx’s EPLD

Categories of FPGA’s

Block organized, SRAM based. Channel organized, antifuse based. SOP organized (each logic cell likes a PAL

device), various programming techniques.

Block organized, SRAM based

S S S S

SRAM Programming Technology

SRAM cell

Passtransistor

“1” -> “on”“0” -> “off”

SRAM cell Mux

“1” -> o = i1“0” -> o = i2

SRAM Programming Technology

Advantages: - Reprogrammability. - Quality -> parts are fully tested at the factory.

- Standard process technology. Disadvantages: - Volatile -> FPGA

must be reprogrammed each time when power is applied. - Need an external memory to store the program. - Large area (6 trs for 1 cell + 1 switch).

Cell Organized and Antifuse Based

Antifuse Programming Technology

Poly Dielectric

DiffusionSubstrate

- Normally in high-Z state.- Can be fused to low impedance.- High-voltage melts dielectric causes link poly and diffusion.

Small antifuse area!

EPROM/EEPROM Technology

EPROM can be reprogrammed, no need for external storage.

EPROM can not be re-programmed in circuit.

EEPROM can be re-programmed in circuit. EEPROM consumes 2X more area as

EPROM.

Erasable PLD (EPLD)

Logic array Registers I/Os

Configured toD, T, JK, SR FFs.

Programmable clockto each FF.

SOP-based PAL In, Out, bidirection

Programming the FPGA

Configuration. Readback - design verification and

debugging. Security - a security-bit to prevent readback.

Advantages and Disadvantages of FPGA

Fast turnaround. Low NRE (non-recurring engineering)

changes. Low risk. Effective design verification. low testing cost. Chip size & cost. Slow speed.

CPLD Vs. FPGA

Interconnect style Continuous SegmentedArchitecture and timing Predictable UnpredictableSoftware compile times Short LongIn-system performance Fast ModeratePower consumption High ModerateApplications addressed Combinational and Registered

registered logic logic only

CPLD FPGA

Source: Altera

FPGA Selection Criteria

Density. Speed. Price. Flexibility.

Allow multiple building blocks. Logic. Memory. Data path.

Applications Using SPGAs

Intellectual property (IP). Communication & networking. Graphical processing. Embedded processing.

Designing with SPGAs

A team-based approach. Understanding how to use SPGA system

features will be the key to pulling the entire design into a single device.

CMOS PLD Market Share

OtherCpressAT&TActelLatticeAMDAlteraXilinx

Source:dataquest

11%15%

CMOS Logic Market

Std logicProgrammableGAStd cellCustomChipset

Source:dataquest

8% 14%

FPGAs Growth

1996 1997 1998 1999 20000

1996 1997 1998 1999 2000

Source: Integrated Circuit Engineering

CMOS Programmable-logic Market

1997 1998 1999 20000

1997 1998 1999 2000

Source:dataquest

Rapid Prototyping

What? Why? How?

What is prototyping?

Basic components: FPGAs and FPICs. Hardware : boards, boxes, and cabinets. Software: methodologies and CAD tools.

Product Development Cycle

Market survey

Product developmentCustomeracceptance

Production

Pressures on Today’s Product Development

Time-to-market! Design complexity!

Why Needs Prototyping?

Design verification. Limited production. Concurrent engineering.

Design Verification

Specification

Final product

Functionality & requirements

Final functionality & performance

Design Process

Simulation

Formal verification

Logic emulation

Fast prototyping

Specification

System-level design

RTL design

Logic-level design

Physical-level design

Final chips

Verification Alternatives

Event Driven Simulation High No Short SlowCycle-Based Simulation Med. No Short Med.Behavioral Simulation Low No Short Med.Hardware Accelerated Sim Varies No Med. Med. FastBreadboarding Med. Yes Long Very FastEmulation or Prototyping Med. Yes Med. Very Fast

Modelingaccuracy

Systemintegration

Prepare time Speed

A Minute in the Life of a 100K Gates Design

1 --------- Actual hardware at 50MHz10 -------- Logic emulator or prototype at 5MHz100------- 2K-------- HW accelerator at 250M evals/sec50K------- Cycle-based simulator at 1K insts/sec120K----- Compiled-code logic simulator at 125MIPs800K----- Event-driven logic simulator at 125 MIPs

1 Mon.3 Mon.1.5 Yr.

Development with Prototyping

SW Design Code

Fab Debug

Build IntegrationDesign

Design

Integration Debug

Development with Prototyping

SW Design Code

FabChip debug

Build HW Integration& DebugDesign

Design

FinalIntegrationHW

System Integration& SW Debug

How to Develop a Prototyping using FPDs

Custom-designed prototyping board. Logic-emulation systems. Field-programmable printed-circuit-boards.

Part II

FPGA Design Technologies and Applications

What? - Programmable logic + programmable routing = FPGAs.

Why? - Zero NREs, easy bug fixes, and short time-to-market.

Comparison of Different Design Technologies

Custom Std Cells Gate Arrays FPGAsDesign time Long Short Short ShortFabrication Long Long Short NoneChip area Small Med. Large Very largeDesign cost High Med. Low Very lowUnit cost Low Low Med. HighDesign cycle Long Med. Short Very short

Emerging FPGA-based Applications

Low-volume production. Urgent time-to-market competition. Rapid prototyping. Logic emulation. Custom-computing hardware. Reconfigurable computing.

Design Considerations

Target architecture. Fixed logic and routing resources. Fixed I/O pins. Slow signal delays.

An HDL-based Design Flow

HDL design specification

RTL synthesis

Logic synthesis

Physical synthesis

Verification(Simulation)

Design Specification

HDLs - VHDL and Verilog. Why needs an HDL-based design

methodology? Target Applications. Coding Styles. Design representation. Design entry.

Why Needs an HDL-based Design Methodology

Then NowSchematic capture

Component mapping & may be some logic optimization

Place & route

Layouts

HDL designspecification

Synthesis

Place & route

Layouts

Design complexity

SW : assembly language => high-level language

Target Applications and Layout Architectures

Datapath dominated designs : DSPs and processors.

Control dominated designs: controllers and communication chips.

Mixed type of designs.

Bit-sliced stacks. Standard cells. Macro-cell-based. FPGAs.

HDL Coding Styles Vs. Design Quality

Ideas?

HDLspec1

HDLspec2

HDLspec3

Synthesis system

Design1 Design2 Design3

Coding Styles and Design Representation

Hierarchical style Structural style Random style FSMD

Behavioral level Logic level Gate level

module MUX2(o,i1,i2,sel);output[1:4] o; input[1:4] i1,i2;input sel; reg[1:4] o;always case(sel) 1’b0: o = i1; 1’b1: o = i2; endcaseendmodule

module MUX2(o,i1,i2,sel);output[1:4] o; input[1:4] i1,i2;input sel; assign o[1] = ((sel&i1[1])|(~sel&i2[1])); assign o[2] = ((sel&i1[2])|(~sel&i2[2])); assign o[3] = ((sel&i1[3])|(~sel&i2[3])); assign o[4] = ((sel&i1[4])|(~sel&i2[4]));endmodule

RTL Synthesis

HDL compilation. Design representation. Component selection. Component generation. Resource sharing.

Logic Synthesis

Logic minimization. Technology dependent/independent

minimization. Technology mapping.

Physical Synthesis

Placement. Routing.

Logic Synthesis Problems for FPGAs

How to synthesize a logic network to realize a given function.

How to realize a logic network using FPGAs.

How to optimize a given network for area and timing.

How to synthesize routable circuits. How to solve these problems efficiently.

Representation of Boolean Functions

Truth tables. Factored forms: SOP and POS. BDD. Boolean networks.

Synthesis with Multiplexers

d0d1d2d3d4d5d6d7

s1 s2 s3

yBooleanequations

Synthesis with Look-Up-Table (LUT)

d0d1d2d3d4d5d6d7

yBooleanequations

HOW?LUT

An Example

XOR(a,b) = a’b + ab’

d0d1d2d3

Multilevel Logic Minimization

MIS and SIS by UC Berkeley. Optimization for timing, area, and power. Technology independent.

Technology Mapping for FPGAs

Technology mapping is the process of binding technology dependent circuits to technology independent circuits.

Technology mapping for FPGAs consists of two steps: (1) decomposition and (2) covering.

Technology mapper optimizes the final circuit by selecting sub-networks which are covered by LUTs.

LUTs have fixed number of inputs, k-input, which can implement logic functions up to k variables.

Nodes and sub-networks with at most k inputs in a Boolean network are referred to feasible nodes and sub-networks else infeasible.

Infeasible nodes need to be decomposed into a set of feasible nodes so that a circuit covering the network exists.

An FPGA-based technology mapper performs three tasks: 1. Decomposition - It decomposes infeasible expressions into feasible ones. 2. Reduction - It groups small expressions into CLBs to promote sharing of resources. 3. Packing - It allocates CLBs to expressions that cannot be shared.

The optimization goals for FPGA-based technology mapping include: 1. The number of CLBs, 2. The number of levels of CLB circuits, and 3. Routable designs.

Decomposition

Decomposition consists of three steps: 1. Identify divisors which are common to many functions. 2. Introduce the divisor as a new node. 3. Re-express existing nodes using the new nodes.

An Example

Given the expression f = ab’+ac’+ad’+a’b+bc’+bd’+a’c+b’c+cd’+b’d+c’d

Suppose a factor found is p = a+b+c+d

f can be re-expressed based on p: f = p(a’+b’+c’+d’)

Decomposition Techniques

Disjoint decomposition. Shannon cofactoring. Roth-Karp decomposition. Algebraic decomposition. AND-OR decomposition.

Disjoint Decomposition

Disjoint decomposition can be found by searching through all possible partitions of inputs to the infeasible nodes, and using well known methods, such as residues, to determine if each partition leads to a disjoint decomposition.

Disadvantage: the number of partitions grows exponentially with number of inputs to the infeasible nodes.

Shannon Cofactoring

The residue of a function f(x1,x2,..,xn) with respect to a variable xj is the value of the function for a specific value of xj. It is denoted for xj=1 and by f(xj’) for xj=0.

Ex. The residues, wrt a, of f(a,b,c,d)=ab+bc+bd’+a’cd are f(a’)=bc+bd’+cd and f(a)=b then f(a,b,c,d)=a’f(a’)+af(a)

Roth-Karp Decomposition

Try to decompose a function into the form: f(x,y) = g(z1(x), z2(x),..,zt(x), y) x: the bound set y: free set

Based on the concept of compatible classes. The xl_k_decomp operation in SIS for

decomposition of k-input LUTs. Computationally expensive. It is useful for

small designs with high degree of symmetry.

Algebraic Decomposition

Based on factored from representation and algebraic operations.

Manipulating algebraic expressions as polynomials; I.e., xi and xi’ are different variables.

To reduce search, only common cube factors are kernels are used.

Ex. x = ac+bc+bd+ce y = a+b+c and x = cy + bd

AND-OR Decomposition

Ensure that any infeasible node is decomposed into a set of feasible nodes.

Can be used to decompose large infeasible nodes into infeasible nodes that are small enough to make an exhaustive search for disjoint decomposition practice.

Ex. F = ab+ac+bc can be decomposed into v=ab, w=ac, x=bc, y=v+w and z=y+x

Covering

Graph-covering - for each node, find all the matches which cover that node. Then formulate as a covering problem.

Tree-covering - an approximation to graph covering. Since average tree size is small, optimally of tree-covering can be obtained using a dynamic programming method.

Covering Techniques

Decomposition-based covering using bin packing.

Covering reconvergent paths. Replication of logic at fanout nodes. Covering using edge visibility.

Tree-based Technology Mapping Methods

Chortle, Chortle-crf, and Chortle-d. Hydra. TM-based on edge visibility. mis-PGA.

Graph-Based Technology Mapping Methods

DAG-Map. Flow-Map. Area/depth trade-off.

Layout-Driven FPGA Synthesis

Mapping directed synthesis. Mapping with resynthesis. Combining technology mapping and

placement. Routability-driven technology mapping.

Performance-Driven Methods

mis-pga (xln_p) - mapping with synthesis. Logic synthesis during a timing driven placement.

M.map - interwinded mapping and placement procedures by taking into account wiring delays.

Routability-Driven Methods

Alternative wires - attempt to identify alternative wires and alternative functions for wires that cannot be routed due to the limited routing resources.

Balanced routing resources and cell resources by trading off the routability with the compactness of a design. Try to deliver routable designs by controlling directly the pins-per-cell ratio of the design.

Sequential Synthesis for FPGAs

Each CLB has two FFs. Not much work has done in this area.

WHY? Two attempts were conducted by the UCB

group: map combinational and sequential circuits simultaneously and separately.

How the Xilinx’s APR handles the sequential circuits?

Placement

CLB netlist

Assign logic to cells

S S S S

Routing

S S S S

Realized interconnection by turning onswitches of routing resources.

Placement & Routing Methods

Placement - simulated annealing is the commonly used method.

Routing - routability-driven and timing-driven.

Time-consuming design tasks. Architectural dependent.

HDL-based Design Flow for Multi-FPGA Designs

HDL description

HDL synthesis

Netlists

Partitioning

Partitioned netlists

Basic Partitioning Techniques

The min-cut partitioning: . The Kernighan-Lin algorithm. . The Fiduccia and Mattheyses algorithm. . The Krishnamurthy algorithm.

The ratio-cut algorithm. A variety of clustering algorithms.

Multi-FPGA Partitioning

Constraints: 1. Fixed number of I/O pins. 2. Fixed number of CLBs. 3. Utilization.

Objectives: 1. Cost minimization. 2. Delay minimization.

Circuit-Level Partitioning Methods

Multiway partitioning methods based on the min-cut algorithm.

Interconnect minimization by cell replication.

Clustering-based partitioning methods - cone.

Combining top-down partitioning and bottom-up clustering methods.

Considerations for Multi-FPGA Partitioning

Limited IO-pin and logic resources. Logic utilization is predominated by IO-pin

limitation. How to alleviate the IO-limitation problem

is the key to improve the logic utilization of FPGA chips.

Combining HDL Synthesis and Partitioning

Bridging HDL synthesis and partitioning?

HDL description

HDL synthesis

Netlists

Partitioning

Partitioned netlists

HDL Spec.

Application-Oriented SynthesisModule-based

Bit-sliced Function-based

Fine-grained

Varying coding styles

Datapath-dominatedControl-dominated

Coding Styles

M1 M2 M11 M12 M21 M22

Mod1_1

Mod1_2

Mod2_1

Mod2_2

Top Top

M11 M12 M21 M22

The FSMD Coding Style

Top Top

CU1 CU2 DP1 DP2

Integrated HDL-Synthesis and Partitioning Methodology

HDL descriptions

Module-basedHDL synthesis

Fine-grainedHDL synthesis

Bit-sliced-based HDL synthesis

Circuit-levelpartitioning

Covering-based partitioning

Bit-sliced-based partitioning

Module-based HDL Synthesis

M1 M2 Mn

Fine-Grained HDL Synthesis

M1 M2 Mn

Clusters

A Process ExampleProcess{P1}input[0:3] i1,i2;input i3;output[0:3] o1;output o2;o1 = i1 + i2;o2 = i1[0] & i3;

i1i2 i3

o1[0] o1[3]

f1.0 f1.3

Functional-based Clustering

DesignModule{M1}

Process{P1}

Process{P2}

Module{M2}

Design

Bit-Sliced-Based Synthesis

Mux[0:7] Mux[0:5]MuxMux

[0] [5] [7]

Adder[0:7]

Functional Clustering

DPMux[0]

Mux[0]

Mux[7]

Adder[7]

Adder[0]

Part III

Logic Emulation

What is a Logic Emulation System

A programmable hardware built with programmable logic and programmable interconnect devices.

A software which automatically programs the hardware according to the circuit under design.

Control HW/SW to support operation of the emulated design as a hardware component operating in real time.

Target System

Typical Logic Emulation Environment

Workstation

Logic EmulatorLogic Module

Probe Module

In-circuitInterface

Compiler, runtime software

Stimulus generator, logic analyzer

Why needs Logic Emulation

Design verification issues. Real-time operation. System-level testing. Rapid prototyping.

Design Verification Issues

Simulation-based verification methods have run out of stem when chip complexity grows.

Emulation is a verification technology that grows along with design size.

Real-Time Operation

Simulation requires test vector development which is costly and difficult. Verification depends on test vector correctness.

Certain applications must be verified in real time - human perception: audio and video.

Emulation connected to actual hardware can run: real diagnostic code, operating systems, and applications.

System-Level Testing

Often the chip meets spec but fails in the system.

System-level interactions between the chip and other components.

Internal probing is impossible when the chip is fabbed and placed in a system, but it is possible using emulation.

Rapid Prototyping

Once emulated design is debugged it is available for immediate use by software developers for software debugging.

Emulated design is available for demo and experiments with architecture on real applications and data.

Programmable Hardware

Programmable interconnect

Memoryelement

VLSI core

Interface Logicelement

Logicelement

Considerations

The capacity of logic and interconnection depends on package constraints. This forces a hierarchical system. Chips => boards => boxes => system

The interconnect structure must: 1. Provide successful connectivity, 2. Maximize FPGA utilization, and 3. Minimize delay and skew.

Rent’s rule applies to predict interconnect needs.

Multi-FPGA Systems

Topologies: - Mesh - nearest neighboring. - Crossbar - full and partial.

Interconnect scheme: - Circuit switched. - Time multiplexed.

Nearest Neighbor Interconnection

FPGA FPGA FPGA

Advantages and Disadvantages

Advantages: - Uniform: all chips the same. - Easy to lay out on PCB.

Disadvantages: - Routing is easily blocked. - Through pins limit logic utilization of FPGAs. - Long and unpredictable delays. - No natural hierarchical extension.

Nearest Neighbor Extensions

FPGA FPGA FPGA

Advantages and Disadvantages

Advantages: - More choices for router by adding diagonal lines & skip lines.

Disadvantages: - More complex PCB. - More complex routing software.

Partial Crossbar Interconnect

A B C D A B C D A B C D A B C D

A pins B pins C pins D pins

Logic blocks

Crossbars

Second-level crossbars

Partial Crossbar Interconnect

Partial crossbar consists of a set of small full crossbars, connected to logic blocks but not to each other.

I/O pins of each FPGA are divided into subsets. Each subset is connected by a full crossbar circuit switch.

Partial crossbar is a potentially blocking network.

Partial Crossbar Characteristics

Partial crossbar’s size is proportional to the number of FPGA pins.

All interconnections go through one/three crossbar chips for a one-level/two-level partial crossbar interconnect - delays are uniform and bounded.

Mixed Full and Partial Crossbar

LocalFPIC

Global FPIC

LocalFPIC

FPGA FPGAFPGAFPGA FPGA

Externalconnections

Partialcrossbar

Full crossbar

Circuit Switched Vs. Time Multiplexed

Trade off operating speed and hardware cost. Time-multiplexing method: - can

greatly expand available interconnect. - allows lower cost IC package and PCB. - makes partitioning easier. BUT - System power increases due to frequent signal switching (higher hardware cost). - Complex scheduling software. - Slow operating speed.

Virtual Wires

FPGA FPGAPhysical wires

Logicaloutputs

Logical inputs

FPGA FPGA

Logic Emulation Systems

System with mesh topology - Quickturn’s RPM and Virtual Machine Works (IKOS).

System with partial crossbar - Quickturn’s Enterprise, Mars, and System Realizer.

System with mixed full and partial crossbar - Aptix Prototyping System.

System using time-multiplexed interconnect - Virtual Machine Works (IKOS) , CoBALT and Arkos (Quickturn).

Memory Solutions

Goal: programmable memories with different width/depth/port combinations.

FPGA-based memories: - inefficient of using logic resources. - timing correctness is difficult to be insured. - large or highly multi-ported memories must be partitioned across several FPGAs.

SRAMs with dedicated or programmable controllers.

Logic Emulation Design Flow

Pre-configuration preparation

Full-chipconfiguration

In-circuitemulation

HDL synthesis

Synthesis

Partitioning

System mapping

Design downloading

Emulators

Logic Emulation Design Compiler

Logic emulation design compiler is a large and complex EDA tool which includes: - Front-end design importer. - HDL-based synthesizer. - Clock and timing analyzer. - Partitioner. - System-level placer and router. - FPGA-based placer and router.

Objectives

Fast compilation time. Fast emulation clock. Timing correctness. Easy ECO. Minimize circuit size.

HDL synthesis: - Trade-off run-time and quality. - CLB-based Vs. gate-based designs.

Clock and timing analysis: - Timing correctness, hold-time violation free. - Clock skew minimization.

Partitioning: - Run time. - Timing and area.

System placement and routing: - Timing. - Completeness of routing.

FPGA-based placement and routing: - Fast run time. - Parallel compilation.

Hold-Time Violation

Hold-time violation occurs when Routing delay > LUT delay!!!

Routing delay

Clock distribution problem (Skew)!!!

Timing Correctness

Routing delay

Delayelement

Delay insertion

Timing Correctness

Clock path

Primary clock Low-skew net

Use clock enables for gated clocks

Methodology

Pre-configuration preparation - prepare netlists and control files for configuration.

Testbed preparation - prepare emulation-based operation environment.

Full-chip configuration - download design to the emulator.

In-circuit emulation - test the design.

Pre-Configuration

Translate the leaf-cell libraries into emulation primitives.

Translated libraries must be verified for functional equivalence to original.

Modify and redesign some components to attain compatibility with emulation techniques, such as precharge logic circuits.

Assemble all the gate-level netlists for the entire design.

Testbed

Design and implement target ICE board combining the emulated design with real hardware.

Slowdown testbed to emulation speed. Assemble the testbed and emulation

equipment.

Full-Chip Configuration & In-Circuit Emulation

Full-chip configuration: - Prepare control files. - Partition the design to fit into the emulation system. - Download design into the system. - Verify that emulation model faithfully implements the design as specified by RTL.

In-circuit emulation

Part IV

Reconfigurable Computing and Systems

General-Purpose Computing Vs. Custom Computing

General-purpose computing - applying applications on a general-purpose computer.

Custom computing - applying applications on a custom-made application-specific hardware.

Field-programmable devices make this into a reality.

Goals of Reconfigurable Computing

Tailor the architecture to the application. Minimize or eliminate instruction

interpretation. Exploit fine grained parallelism. Map software to hardware.

Applications

Database search and analysis. Image processing and machine vision. Data compression. Signal processing. Neural networks. Biology computing. Medical computing. Many more.

Application 1

Multi-Mode Systems

Reconfigurable system

- Different configurations for read & write operations of a tape driver (Honeywell).- Different configurations for different printer controllers (Tektronix).

Application 2

Run-Time Reconfiguration

I/OTruck?Image data

- Break single computation into multiple pieces.- Page in components as needed (virtual hardware), ex., automatic target recognition.

Custom Computing

Application-specific systems. Numerous applications for similar

reconfigurable systems. Offers hardware performance, flexibility to

handle numerous algorithms. Multi-FPGA systems can be viewed as

hardware supercomputers.

Reconfigurable Ceprocessors

Processor

Coprocessor

Program 1

Program 2

Inst2- Provide custom instructions on a per-application basis.

Types of Reprogrammable Systems

Coprocessor

Attachedprocessing unit

Memory caches

I/Ointerface

Standalone PU

Attached and standalone processing units are reprogrammable systems on computer add-on cards and separate reprogrammable cabinets. Considerations: large communication overhead may over-shadow the speed gain.

Application-specific coprocessors can achieve significant improvement over a wide range of applications.

Integrate the reprogrammable logic into the processor itself. - A reprogrammable functional unit can be configured on a per-algorithm basis. - Providing some special-purpose instructions tailored to the needs of a given application.

Architectures of Multi-FPGA Systems

The most commonly used topologies: - Mesh: 1D (linear array), 2D, and 3D. - Crossbar: full, partial, mixed, and hierarchical. - Hybrid between mesh and crossbar. - Application-specific architecture.

Hybrid Topology

Splash 2: augments a linear array of FPGAs with a crossbar switch.Goal: Supporting systolic circuits.

16 FPGAs

Ext. InterfaceExt. Interface

Hybrid Topology

Hostinterface

Anyboard: A linear array of FPGAs augmented by global buses.

Hybrid Topology

4 X 4 meshof FPGAs

RAM Hostinterface

DECPeRLe-1: a 4 X 4 mesh of FPGAs augmented with shred global buses.

Application-Specific Topology

Memory

4 5 2 3

The Marc-1: subsystem 1.

2Subsystem1

Subsystem1

The Marc-1Target to circuitsimulation wherethe program to beexecuted can beoptimized on aper-run basis forvalues constantwithin that run, but which may vary from dataset to dataset.

RAMThe RM-nc system: neural network.

Architecture for Computer Prototyping

FPGAFPGA

FPGAFPGACache memory

Register file

ALU FPU

VME bus

The Mushroom processorprototyping system.

Expandable Topology

Hierarchical crossbar topology: by adding extra level. - Quickturn systems.

Expandable mesh topology: by connecting individual board to form a large mesh. - The Virtual Wires Emulation System (IKOS).

Topology for Adapting Other Components

Many multi-FPGA systems include non-FPGA resources to provide more general purpose solutions.

The MORRPH system - sockets next to FPGAs which allow to add arbitrary devices to the array.

The G800 board - contains two FPGAs and four sockets.

The COBRA system - contains based modules (expanding to 2D mesh), RAM modules, I/O modules, and bus modules.

The Springbok system - pre-made daughter board which is able to contain an arbitrary device (on the top) and an FPGA (on the bottom). Daughter boards is mounted on a baseplate.

The Quickturn systems - external component adapters.

The Aptix FPCB - a reprogrammable PCB.

Design Methodology

Applications

Hostcomputer

Reprogrammable system

Mapping

Typical Software Methodology

Application spec.

Analysis System-level synthesis

Software spec.

Codegeneration

Object codeHardware synthesis

Hardware spec.

Typical Software Methodology

Hardware spec.

Synthesis

Partitioning & placement

Pin assignment & routing

FPGA P & R

Bit-stream files

Considerations

Architectural-specific design tasks. Design automation process. The mapping time dominates the setup time

for operating the system. Run-time reconfigurability.

Design Specification and Languages

Standard software programming languages, e.g., C, C++, FORTRAN, and assembly language, Vs. HDLs.

Standard software programming languages - a sequential execution model.

HDLs - a parallel execution model. Who will use it and which one is more

suitable for system description???

Compilation Issues

Translate code from software languages into hardware without losing the inherent concurrency of hardware.

Compiler techniques for parallelizing code. Straight-line code, control flow, and loops. Transmogrifier C compiler.

System-level and High-level Synthesis

System-level design evaluation and analysis. Design estimation. Hardware-software partitioning. Interface synthesis. RTL synthesis. Logic synthesis and technology mapping.

Partitioning and Placement

Topology-aware partitioning methods. Partitioning onto a multi-FPGA system is

equivalent to a placement problem. Logic utilization and timing.

Pin Assignment and Routing

Pin-assignment - the process of determining which I/O pins to be used for each inter-FPGA signal.

Pin-assignment for a pre-fabricated multi-FPGA system is equivalent to the global routing problem.

Pin-assignment will greatly affect the quality of FPGA’s logic utilization and routability.

Run-Time Reconfigurability

Virtual hardware <=> virtual memory. Hardware on demand. Unconfigured and reconfiguring methods. Software supporting time-varying mapping. Many open problems need to be solved in

the forth coming years.

Applications: Splash 2

Stream oriented systolic and SIMD applications. Scalable linear array of 16 to 256 processing

elements (1 XC4010 with 1/2 Mbyte). VHDL based. Sequence comparison - 2300M:0.75M cell

updates/sec (Splash 2:Sparc 10). Edge detection - 10M:242K pixels/sec (Splash

2:Sparc 10).

Applications: PAM (DEC)

Programmable Active Memory (PAM). C++ based and mesh arrays of XC3090

(DECPeRLe-1). Applications: -

Multiple precision arithmetic. - RSA encryption. - Video compression (JPEG, MPEG, DCT). - High energy physics. - Telecommunications.

Rapid Prototyping Using Field Programmable Devices

Documents

Automated Rapid Prototyping Environment for Field ... · PDF fileAutomated Rapid Prototyping Environment for Field Programmable ... wicklern dieses Veriﬁzieren ihrer Algorithmen

Rapid Prototyping - JH May › ... › 12 › Rapid-Prototyping-JH-May.pdf3 Rapid Prototyping Introduction Rapid prototype techniques have revolutionised the model making, industrial

rapid-prototyping of rapid-prototyping machines

Rapid Prototyping Via Photopolymerization ISE 767 Rapid Prototyping

Developing large-scale field-programmable analog arrays ... › 3340 › 827ab48126df44c6626d1c8… · Developing large-scale field-programmable analog arrays for rapid prototyping

Rapid prototyping - Delft University of Technology · Rapid prototyping Rapid prototyping is: • Rapid prototyping is an additive (layered) digital fabrication technology • Layers

Rapid Prototyping - Study Mafiastudymafia.org/.../mech-Rapid-Prototyping-report.pdf · How does Rapid Prototyping Work? Rapid Prototyping, also known as 3D printing, is an additive

· Rapid Prototyping: Introduction, basic concgpts, Need - Development of Rapid Prototyping sysucrns, Rapid chain Impucl of Rapid Pmtolyping on Development -Digital prototyping -

RAPID PROTOTYPING

Virtual Prototyping & Rapid Prototyping

Rapid Prototyping & Rapid Tooling

Rapid Prototyping of Rapid Prototyping Machines - Center for Bits

Rapid Prototyping

Rapid Prototyping of Rapid Prototyping Tools: Cross ...cba.mit.edu/docs/papers/16.05.chi.pdf · Rapid Prototyping of Rapid Prototyping Tools: Cross-Disciplinary Experiences Nadya