Kundur DTS Chap11a PDF

Chapter 11: Multirate Digital Signal Processing
Discrete-Time Signals and Systems
Multirate Digital Signal Processing: Part I Reference:
Dr. Deepa Kundur Sections 11.1-11.3 of
University of Toronto John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
Principles, Algorithms, and Applications, 4th edition, 2007.
Dr. Deepa Kundur (University of Toronto) Multirate Digital Signal Processing: Part I 1 / 42 Dr. Deepa Kundur (University of Toronto) Multirate Digital Signal Processing: Part I 2 / 42
Chapter 11: Multirate Digital Signal Processing Chapter 11: Multirate Digital Signal Processing
Multirate DSP Sampling vs. Sampling Rate Conversion
Sampling:
I conversion from cts-time to dst-time by taking “samples” at
I sampling rate conversion: process of converting a given discrete time instants

discrete-time signal at a given rate to a different rate I E.g., uniform sampling: x(n) = xa (nT ) where T is the sampling
period
I multirate digital signal processing systems: systems that employ Sampling rate conversion approaches:
multiple sampling rates I convert original samples to analog domain and then resample to
generate new samples
I filter original samples with a discrete-time linear time-varying
system to generate new samples
Chapter 11: Multirate Digital Signal Processing 11.1 Introduction Chapter 11: Multirate Digital Signal Processing 11.1 Introduction
Sampling Rate Conversion Ideal Sampling Rate Conversion

1
I x(n): original samples at sampling rate Fx = Tx
I y (n): new samples at sampling rate Fy = T1y
original/bandlimited x(n)
interpolated signal x(t) 1 y(n) original/bandlimited
0 interpolatedn signal x(t) 1 x(n)
I x(n): original samples at sampling rate Fx

I y (n): new samples at sampling rate Fy
0
y(n)
Parameter Relationships Bridging the Parameter Relationships

Ty
I related to the ratio:
SAMPLING RATE Tx
CONVERSION
Tx
Fy = · Fx
Ty
2πF
ωx = 2πfx =
Fy
Parameter/Variable x(n) ≡ x(nTx ) y (m) ≡ y (mTy ) 2πF
ωy = 2πfy =
Rate Fx Fy Fy
Period Tx Ty Fy Tx
ωx = · ωy = · ωy
Dst-time Frequency ωx ωy Fx Ty
Cts-time Frequency F F
Implementation of Sampling Rate Conversion Implementation of Sampling Rate Conversion

We relate the original samples x(nTx ) to the new samples y (mTy ) by
assuming we convert the signal to analog and resample. Using the ∞
X
interpolation formula y (t) = x(nTx )g (t − nTx )
n=−∞
∞
∞
X
X y (mTy ) = x(nTx ) g (mTy − nTx )
y (t) = x(nTx )g (t − nTx ) | {z } | {z } | {z }
n=−∞
n=−∞ desired samples original samples samples of g (t)
where

sin(πt/Tx ) F Tx |F | ≤ Fx < 2
g (t) = ←→ G (F ) =
πt/Tx 0 otherwise
Note: y (t) = x(t) if x(t) is sampled above Nyquist.
∞
X
y (t) = x(nTx )g (t − nTx )
n=−∞ mTy
∞ = km + ∆ m
X Tx |{z} |{z}
y (mTy ) = x(nTx )g (mTy − nTx ) integer remainder
n=−∞

mTy
∞ km =
X mTy Tx
= x(nTx )g Tx −n
Tx

n=−∞ mTy mTy
∆m = − ∈ [0, 1)
mTy Tx Tx
= km + ∆ m
Tx

∞
XmTy
y (mTy ) = x(nTx )g Tx −n ∞
T
X
n=−∞ x y (mTy ) = g ((k + ∆m )Tx )x((km − k)Tx )
∞
X k=−∞
= x(nTx )g (Tx (km + ∆m − n))
n=−∞ I ∆m : determines the set of weights
let k = km − n I km : specifies the set of input samples
∞
X
= x((km − k)Tx )g (Tx (k + ∆m )) I represents a discrete-time linear time-varying system
k=−∞ I every output sample m requires use of a different impulse
X∞ response/ceofficient set:
= g ((k + ∆m )Tx )x((km − k)Tx )
k=−∞ gm (nTx ) = g ((n + ∆m )Tx )

