Lecture 9: Structure for Discrete-Time System XILIANG LUO 2014/11 1

1

Lecture 9: Structure for Discrete-Time SystemXILIANG LUO

2014/11

2

Block DiagramAdder, Multiplier, Memory, Coefficient

3

Example

4

General Case

Direct Form 1

5

Rearrangement

6

Rearrangement

Zeros 1st

Poles 1st

7

Canonic Form

Minimum number of delay elements:max{M, N}

Direct Form 2

8

Signal Flow GraphA directed graph with each node being a variable or a node value.

The value at each node in a graph is the sum of the outputs of all the branches entering the node.

Source node: no entering branchesSink node: no outputs

9

Signal Flow Graph

10

Structures for IIR: Direct Form

11

Structures for IIR: Direct Form

12

Structures for IIR:Cascade FormReal coefs:

Combine pairsof real factors/complex conjugate pairs

13

Structures for IIRCascade Form

2nd –order subsystem

14

Structures for IIRParallel Form

Group real poles in pairs:

Partial fraction expansion:

15

Structures for IIRParallel Form

16

Feedback Loops

If a network has no loops, then the system function has only zeros andthe impulse response has finite duration!

Loops are necessary to generate infinitely long impulse responses!

Loop: closed path starting at a node and returning to same node by traversing branches in the direction allowed, which is defined by the arrowheads

input unit impulse, the outputis: 𝑎𝑛𝑢[𝑛]

17

Transposed Form

Transposition:1. reverse direction of all branches2. keep branch gains same3. reverse input/output

For SISO, transposition givesthe same system function!

18

Transposed FormTransposed direct form II:

poles firstzeros first

19

Structures for FIRDirect Form

Tapped delay line

20

Structures for FIRCascade Form

21

Structures for FIRwith Linear PhaseImpulse response satisfies the following symmetry condition:

or

So, the number of coefficient multipliers can be essentially halved!

Type-1:

22

Lattice Filters

][)1( na i

][)1( nb i

][)( na i

][)( nb i1z

ik

ik

2-port flow graph

23

Lattice Filters: FIR

24

Lattice Filters: FIRInput to i-th nodes:

Recursive computation oftransfer functions!

25

Lattice Filters: FIRTo obtain a direct recursive relationship for the coefficients, or theimpulse response, we use the following definition:

26

Lattice Filters: FIRFrom k-parameters to FIR impulse response:

27

Lattice Filters: FIRFrom FIR impulse response to k-parameters:

28

Lattice Filters: FIRFrom FIR impulse response to k-parameters:

𝐴 (𝑧 )=1−0.9𝑧−1+0.64 𝑧− 2−0.576 𝑧− 3

𝛼1(3)=0.9

𝛼2(3)=−0.64

𝛼3(3)=0.576

𝛼1(2)=

𝛼1(3 )+𝑘3𝛼2

3

1−𝑘32 =0.795

𝛼2(2)=−0.182

𝑘2=𝛼2(2 )=−0.182

𝑘3=0.576

𝛼1(1)=0.673

𝑘1=𝛼1(1)=0.673

29

Lattice Filters: FIR

Direct Form

Lattice Form

30

Lattice Filters: IIRInvert the computations in the following figure:

𝐻❑ (𝑧 )= 1𝐴(𝑧 )

31

Lattice Filters: IIRDerive 𝐴(𝑖− 1) (𝑧 ) 𝐴(𝑖 ) (𝑧 )from

FIR:

IIR:

32

Lattice Filters: IIRDerive 𝐴(𝑖− 1) (𝑧 ) 𝐴(𝑖 ) (𝑧 )from

][)1( na i

][)1( nb i

][)( na i

][)( nb i1z

ik

ik

33

Lattice Filters: IIR

𝐻❑ (𝑧 )= 1𝐴(𝑧 )