Chapter 5 Network structures of Discrete-Time system
Chapter 5 Network Structures of Discrete-Time system
Content ● Introduce o Network Representation with Signal Flow-Graph o Basic IIR System structures o Basic FIR System structures o Linear phase structures ● Frequency Sample
Content ⚫ Introduce ⚫ Network Representation with Signal Flow-Graph ⚫ Basic IIR System Structures ⚫ Basic FIR System Structures ⚫ Linear Phase Structures ⚫ Frequency Sample
5.1 Introduce O Discrete-time system representation a discrete-time system can be described by the input-output relation, impulse response and system function N y(n)=2bx(n-1)-2a, y(n-i) h(n) H(2)=Y(z) ∑b X(二) +)a.z
5.1 Introduce ⚫ Discrete-time system representation 0 1 ( ) ( ) ( ) M N i i i i y n b x n i a y n i = = = − − − 0 1 ( ) ( ) ( ) 1 M i i i N i i i b z Y z H z X z a z − = − = = = + h n( ) A discrete-time system can be described by the input-output relation, impulse response and system function
5.1 Introduce o Discrete-time system representation In the time domain, the input-output relations of an Lti discrete-time system is given by the convolution sum or, by the linear constant coefficient difference equation y(n)=∑h(k)x(n-k) k: (m)=∑dy{n-k]+∑P2xn-k
5.1 Introduce ⚫ Discrete-time system representation ( ) ( ) ( ) k y n h k x n k =− = − In the time domain, the input-output relations of an LTI discrete-time system is given by the convolution sum or, by the linear constant coefficient difference equation. ( ) N M k k y n d y n k p x n k = − − + −
5.1 Introduce o Discrete-time system representation a discrete-time system can be implemented on a general purpose digital computer in software or with special-purpose hardware. To this end, it is necessary to describe the input- output relationship by means of a computational algorithm
5.1 Introduce ⚫ Discrete-time system representation ◆ A discrete-time system can be implemented on a generalpurpose digital computer in software or with special-purpose hardware. To this end, it is necessary to describe the inputoutput relationship by means of a computational algorithm