mTy mTy
| {z }
weighted linear combination of orig samples ∆m = − ∈ [0, 1)
Tx Tx
Implementation of Sampling Rate Conversion Linear Periodically Time-Varying Implementation
∞
X I significant simplification possible for TTyx = Fx
Fy
= D
I
y (mTy ) = g ((k + ∆m )Tx )x((km − k)Tx ) where D, I ∈ Z+ and GCD(D, I ) = 1
k=−∞
X∞
= g ((k + ∆m )Tx )x((km − k)Tx )

mTy mTy mD mD
k=−∞ ∆m = − = −
Tx Tx I I

1 mD 1
I gm (nTx ) may have to be retrieved or computed = mD − I = (mD) mod I
I I I
I in general, there are as many weights/coefficients required as 1
input samples × output values to compute = (mD)I
I
I in general, no simplification is possible making computation of
y (mTy ) from x(nTx ) impractical
Linear Periodically Time-Varying Implementation Linear Periodically Time-Varying Implementation
Furthermore, for r ∈ Z:
Note: 1 1
∆m+rI =((m + rI )D)I = (mD + rlD)I
I I
(mD)I ∈ {0, 1, 2, . . . , I − 1} 1
1 = (mD)I = ∆m
∆m = (mD)I ∈ {0, 1/I , 2/I , . . . , (I − 1)/I } I
I ∴ gm+r I (nTx ) = gm (nTx ), r ∈ Z
I gm (nTx ) = g ((n + ∆m )Tx ) consists only of I distinct sets of

coefficients!
I gm (nTx ) = gm+rI (nTx ) represents a discrete-time periodically
time-varying system!
Linear Periodically Time-Varying Implementation Decimation/Downsampling

original/bandlimited
interpolated signal 1
0
n
Ty
Ty = DTx =⇒ = D, D ∈ Z+
T
x
mTy
km = = bmDc = mD ∵ mD ∈ Z
Tx

mTy mTy
∆m = − = mD − bmDc = mD − mD = 0
Tx Tx
original/bandlimited original/bandlimited
interpolated signal 1 interpolated signal 1
0
n 0
n
∞
X ∞
X
y (mTy ) = g ((n + ∆m )Tx )x((km − n)Tx ) y (mTy ) = g (nTx )x((mD − n)Tx )
n=−∞ n=−∞
∞ ∞
X X sin(πn)
= g ((n + 0)Tx )x((mD − n)Tx ) = x((mD − n)Tx )
n=−∞ n=−∞
πn
X∞ ∞
X
= g (nTx )x((mD − n)Tx ) = δ(n)x((mD − n)Tx ) = x(mDTx )
n=−∞ n=−∞
| {z }
dst-time convolution
See Figure 11.1.3 of text .
Interpolation/Upsampling Interpolation/Upsampling
∞
X
y (mTy ) = x(nTx )g (mTy − nTx )
original/bandlimited n=−∞
interpolated signal 1 ∞
X Tx
= x(nTx )g (m − nTx )
0
n n=−∞
I
∞
X sin(π mI − πn)
Ty 1 = x(nTx )
Tx = ITy =⇒ = , I ∈ Z+ π mI − πn
T I n=−∞
xj k ∞
sin( πI (m − nI ))

mTy m X
km = = = x(nTx ) π
Tx I (m − nI )
n=−∞ | I {z
mTy mTy m jmk
}
sinc centered at n = m/I
∆m = − = −
Tx Tx I I
∈ {0, 1/I , 2/I , . . . , (I − 1)/I } See Figure 11.1.4 of text .
Chapter 11: Multirate Digital Signal Processing 11.2 Decimation by a Factor D Chapter 11: Multirate Digital Signal Processing 11.2 Decimation by a Factor D
Decimator
Downsampling with Anti-Alaising Filter LTI Filter Downsampler
Decimator
LTI Filter Downsampler
∞
X
v (n) = h(k)x(n − k)
I Downsampling alone may cause aliasing, therefore, it is desirable k=−∞
to introduce an anti-aliasing filter Hd (ωx ) ∞
Interpolator X Decimator
Upsamplery (m) = v (mD) = h(k)x(mD − k)
LTI Filter LTI Filter Downsampler
k=−∞
Interpolator Decimator | {z }
Upsampler LTI Filter LTI Filter Downsampler linear time-varying system
Downsampling: Frequency Domain Perspective Aside: Impulse Train p(n)

