Convolution circuits synthesis Perkowski. FIR-filter like structure b4b3 b2b1 +++ a4000 a4*b4.

Slides:

Advertisements

Similar presentations

Factoring the Sum or the Difference of Two Cubes. Subtitle: Know the CARD!!!

Advertisements

Vector: Data Layout Vector: x[n] P processors Assume n = r * p

1 ECE734 VLSI Arrays for Digital Signal Processing Chapter 3 Parallel and Pipelined Processing.

Intel’s MMX Dr. Richard Enbody CSE 820. Michigan State University Computer Science and Engineering Why MMX? Make the Common Case Fast Multimedia and Communication.

Quantum Phase Estimation using Multivalued Logic.

Quantum Phase Estimation using Multivalued Logic Vamsi Parasa Marek Perkowski Department of Electrical and Computer Engineering, Portland State University.

Examples of One-Dimensional Systolic Arrays

Vector Spaces Space of vectors, closed under addition and scalar multiplication.

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Why Systolic Architecture ? VLSI Signal Processing 台灣大學電機系吳安宇.

CLASS GRADING HOMEWORKS PROJECTS REVIEW OF DIGITAL LOGIC.

Applications of Systolic Array FTR, IIR filtering, and 1-D convolution. 2-D convolution and correlation. Discrete Furier transform Interpolation 1-D and.

CSE621/JKim Lec4.1 9/20/99 CSE621 Parallel Algorithms Lecture 4 Matrix Operation September 20, 1999.

Vectors. Vector Space  A vector space is an abstract mathematical object.  It has a set of vectors. Commutative with additionCommutative with addition.

Week 10. Chapter 9 1.Convolution sum & integral 1.Kronecker delta and Dirac delta 2.Impulse response and convolution 2.Impulse response & frequency response.

Examples of One- Dimensional Systolic Arrays Motivation & Introduction We need a high-performance, special-purpose computer system to meet specific application.

Introduction to Algorithms

