FPGA Implementation of Multipliers

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

Lecture 12 First-order Circuits (2) Hung-yi Lee. Outline Non-constant Sources for First-Order Circuits (Chapter 5.3, 9.1)
Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).
Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.
Multioperand Addition Lecture 6. Required Reading Chapter 8, Multioperand Addition Note errata at:
Survey of Reconfigurable Logic Technologies
1 Chapter 12 Advanced Topics--Introduction. 2 Overview To achieve higher growth Additional features, software and IP offerings Application: consumer electronics,
A COMPARATIVE STUDY OF MULTIPLY ACCCUMULATE IMPLEMENTATIONS ON FPGAS Using Distributed Arithmetic and Residue Number System.
CS 151 Digital Systems Design Lecture 38 Programmable Logic.
Basic Adders and Counters Implementation of Adders in FPGAs ECE 645: Lecture 3.
©2004 Brooks/Cole FIGURES FOR CHAPTER 18 CIRCUITS FOR ARITHMETIC OPERATIONS Click the mouse to move to the next page. Use the ESC key to exit this chapter.
Lecture 10 Fast Dividers.
Kris Gaj Office hours: Monday, 6:00-7:00 PM, Tuesday 7:30-8:30 PM, Thursday, 4:30-5:30 PM, and by appointment Research and teaching interests: cryptography.
ECE 645 – Computer Arithmetic Lecture 7: Tree and Array Multipliers ECE 645—Computer Arithmetic 3/18/08.
Topic: Arithmetic Circuits Course: Digital Systems Slide no. 1 Chapter # 5: Arithmetic Circuits.
Kris Gaj Office hours: Monday, 3:00-4:00 PM, Monday, 6:30-7:30 PM, Wednesday, 3:00-4:00 PM, and by appointment Research and teaching interests: cryptography.
Number Representation Part 1 Fixed-Radix Unsigned Representations ECE 645: Lecture 1.
Sequential Multipliers Lecture 9. Required Reading Chapter 9, Basic Multiplication Scheme Chapter 10, High-Radix Multipliers Chapter 12.3, Bit-Serial.
Kris Gaj Office hours: Monday, 7:30-8:30 PM, Tuesday & Thursday 4:30-5:30 PM, and by appointment Research and teaching interests: cryptography computer.
Инвестиционный паспорт Муниципального образования «Целинский район»
Fast Adders: Parallel Prefix Network Adders, Conditional-Sum Adders, & Carry-Skip Adders ECE 645: Lecture 5.
3-1 © 2011 Pearson Prentice Hall. All rights reserved Chapter 6 Exponents, Polynomials, and Polynomial Functions Active Learning Questions.
(x – 8) (x + 8) = 0 x – 8 = 0 x + 8 = x = 8 x = (x + 5) (x + 2) = 0 x + 5 = 0 x + 2 = x = - 5 x = - 2.
Background Motivation Implementation Conclusion 2.
Introduction to Experiment 6 Internal FPGA Memories, Pseudo Random Number Generator, Advanced Testbenches ECE 448 Spring 2009.
Number Representation Part 2 Fixed-Radix Signed Representations Floating Point Representations Little-Endian vs. Big-Endian Representations Galois Field.
CS/EE 3700 : Fundamentals of Digital System Design
Other Arithmetic Functions Section 4-5
1 Basic Dividers Lecture 9. Required Reading Chapter 13, Basic Division Schemes 13.1, Shift/Subtract Division Algorithms 13.3, Restoring Hardware Dividers.
Lecture 13 PicoBlaze I/O & Interrupt Interface Example of Assembly Language Routine ECE 448 – FPGA and ASIC Design with VHDL.
Chapter section Topic: quadratic equations Vocabulary: You factor a quadratic by finding the two binomials you multiply together.
High-Radix Sequential Multipliers Bit-Serial Multipliers Modular Multipliers Lecture 9.
Application of Addition Algorithms Joe Cavallaro.
Copyright © Cengage Learning. All rights reserved. 15 Multiple Integrals.
A Brief Introduction to FPGAs
照片档案整理 一、照片档案的含义 二、照片档案的归档范围 三、 卷内照片的分类、组卷、排序与编号 四、填写照片档案说明 五、照片档案编目及封面、备考填写 六、数码照片整理方法 七、照片档案的保管与保护.
공무원연금관리공단 광주지부 공무원대부등 공적연금 연계제도 공무원연금관리공단 광주지부. 공적연금 연계제도 국민연금과 직역연금 ( 공무원 / 사학 / 군인 / 별정우체국 ) 간의 연계가 이루어지지 않고 있 어 공적연금의 사각지대가 발생해 노후생활안정 달성 미흡 연계제도 시행전.
Жюль Верн ( ). Я мальчиком мечтал, читая Жюля Верна, Что тени вымысла плоть обретут для нас; Что поплывет судно громадней «Грейт Истерна»; Что.
1 Digital Logic Design (41-135) Chapter 6 Combinational Circuit Building Blocks Younglok Kim Dept. of Electrical Engineering Sogang University Spring 2006.
Tree and Array Multipliers Lecture 8. Required Reading Chapter 11, Tree and Array Multipliers Chapter 12.5, The special case of squaring Note errata at:
This chapter in the book includes: Objectives Study Guide
Carry-Lookahead & Carry-Select Adders
Copyright © Cengage Learning. All rights reserved.
Polygon Fill Flood fill algorithm. The algorithm starts at a pixel and perform a depth first traversal of the adjacent pixels and fills the visited pixel.
Sequential Multipliers
Number Representation
This chapter in the book includes: Objectives Study Guide
Basic Adders and Counters
..,../' CJ " · "' ; '..
Radix 2 Sequential Multipliers
Adding Subtracting Multiplying Polynomials
Tree and Array Multipliers
Lecture 8 Addendum Booth Multipliers.
Copyright © Cengage Learning. All rights reserved.
10.2 Arithmetic Sequences and Series
ECE 448 Lecture 13 Multipliers Timing Parameters
-­,-­, '.-.- ·'·' '·..'·..... '-.: - - (p - C!J " 1.,.c_.. If ( '.. ' " ' ' " ' I.
Basic Adders and Counters Implementation of Adders
Part III The Arithmetic/Logic Unit
Lecture 8. Paradigm #6 Dynamic Programming
UNIVERSITY OF MASSACHUSETTS Dept
Tree and Array Multipliers
Modeling of Circuits with a Regular Structure
Sequential Multipliers
UNIVERSITY OF MASSACHUSETTS Dept
Pipelined Array Multiplier Aldec Active-HDL Design Flow
Lecture 9 Basic Dividers.
Carry-Lookahead & Carry-Select Adders
Equations Objectives for today’s lesson : Substitution
Cell Culture Engineering XI
Presentation transcript:

FPGA Implementation of Multipliers Lecture 9 Addendum FPGA Implementation of Multipliers

Source Jean-Pierre Deschamps, Gery Jean Antoine Bioul, Gustavo D. Sutter, Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems, Chapter 12: Multipliers Section 12.1.7 FPGA Implementation of Multipliers

Y Multiplicand yk-1yk-2 . . . y1 y0 X Multiplier xm-1xm-2 . . . x1 x0 Notation Y Multiplicand yk-1yk-2 . . . y1 y0 X Multiplier xm-1xm-2 . . . x1 x0 P Product (Y  X ) pm+k-1pm+k-2 . . . p2 p1 p0 If multiplicand and multiplier are of different sizes, usually multiplier has the smaller size

Xilinx FPGA Implementation Equations Z = (2xm-1+xm-2)  Y  2m-2 + … + (2xi+1+xi)  Y  2i + … + +(2x3+x2)  Y  22 + (2x1+x0)  Y  20 (2xi+1+xi)  Y = pi(k+1)pikpi(k-1)…pi2pi1pi0 pij = xiyj xor xi+1yj-1 xor cj cj+1 = (xiyj)(xi+1yj-1) + (xiyj)cj + (xi+1yj-1)cj c0 = c1 = 0

Xilinx FPGA Implementation Modified Basic Cell Xilinx FPGA Implementation xi+1 xi cj+1 yj yj-1 FA pij cj

Xilinx FPGA Implementation Modified Basic Cell Xilinx FPGA Implementation LUT: xiyj xor xi+1yj-1 cj+1 xi yi xi+1 LUT 1 yi-1 pij cj pij = xiyj xor xi+1yj-1 xor cj cj+1 = (xiyj)(xi+1yj-1) + (xiyj)cj + (xi+1yj-1)cj

Xilinx FPGA Multiplier