{ Storage, Scaling, Summation }

Slides:



Advertisements
Similar presentations
Review of Frequency Domain
Advertisements

1 Copyright © 2001, S. K. Mitra Polyphase Decomposition The Decomposition Consider an arbitrary sequence {x[n]} with a z-transform X(z) given by We can.
Block Diagram fundamentals & reduction techniques
Lecture 9: Structure for Discrete-Time System XILIANG LUO 2014/11 1.
DISCRETE-TIME SIGNALS and SYSTEMS
Chapter 6 Digital Filter Structures
Professor A G Constantinides 1 Signal Flow Graphs Linear Time Invariant Discrete Time Systems can be made up from the elements { Storage, Scaling, Summation.
Copyright © 2001, S. K. Mitra Digital Filter Structures The convolution sum description of an LTI discrete-time system be used, can in principle, to implement.
Husheng Li, UTK-EECS, Fall  Study how to implement the LTI discrete-time systems.  We first present the block diagram and signal flow graph. 
System Function of discrete-time systems
Professor A G Constantinides 1 Interpolation & Decimation Sampling period T, at the output Interpolation by m: Let the OUTPUT be [i.e. Samples exist at.
Lec 4 . Graphical System Representations and Simplifications
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Z TRANSFORM AND DFT Z Transform
ELEC692 VLSI Signal Processing Architecture Lecture 2 Pipelining and Parallel Processing.
1 Today's lecture −Cascade Systems −Frequency Response −Zeros of H(z) −Significance of zeros of H(z) −Poles of H(z) −Nulling Filters.
Digital Signal Processing
Structures for Discrete-Time Systems
Lecture 5 – 6 Z - Transform By Dileep Kumar.
Fast Fourier Transforms. 2 Discrete Fourier Transform The DFT pair was given as Baseline for computational complexity: –Each DFT coefficient requires.
EENG 751 3/16/ EENG 751: Signal Processing I Class # 9 Outline Signal Flow Graph Implementation l Fundamentals l System Function l Graph Construction.
Review of DSP.
Time Domain Representations of Linear Time-Invariant Systems
Chapter 4 Structures for Discrete-Time System Introduction The block diagram representation of the difference equation Basic structures for IIR system.
Digital Signal Processing Lecture 9 Review of LTI systems
1 Chapter 8 The Discrete Fourier Transform (cont.)
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Structures for Discrete-Time Systems
Review of DSP.
Lecture 7: Z-Transform Remember the Laplace transform? This is the same thing but for discrete-time signals! Definition: z is a complex variable: imaginary.
Digital Signal Processing
In summary If x[n] is a finite-length sequence (n0 only when |n|
CEN352 Dr. Nassim Ammour King Saud University
EEE4176 Applications of Digital Signal Processing
Signals and systems By Dr. Amin Danial Asham.
3.1 Introduction Why do we need also a frequency domain analysis (also we need time domain convolution):- 1) Sinusoidal and exponential signals occur.
Linear Constant-coefficient Difference Equations
Linear Prediction Simple first- and second-order systems
Lecture 12 Linearity & Time-Invariance Convolution
Discrete-Time Structure
Lec 4 . Graphical System Representations
Description and Analysis of Systems
Everything You Ever Wanted to Know About Filters*
Fast Fourier Transforms Dr. Vinu Thomas
UNIT II Analysis of Continuous Time signal
University of Manchester School of Computer Science
Quick Review of LTI Systems
لجنة الهندسة الكهربائية
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Research Methods in Acoustics Lecture 9: Laplace Transform and z-Transform Jonas Braasch.
UNIT V Linear Time Invariant Discrete-Time Systems
Multiplier-less Multiplication by Constants
UNIT-I SIGNALS & SYSTEMS.
Chapter 5 DT System Analysis : Z Transform Basil Hamed
Z TRANSFORM AND DFT Z Transform
CS3291: "Interrogation Surprise" on Section /10/04
Chapter 9 Computation of the Discrete Fourier Transform
Finite Wordlength Effects
DEPARTMENT OF INFORMATION TECHNOLOGY DIGITAL SIGNAL PROCESSING UNIT 4
Control Systems (CS) Signal Flow Graphs Abdul Qadir Ansari, PhD
Tania Stathaki 811b LTI Discrete-Time Systems in Transform Domain Frequency Response Transfer Function Introduction to Filters.
Tania Stathaki 811b LTI Discrete-Time Systems in Transform Domain Ideal Filters Zero Phase Transfer Functions Linear Phase Transfer.
Zhongguo Liu Biomedical Engineering
DEPARTMENT OF INFORMATION TECHNOLOGY DIGITAL SIGNAL PROCESSING UNIT 4
Signals and Systems Lecture 2
Zhongguo Liu Biomedical Engineering
Lecture 4: Linear Systems and Convolution
Lecture 3: Signals & Systems Concepts
Review of DSP.
Digital Signal Processing II Lecture 3: Filter Realization
Presentation transcript:

{ Storage, Scaling, Summation } Signal Flow Graphs Linear Time Invariant Discrete Time Systems can be made up from the elements  { Storage, Scaling, Summation }  Storage: (Delay, Register) Scaling: (Weight, Product, Multiplier T or z-1 xk xk-1 xk A yk or yk = A.xk 1

Signal Flow Graphs Summation: (Adder, Accumulator)   A linear system equation of the type considered so far, can be represented in terms of an interconnection of these elements Conversely the system equation may be obtained from the interconnected components (structure). X Y X + Y + 2

Signal Flow Graphs For example xk b yk a1 a2 z-1 yk-1 yk-2 3

Signal Flow Graphs A SFG structure indicates the way through which the operations are to be carried out in an implementation. In a LTID system, a structure can be: i) computable : (All loops contain delays) ii) non-computable : (Some loops contain no delays) 4

Signal Flow Graphs Transposition of SFG is the process of reversing the direction of flow on all transmission paths while keeping their transfer functions the same. This entails: Multipliers replaced by multipliers of same value Adders replaced by branching points Branching points replaced by adders For a single-input / output SFG the transpose SFG has the same transfer function overall, as the original. 5

Structures STRUCTURES: (The computational schemes for deriving the input / output relationships.) For a given transfer function there are many realisation structures. Each structure has different properties w.r.t. i) Coefficient sensitivity ii) Finite register computations 6