EECS 20 Chapter 9 Part 21 Convolution, Impulse Response, Filters Last time we Revisited the impulse function and impulse response Defined the impulse (Dirac.

Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.

Feature extraction Feature extraction involves finding features of the segmented image. Usually performed on a binary image produced from.

New Approach to Quantum Calculation of Spectral Coefficients Marek Perkowski Department of Electrical Engineering, 2005.

Forces. Normal Stress A stress measures the surface force per unit area.  Elastic for small changes A normal stress acts normal to a surface.  Compression.

Orthogonal Transforms

Kathy Grimes. Signals Electrical Mechanical Acoustic Most real-world signals are Analog – they vary continuously over time Many Limitations with Analog.

University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2006 Don Fussell Orthogonal Functions and Fourier Series.

The Cross Product Third Type of Multiplying Vectors.

Introduction to Convolution circuits synthesis image processing, speech processing, DSP, polynomial multiplication in robot control. convolution.

ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.

Parallel Algorithms Sorting and more. Keep hardware in mind When considering ‘parallel’ algorithms, – We have to have an understanding of the hardware.

High Speed, Low Power FIR Digital Filter Implementation Presented by, Praveen Dongara and Rahul Bhasin.

CS654: Digital Image Analysis Lecture 15: Image Transforms with Real Basis Functions.

CS654: Digital Image Analysis Lecture 12: Separable Transforms.

Signal and Systems Prof. H. Sameti Chapter 5: The Discrete Time Fourier Transform Examples of the DT Fourier Transform Properties of the DT Fourier Transform.

REVIEW: Separation of Variables. Fourier’s Theorem.

The Fast Fourier Transform and Applications to Multiplication

Image transformations Digital Image Processing Instructor: Dr. Cheng-Chien LiuCheng-Chien Liu Department of Earth Sciences National Cheng Kung University.

Motivation: Wavelets are building blocks that can quickly decorrelate data 2. each signal written as (possibly infinite) sum 1. what type of data? 3. new.

1 Reconstruction Technique. 2 Parallel Projection.

CS654: Digital Image Analysis

CDP Tutorial 3 Basics of Parallel Algorithm Design uses some of the slides for chapters 3 and 5 accompanying “Introduction to Parallel Computing”, Addison.

9.3 Factoring Trinomomials. Rainbow Method (2 nd degree Polynomial) 2.

Uses some of the slides for chapters 3 and 5 accompanying “Introduction to Parallel Computing”, Addison Wesley, 2003.

X = 2 + t y = t t = x – 2 t = (y + 3)/2 x – 2 = y x – 4 = y + 3 y – 2x + 7 = 0 Finding the Cartesian Equation from a vector equation x = 2.

Section 4.2 – The Dot Product. The Dot Product (inner product) where is the angle between the two vectors we refer to the vectors as ORTHOGONAL.

8-8 Special Products Objective: Students will be able to use special product patterns to multiply polynomials.

VLSI SP Course 2001 台大電機吳安宇 1 Why Systolic Architecture ? H. T. Kung Carnegie-Mellon University.

Basic command Vectors and matrices in Scilab Data types: (real or complex) numbers, vectors, matrices, polynomials, strings, functions, … –Vectors in Scilab:

Example 2 Factor the polynomial. 12n n2 a. – 36 + = ( ) 2 n2 –

ES2501: Statics/Unit 4-1: Decomposition of a Force

FFT-based filtering and the

(C) 2002 University of Wisconsin, CS 559

2D Fourier transform is separable

Angle between two vectors

Using Matrices with Transformations

Numerical Algorithms Quiz questions

Dots 5 × TABLES MULTIPLICATION.

Dots 5 × TABLES MULTIPLICATION.

Dots 2 × TABLES MULTIPLICATION.

Dots 3 × TABLES MULTIPLICATION.

Dots 6 × TABLES MULTIPLICATION.

Dots 2 × TABLES MULTIPLICATION.

Dots 4 × TABLES MULTIPLICATION.

Vectors and Dot Products

Parallel Circuits 119.

Assignment # 3 Chapter 4 End of Chapter questions P-4.6 Page 97

Multiple Choice Quiz.

Intensity Transformation

Signals and Systems Lecture 18: FIR Filters.

For vectors {image} , find u + v. Select the correct answer:

Dots 3 × TABLES MULTIPLICATION.

Presentation transcript:

Convolution circuits synthesis Perkowski

FIR-filter like structure b4b3 b2b1 +++ a4000 a4*b4

Think what you can do in all possible ways with two vectors of items (numbers)? 1. Dot product 2. Convolution (polynomial multiplication) 3. Cartesian Product 4. Kronecker Product 5. Other? Think what you can do in all possible ways with two matrices of items (numbers)?

Convolution Perhaps the most important operation on data. Not related to operators that operate on items. It is a pattern of moving data and operating on them Although first systolic processors were not for convolution, it is the standard and common object of systolic, cellular and parallel design of algorithms and hardware. Every image processing project such as Hadamard, Fourier, Hough or other transform includes convolution – like circuit/system design in one way or another. This part of design is truly creative.

I have two vectors A=(a1,a2,a3,a4) and B=(b1,b2,b3,b4) b4b3 b2b1 +++ a400 a4*b4 a3 a3*b4+a4b3

b4b3 b2b1 +++ a3a40 a4*b4 a2 a3*b4+a4b3 a4*b2+a3*b3+a2*b4

b4b3 b2b1 +++ a2a3a4 a4*b4 a1 a3*b4+a4b3 a4*b2+a3*b3+a2*b4 a1*b4+a2*b3+a3*b2+a4*b1

b4b3 b2b1 +++ a1a2a3 a4*b4 0 a3*b4+a4b3 a4*b2+a3*b3+a2*b4 a1*b4+a2*b3+a3*b2+a4*b1 a1*b3+a2*b2+a3*b1

We insert Dffs to avoid many levels of logic b4b3 b2b1 +++ a4a2a3 a4*b4 a4*b3 a4*b2a4*b1

b4b3 b2b1 +++ a3a1a2 a4*b4 a4*b3+a3b4 a4*b2+a3b3 a4*b1+a3b2 a3b1

b4b3 b2b1 +++ a20a1 a4*b4 a4*b3+a3b4 a4*b2+a3b3+a2b4 a4*b1+a3b2+a2b3 a3b1+a2b2 a2b1 The disadvantage of this circuit is broadcasting

We insert more Dffs to avoid broadcasting b4b3 b2b1 +++ a4a2a3 a4*b

b4b3 b2b1 +++ a3a1a2 a4*b4 a3b4 a4b3 0 a400 0 Does not work correctly like this, try something new….

b4b3 b2b1 a3a1a2 a4*b4 a3b4a4b3 0 a400 0 a2b4 a1b4 a3b3 a2b3 a1b a4b2 a3b2 a2b2 a1b a4b1 a3b1 a2b1 First sum Second sum

FIR-filter like structure, assume two delays b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++

b4b3 b2b1 +++