Goal: determine relationship between input-output spectra ∞
X
p(n) = δ(n − lD) (periodic with period D)
l=−∞
Create an intermediate signal ṽ (n) at rate Fx but with the equivalent D−1
information as y (m). 1 X
ck = p(n)e j2πkn/D
D n=0

v (n) n = 0, ±D, ±2D, . . . D−1 ∞
ṽ (n) = =
X X
δ(n − lD) e j2πkn/D
0 otherwise
n=0 l=−∞
X∞ | {z }
= v (n) · p(n) where p(n) = δ(n − kD) zero for l 6= 0
D−1
k=−∞ 1 X 1
= δ(n)e j2πkn/D =
Note: y (m) = v (mD) · 1 = v (mD) · p(mD) = ṽ (mD) D n=0 D
y (m) ←→ ṽ (n) (equiv info) D−1
X D−1
1 X j2πkm/D
p(n) = ck e j2πkm/D = e
D
k=0 k=0
See Figure 11.2.2 of text .
Decimator
Downsampling: Frequency Domain Perspective LTI Filter Downsampler
∞
X ∞
X
Y (z) = y (m)z −m = ṽ (mD)z −m
m=−∞ m=−∞
= · · · + ṽ (−D)z 1 + ṽ (0)z + ṽ (D)z −1 + · · ·

0
∞
X 0
= ṽ (m0 )z −m /D since ṽ (m) = 0 for m 6∈ {0, ±D, ±2D, . . .}
m0 =−∞
∞ ∞ D−1
X
−m/D
X 1 X j2πkm/D −m0 /D
= v (m)p(m)z = v (m) e z In the preceding analysis, we employed:
D
m0 =−∞ m=−∞ k=0 Z
D−1 ∞ v (n) ←→ V (z)
1 X X
= v (m)(e −j2πk/D z 1/D )−m hd (n) ←→
Z
Hd (z)
D m=−∞
k=0
| {z } Interpolator
x(n) ←→
Z
X (z) Decimator
≡V (e −j2πk/D z 1/D )=Hd (e −j2πk/D z 1/D )X (e −j2πk/D ) Upsampler LTI Filter X∞ LTI Filter Downsampler
D−1
1 X V (z) = v (m)z −m
= Hd (e −j2πk/D z 1/D )X (e −j2πk/D z 1/D ) m=−∞
D
k=0 V (z) = Hd (z) · X (z)
jωy
Let z = e :
D−1
D−1 1 X ωy − 2πk ωy − 2πk
1 X Y (ωy ) = Hd X
Y (z) = Hd (e −j2πk/D z 1/D )X (e −j2πk/D z 1/D ) D
k=0
D D
D
k=0
D−1
For −π ≤ ωy ≤ π,
1 X
Y (e jωy ) = Hd (e −j2πk/D e jωy 1/D )X (e −j2πk/D e jωy 1/D ) − Dπ ≤
ωy −2πk
≤ Dπ for k = 0
D D
ωy −2πk
k=0
− 3π
D ≤ D ≤ − Dπ for k = 1
D−1 .. ..
1 X
= Hd (e j(ωy −2πk)/D )X (e j(ωy −2πk)/D ) . .
D π ωy −2πk 3π
k=0 −2π + D ≤ D ≤ −2π + D for k = D − 1
D−1
1 X ωy − 2πk ωy − 2πk
Y (ωy ) = Hd X
D D D
k=0
Decimator
LTI Filter Downsampler
Note: For −π ≤ ωy ≤ π,

ωy − 2πk 1 for k = 0
Hd =
D 0 for k = 1, 2, . . . , D − 1
Chapter 11: Multirate Digital Signal Processing 11.2 Decimation by a Factor D Chapter 11: Multirate Digital Signal Processing 11.3 Interpolation by a Factor I
Therefore, for −π ≤ ωy ≤ π,
Interpolation by a Factor I
D−1
Interpolator

1 X ωy − 2πk ωy − 2πk
Y (ωy ) = Hd X
D D D Upsampler LTI Filter
k=0
1 ω ω 1 D−1
ωy − 2πk

ωy − 2πk

