Functionality 3 2. The functionality of the block and the effectiveness of the use of the chip area.

Slides:

Advertisements

Similar presentations

Lecture 11-1 FPGA We have finished combinational circuits, and learned registers. Now are ready to see the inside of an FPGA.

Advertisements

Digital Design: Combinational Logic Blocks

Modular Combinational Logic

Documentation Standards

Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.

Programmable Logic PAL, PLA.

111 Basic Circuit Elements n Standard TTL Small-Scale Integration: 1 chip = 2-8 gates n Requires numerous chips to build interesting circuits n Alternative:

Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.

EGRE 427 Advanced Digital Design Figures from Application-Specific Integrated Circuits, Michael John Sebastian Smith, Addison Wesley, 1997 Chapter 5 Programmable.

1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.

Floating-Point FPGA (FPFPGA) Architecture and Modeling (A paper review) Jason Luu ECE University of Toronto Oct 27, 2009.

Programmable Logic Devices

Spartan II Features  Plentiful logic and memory resources –15K to 200K system gates (up to 5,292 logic cells) –Up to 57 Kb block RAM storage  Flexible.

FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR SRAM-based FPGA n SRAM-based LE –Registers in logic elements –LUT-based logic element.

Architecture Design Methodology. 2 The effects of architecture design on metrics:  Area (cost)  Performance  Power Target market:  A set of application.

©2004 Brooks/Cole FIGURES FOR CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES Click the mouse to move to the next page. Use the ESC key.

ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.

The Spartan 3e FPGA. CS/EE 3710 The Spartan 3e FPGA  What’s inside the chip? How does it implement random logic? What other features can you use?  What.

CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.

Programmable logic and FPGA

CS294-6 Reconfigurable Computing Day 14 October 7/8, 1998 Computing with Lookup Tables.

Multiplexers, Decoders, and Programmable Logic Devices

Multiplexer MUX. 2 Multiplexer Multiplexer (Selector)  2 n data inputs,  n control inputs,  1 output  Used to connect 2 n points to a single point.

CS 151 Digital Systems Design Lecture 38 Programmable Logic.

Figure to-1 Multiplexer and Switch Analog

Lecture 2: Field Programmable Gate Arrays September 13, 2004 ECE 697F Reconfigurable Computing Lecture 2 Field Programmable Gate Arrays.

Microprocessor Address Decoding.

Unit 9 Multiplexers, Decoders, and Programmable Logic Devices

Unit 9 Multiplexers, Decoders, and Programmable Logic Devices Ku-Yaw Chang Assistant Professor, Department of Computer Science.

Chapter 6-1 ALU, Adder and Subtractor

Implementation of Finite Field Inversion

FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR FPGA Fabric n Elements of an FPGA fabric –Logic element –Placement –Wiring –I/O.

1 Lecture 9 Demultiplexers Programmable Logic Devices  Programmable logic array (PLA)  Programmable array logic (PAL)

Combinational Design, Part 3: Functional Blocks

Copyright © 2004 by Miguel A. Marin1 COMBINATIONAL CIRCUIT SYNTHESIS CLASSIC TWO-LEVEL CIRCUIT SYNTHESIS MULTILEVEL-CIRCUIT SYNTHESIS FACTORIZATION DECOMPOSITION.

CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

Why we need adjustable delay? The v1495 mezzanine card (A395A) have a signal transmission time about 6ns. But we need all the signals go into the look.

BR 1/991 Issues in FPGA Technologies Complexity of Logic Element –How many inputs/outputs for the logic element? –Does the basic logic element contain.

Morgan Kaufmann Publishers

Chapter 3 How transistors operate and form simple switches

CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers Friday, February 14 CEC 220 Digital Circuit Design Slide 1 of 18.

Boolean Algebra and Reduction Techniques

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.

Reconfigurable Architectures Greg Stitt ECE Department University of Florida.

Description of the task Logical optimisation Optimised description Partitioning Logical synthesis Placement Routing Programming/ configuring Technology.

ECE 506 Reconfigurable Computing Lecture 5 Logic Block Architecture Ali Akoglu.

LB Logic Block LB Logic Block LB Logic Block LB Logic Block LB Logic Block LB Logic Block LB Logic Block LB Logic Block LB Logic Block S/V block I/O Cell.

CEC 220 Digital Circuit Design Decoders, Encoders, & ROM Wed, February 19 CEC 220 Digital Circuit Design Slide 1 of 18.

Programmable Logic Devices

 Seattle Pacific University EE Logic System DesignProgrammable-1 Implementing Sums-of-Products Z A B C D E F We find And-Or structures like this.

1 Programmable Logic There are other ways to implement a logic function than to hook together discrete 74XX packages or create a custom Integrated Circuit.

