5
$\begingroup$

I'm a beginner in DSP and I'm going through the textbook of Oppenheim's Discrete Time Signal Processing. There are two figures in the text, one which I can visualize, and the other I can't. The first figure shows the polyphase decomposition of an impulse response function: enter image description here

I get why the $z^{-n}$ is placed after the upsampling operation. After the zeros are added during the upsampling operation, appropriate delays need to be added so that the sum gives the original impulse response. The next step taken in the textbook isn't clear to me. I do not get why the $z$ delays are added before the polyphase components in the second figure, as shown below: enter image description here

Doing so suggests the delay operation is commutative with the expansion, but I cannot convince myself that it is right. I tried doing that for the first figure and I do not get the same results. Is there something I'm misunderstanding here?

Thanks.

$\endgroup$

3 Answers 3

3
$\begingroup$

Note that the delay in the figure $4.37$ does not represent a commutation of delay $z^{-k}$ and an expander, but a commutation of delay $z^{-k}$ and polyhase branch filter $E_k(z^M)$ which is an LTI system; hence the commutation poses no problem.

In other words, the following branches

$$ x_k[n] \longrightarrow \boxed{ E_k(z^M) } \longrightarrow \boxed{z^{-k}} \longrightarrow y_k[n] $$

and

$$ x_k[n] \longrightarrow \boxed{ z^{-k} } \longrightarrow \boxed{E_k(z^M)} \longrightarrow y_k[n] $$

are identical since $E_k(z^M)$ is an LTI filter.

$\endgroup$
2
  • 1
    $\begingroup$ Thanks, your distinction between which commutation the operation represents helped clear my source of confusion. $\endgroup$
    – Lim LS
    Commented Nov 11, 2019 at 19:17
  • $\begingroup$ You're welcome ! Note that as you know it right, the expander is not an LTI system and would not commute with a delay system. $\endgroup$
    – Fat32
    Commented Nov 11, 2019 at 20:22
4
$\begingroup$

The polyphase components of $h[n]$ are

$$e_k[n]=h[Mn+k]\tag{1}$$

Note that if $h[n]$ starts at $n=0$, then so do all polyphase components $e_k[n]$. In order to get back the original sequence $h[n]$ from the polyphase components $e_k[n]$, we need to insert $M-1$ zeros between the samples of $e_k[n]$, and shift each component back to its original position, i.e. shift $e_k[n]$ by $k$ samples. In the frequency domain this corresponds to

$$H(z)=\sum_{k=0}^{M-1}E_k(z^M)z^{-k}\tag{2}$$

Filtering an input signal with $\mathcal{Z}$-transform $X(z)$ results in

$$Y(z)=H(z)X(z)=\sum_{k=0}^{M-1}X(z)E_k(z^M)z^{-k}\tag{3}$$

which corresponds to the structure in figure $4.37$ in Oppenheim and Schafer. The terms $E_k(z^M)z^{-k}$ can clearly be implemented either by delaying the input or the output of the polyphase components:

$$X(z)\left[E_k(z^M)z^{-k}\right]=\left[X(z)z^{-k}\right]E_k(z^M)$$

$\endgroup$
4
$\begingroup$

These relationships are known as the multirate Noble Identities where in general you can change the order of an upsampling and delays if you change the exponent of the delay elements appropriately.

(Coined "Noble Indentities" by P.P. Viayadanathan according to fred harris).

Multirate Noble Identities

$\endgroup$
3
  • 1
    $\begingroup$ well, if no one else does, you get a ^ arrow from me. $\endgroup$ Commented Nov 11, 2019 at 17:54
  • $\begingroup$ @robertbristow-johnson well... why not also me.. :-) $\endgroup$
    – Fat32
    Commented Nov 11, 2019 at 20:25
  • $\begingroup$ i didn't see your answer at first. $\endgroup$ Commented Nov 11, 2019 at 23:25

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.