y y
X
= Hd X + Hd X
D | {zD } D D D D
k=1 | {z }
=1 =0
1 ωy
Y (ωy ) = D
X D
Note: ωy =
Ty
ωx = Dωx .
I Interpolation only increases the visible resolution of the signal.
Tx
I No information gain is achieved. At best Hu (ωy ) maintains the
− Dπ ≤ ωx ≤ π
D of X (ωx ) is stretched into −π ≤ ωy ≤ π for Y (ωy ). same information in y (n) as exists in x(n).
See Figure 11.2.3 of text . Interpolator Decimator
LTI Filter LTI Filter Downsampler
Chapter 11: Multirate Digital Signal Processing 11.3 Interpolation by a Factor I Chapter 11: Multirate Digital Signal Processing 11.3 Interpolation by a Factor I
Goal: determine relationship between input-output spectra
Consider an intermediate signal v (n) at rate Fy but with the equivalent V (ωy ) = X (ωy I )
information as x(m). See Figure 11.3.1 of text .

x(m/I ) m = 0, ±I , ±2I , . . .

v (m) = 0 ≤ |ωy | ≤ π/I
I
0 otherwise Hu (ωy ) =
0
otherwise
∞
X IX (ωy I ) 0 ≤ |ωy | ≤ π/I
V (z) = v (m)z −m = · · · + v (−I )z I + v (0)z 0 + v (I )z −I + · · · Y (ωy ) = Hu (ωy )V (ωy ) =
0 otherwise
m=−∞
∞ ∞
X X −m
= x(m)z −mI = x(m)(z I ) = X (z I )

m=−∞ m=−∞ I X (ωy I ) 0 ≤ |ωy | ≤ π/I
Y (ωy ) =
V (e jωy ) = X (e jωy I ) =⇒ V (ωy ) = X (ωy I ) 0 otherwise
Interpolator
Upsampler LTI Filter Ty ωx
Note: ωy = Tx = I .
−π ≤ ωx ≤ π is compressed into −π/I ≤ ωy ≤ π/I
Interpolator
Upsampler LTI Filter
∞
X
y (m) = hu (m − k)v (k)
k=−∞

m = 0, ±I , ±2I , . . .
x(m/I )
∵ v (m) = ⇒ v (k) = 0 for (k)I 6= 0
Interpolator
0
otherwise Decimator
X∞ LTI Filter ∞
X LTI Filter Downsampler
∴ y (m) = hu (m − kI ) v (kI ) = hu (m − kI )x(k)
| {z }
k=−∞ k=−∞
=x(k) | {z }
linear time-varying system
Return

Return
Return
Return Return

Kundur DTS Chap11a PDF

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Kundur DTS Chap11a PDF

Încărcat de

Drepturi de autor:

Formate disponibile

Chapter 11: Multirate Digital Signal Processing

Discrete-Time Signals and Systems

Multirate Digital Signal Processing: Part I Reference:

Dr. Deepa Kundur Sections 11.1-11.3 of

Multirate DSP Sampling vs. Sampling Rate Conversion

I sampling rate conversion: process of converting a given discrete time instants

Sampling Rate Conversion Ideal Sampling Rate Conversion

I x(n): original samples at sampling rate Fx

Parameter Relationships Bridging the Parameter Relationships

Implementation of Sampling Rate Conversion Implementation of Sampling Rate Conversion

Note: y (t) = x(t) if x(t) is sampled above Nyquist.

Implementation of Sampling Rate Conversion Implementation of Sampling Rate Conversion

Implementation of Sampling Rate Conversion Implementation of Sampling Rate Conversion

Implementation of Sampling Rate Conversion Linear Periodically Time-Varying Implementation

Linear Periodically Time-Varying Implementation Linear Periodically Time-Varying Implementation

I gm (nTx ) = g ((n + ∆m )Tx ) consists only of I distinct sets of

Linear Periodically Time-Varying Implementation Decimation/Downsampling

Downsampling: Frequency Domain Perspective Aside: Impulse Train p(n)

= · · · + ṽ (−D)z 1 + ṽ (0)z + ṽ (D)z −1 + · · ·

Goal: determine relationship between input-output spectra

−π ≤ ωx ≤ π is compressed into −π/I ≤ ωy ≤ π/I

S-ar putea să vă placă și