This chapter in the book includes: Objectives Study Guide

Sequential Programmable Devices

Sequential Logic Design

Floating-Point FPGA (FPFPGA)

Topics SRAM-based FPGA fabrics: Xilinx. Altera..

This chapter in the book includes: Objectives Study Guide

Basics of Digital Logic Design Presentation D

This chapter in the book includes: Objectives Study Guide

FUNCTION OF COMBINATIONAL LOGIC CIRCUIT

We will be studying the architecture of XC3000.

Programmable Configurations

Part I Background and Motivation

April 3 Fun with MUXes Implementing arbitrary logical functions

CSE 370 – Winter 2002 – Comb. Logic building blocks - 1

Design of Digital Circuits Lab 5 Supplement: Implementing an ALU

FIGURE 5-1 MOS Transistor, Symbols, and Switch Models

3.5 Perform Basic Matrix Operations Algebra II.

Programmable logic and FPGA

Presentation transcript:

Functionality 3 2

The functionality of the block and the effectiveness of the use of the chip area

Example. Two-input LUT-s – 32 memory bits and 17 connections Let us realise the function f = abc + bcd + a b c AND OR a b c b c c d a Three-input LUT-s - 32 s memory bits and 13 connections OR AND a b c b c c d a b b Four input LUT-s - 16 memory bits and 5 connections a c b d

Logical blocks based on LUT-s LUT S MUX 0 1 S 0 1 T T Area of the logical block LBA = FA + (M BA 2 ) LBA –area of the logical block FA – fixee area M – number of LUT-s BA – area of the bit xx k

Geometrical model Logical block CL W RP X X CL + ( ) W RP X RP – Routing Piich Symmetrical FPGA. RALB = 2(CL W RP) + (W RP) 2 xxx RALB – Routing Area per LB Row Based FPGA. RALB = CL W RP xx Total area Total Area = N block (LBArea + RALB)

. The number of LUT bits is constantly 5. M=1 LUT IN1 IN OUT M=2 LUT IN1 IN LUT IN10 IN5 IN MUX0 1 s OUT Logical blocks with decomposable LUT-s

M=4 LUT IN1 IN3 LUT IN13 IN2 MUX00 01 s0 s1 OUT Logical blocks with decomposable LUT-s II LUT IN10 IN12 IN11 IN7 IN9 IN8 IN4 IN6 IN5 IN14

M=8 LUT IN1 LUT IN19 IN2 MUX s0 s1 s2 OUT Logical blocks with decomposable LUT-s III LUT IN7 IN8 IN5 IN6 IN3 IN4 LUT IN9 LUT IN10 LUT IN15 IN16 IN13 IN14 IN11 IN IN17 IN18

Experimental results: Summary of the functionality and area-effectiveness of the logical block: 1.One-output LUT is the best while K=4 2.Pins waste area. The best solution is large functionality per pin. 3.LUT with several outputs is not effectual. 4.The best block based on PLA has 8-10 inputs, terms and 3-4 outputs. 5.In case of decomposable LUT-s the best solution is M=4 6.Adding trigger to the logical block is effectual

Functionality of the logical block and its performance D tot = N l (D lb + D r ) D tot –total delay D lb – delay of the logical block D lb –delay of routing N l – number of logical blocks at the critical path x If functionality increases: 1.1. the number of levels (logical blocks) decreases at the path of the signals; 2.2. the delay of the logical blocks increases (bigger and more complex); 3.3. the total routing delay decreases; 4.4. total delay ?

Example. & & & & & & & & & & a b c d a c d a b c d a a b c d The logical blocks contain NAND elements with two outputs The logical blocks contain three-input LUT-s 2NAND delay 0,7 ns 3-LUT delay 1,4 ns Routing delay >0 LUT is swifter Two different realisations of the function f = a d b + a b c + a c d

1.LUT with 5-6 inputs is good in case of a medium-sized routing delay 2.Low functional logical blocks (such as 2NAND) are not swift; 3.It is effectual to add the inversion possibility in case of simple logical blocks. 4.It is effectual to increase the number of terms from three to five in case of large AND-OR blocks Summary concerning the functionality and speed of the logical block

Summary 1.Logical blocks with a very low level of functionality are not good both from the point of view of speed and functionality; 2.Large functionality per output is good (e.g LUT-s) 3.The best LUT is with 4 inputs; 4.The best logical block from the point of view of area is the one where PLA structures are used; 5.Decomposable LUT-s can be effectual in solving some type of tasks; 6.Non-homogenuous structures can be more useful than homogenuous; 7.Hierarchical FPGA organisation may be more effective than a single-level organisation