Polyphase Channelizer Transformation
Polyphase Channelizer Transformation
Transformation
1/259
Transformation (Step 1)
Equivalence Theorem:
y ( n , k ) = [ x ( n ) e − jn θ k ] * h ( n )
N −1
y (n, k ) = ∑ x [ n − r ]e − j θ k
( n−r )
h(r )
r =0
N −1 jr θ k
= ∑ x [ n − r ]e
r =0
− jn θ k
h (r )e
N −1 jr θ k
=e − jn θ k
∑ x[ n − r ]h ( r ) e
r =0
2/259
Equivalence Theorem &
Sequence of maneuvers
4/259
Transformation (Step 2)
N −1
H (z) = ∑
n=0
Z −n
h(n)
M −1
= ∑
r =0
Z −r
H r (Z M
)
M −1 ( N / M ) −1
= ∑Z
r =0
−r
∑ h ( r + nM
n=0
)Z − Mn
5/259
Transformation (Step 2)
N −1
H ( z ) = ∑ Z − h(n)
n
n=0
G ( z ) = H ( z ) | z = e jϑ z = H ( e − j ϑ z )
M −1
H ( ze − j ( 2π / M ) k
)= ∑ e
Z − r j ( 2 π / M ) rk
r =0
H r ( z)
M −1
y ( nM , k ) = ∑
r =0
y r ( nM ) e j ( 2π / M ) rk
fs = N * Δ f
6/259
Phase Coherent summation & FFT
7/259
Polyphase Channelizer
8/259
Pipelined Frequency Transform
9/259
Comparison & Selection
10/259
Polyphase filter bank parameters
fs = N * Δ f
• DFT performs the task of seperating the channels after polyphase
filter, so it is natural to conclude that transform size is equal to
number of channels.
• The filter bandwidth is determined by the weights of the lowpass
prototype filter, and it is common for all the channels.
• Channelizer is used to seperate the adjacent communication
channels, which are characterized by the specifc center frequency
and non-overlapping bandwidth
11/259
Maximally & Non-Maximally
Decimated System
Maximally Decimated
Non-Maximally Decimated
12/259
Computational Complexity
13/259
Prototype Filter Work Load
14/259
Polyphase Filter Work Load
15/259
Computational Complexity
Yes
16/259
Computational Complexity
1792 ops. once per 48 input
work load = 1792/48 = 38 ops/input.
Note:
Polyphase channelizer forms 64 channels at the output and therefore, we
conclude that polyphase form should be used even if just few output
channels are required.
17/259