Signal Flow Graphs Direct form 1 : Consider the transfer function So that Set 7

Signal Flow Graphs For which Moreover z-1 a0 a1 a2 an W(z) 8 n delays + 8

Signal Flow Graphs For which W(z) + Y(z) - b1 z-1 b2 b3 bm m delays 9

Signal Flow Graphs This figure and the previous one can be combined by cascading to produce overall structure. Simple structure but NOT used extensively in practice because its performance degrades rapidly due to finite register computation effects 10

Signal Flow Graphs Canonical form: Let ie and 11

Signal Flow Graphs Hence SFG (n > m) + 12 a0 a1 a2 Y(z) X(z) W(z) - W(z) a0 a1 a2 an b1 b2 bm 12

Signal Flow Graphs Direct form 2 : Reduction in effects due to finite register can be achieved by factoring H(z) and cascading structures corresponding to factors In general with or 13

Signal Flow Graphs Parallel form: Let with Hi(z) as in cascade but a0i = 0 With Transposition many more structures can be derived. Each will have different performance when implemented with finite precision 14

Signal Flow Graphs Sensitivity: Consider the effect of changing a multiplier on the transfer function Set With constraint X(z) 1 4 3 2 V(z) U(z) Y(z)  Linear T-I Discrete System 15

Signal Flow Graphs Hence And thus 16

Signal Flow Graphs Two-ports S X2(z) X1(z) Linear Systems T(z) Y1(z) 17

Signal Flow Graphs Example: Complex Multiplier M x1(n) y1(n) x2(n) 18

Signal Flow Graphs So that Its SFD can be drawn as x1(n) + y1(n) x2(n) - 19

Signal Flow Graphs Special case We have a rotation of t o by an angle We can set so that and This is the basis for designing i) Oscillators ii) Discrete Fourier Transforms (see later)  iii) CORDIC operators in SONAR 20

Signal Flow Graphs Example: Oscillator Consider and externally impose the constraint So that For oscillation 21

Signal Flow Graphs Set Hence 22

Signal Flow Graphs With and , the oscillation frequency Set then and We obtain Hence x1(n) and x2(n) correspond to two sinusoidal oscillations at 90 w.r.t. each other 23

Signal Flow Graphs Alternative SFG with three real multipliers + 24