Polyphase matrix

From Wikipedia, the free encyclopedia

In signal processing, a polyphase matrix is a matrix whose elements are filter masks. It represents a filter bank as it is used in sub-band coders alias discrete wavelet transforms.^[1]

If $\scriptstyle h,\,g$ are two filters, then one level the traditional wavelet transform maps an input signal $\scriptstyle a_{0}$ to two output signals $\scriptstyle a_{1},\,d_{1}$ , each of the half length:

${\begin{aligned}a_{1}&=(h\cdot a_{0})\downarrow 2\\d_{1}&=(g\cdot a_{0})\downarrow 2\end{aligned}}$

Note, that the dot means polynomial multiplication; i.e., convolution and $\scriptstyle \downarrow$ means downsampling.

If the above formula is implemented directly, you will compute values that are subsequently flushed by the down-sampling. You can avoid that by splitting the filters and the signal into even and odd indexed values before the transformation.

${\begin{array}{rclcrcl}h_{{{\mbox{e}}}}&=&h\downarrow 2&\qquad &a_{{0,{\mbox{e}}}}&=&a_{0}\downarrow 2\\h_{{{\mbox{o}}}}&=&(h\leftarrow 1)\downarrow 2&&a_{{0,{\mbox{o}}}}&=&(a_{0}\leftarrow 1)\downarrow 2\end{array}}$

The arrows $\scriptstyle \leftarrow$ and $\scriptstyle \rightarrow$ denote left and right shifting, respectively. They shall have the same precedence like convolution, because they are in fact convolutions with a shifted discrete delta impulse.

$\delta =(\dots ,0,0,{\underset {0-{\mbox{th position}}}{1}},0,0,\dots )$

The wavelet transformation reformulated to the split filters is:

${\begin{aligned}a_{1}&=h_{{{\mbox{e}}}}\cdot a_{{0,{\mbox{e}}}}+h_{{{\mbox{o}}}}\cdot a_{{0,{\mbox{o}}}}\rightarrow 1\\d_{1}&=g_{{{\mbox{e}}}}\cdot a_{{0,{\mbox{e}}}}+g_{{{\mbox{o}}}}\cdot a_{{0,{\mbox{o}}}}\rightarrow 1\end{aligned}}$

This can be written as matrix-vector-multiplication

${\begin{aligned}P&={\begin{pmatrix}h_{{{\mbox{e}}}}&h_{{{\mbox{o}}}}\rightarrow 1\\g_{{{\mbox{e}}}}&g_{{{\mbox{o}}}}\rightarrow 1\end{pmatrix}}\\{\begin{pmatrix}a_{1}\\d_{1}\end{pmatrix}}&=P\cdot {\begin{pmatrix}a_{{0,{\mbox{e}}}}\\a_{{0,{\mbox{o}}}}\end{pmatrix}}\end{aligned}}$

This matrix $\scriptstyle P$ is the polyphase matrix.

Of course, a polyphase matrix can have any size, it need not to have square shape. That is, the principle scales well to any filterbanks, multiwavelets, wavelet transforms based on fractional refinements.

Properties

The representation of sub-band coding by the polyphase matrix is more than about write simplification. It allows the adaptation of many results from matrix theory and module theory. The following properties are explained for a $\scriptstyle 2\,\times \,2$ matrix, but they scale equally to higher dimensions.

Invertibility/perfect reconstruction

The case that a polyphase matrix allows reconstruction of a processed signal from the filtered data, is called perfect reconstruction property. Mathematically this is equivalent to invertibility. According to the theorem of invertibility of a matrix over a ring, the polyphase matrix is invertible if and only if the determinant of the polyphase matrix is a Kronecker delta, which is zero everywhere except for one value.

${\begin{aligned}\det P&=h_{{{\mbox{e}}}}\cdot g_{{{\mbox{o}}}}-h_{{{\mbox{o}}}}\cdot g_{{{\mbox{e}}}}\\\exists A\ A\cdot P&=I\iff \exists c\ \exists k\ \det P=c\cdot \delta \rightarrow k\end{aligned}}$

By Cramer's rule the inverse of $\scriptstyle P$ can be given immediately.

$P^{{-1}}\cdot \det P={\begin{pmatrix}g_{{{\mbox{o}}}}\rightarrow 1&-h_{{{\mbox{o}}}}\rightarrow 1\\-g_{{{\mbox{e}}}}&h_{{{\mbox{e}}}}\end{pmatrix}}$

Orthogonality

Orthogonality means that the adjoint matrix $\scriptstyle P^{*}$ is also the inverse matrix of $\scriptstyle P$ . The adjoint matrix is the transposed matrix with adjoint filters.

$P^{*}={\begin{pmatrix}h_{{{\mbox{e}}}}^{*}&g_{{{\mbox{e}}}}^{*}\\h_{{{\mbox{o}}}}^{*}\leftarrow 1&g_{{{\mbox{o}}}}^{*}\leftarrow 1\end{pmatrix}}$

It implies, that the Euclidean norm of the input signals is preserved. That is, the according wavelet transform is an isometry.

$||a_{1}||_{2}^{2}+||d_{1}||_{2}^{2}=||a_{0}||_{2}^{2}$

The orthogonality condition

$P\cdot P^{*}=I$

can be written out

${\begin{aligned}h_{{{\mbox{e}}}}^{*}\cdot h_{{{\mbox{e}}}}+h_{{{\mbox{o}}}}^{*}\cdot h_{{{\mbox{o}}}}&=\delta \\g_{{{\mbox{e}}}}^{*}\cdot g_{{{\mbox{e}}}}+g_{{{\mbox{o}}}}^{*}\cdot g_{{{\mbox{o}}}}&=\delta \\h_{{{\mbox{e}}}}^{*}\cdot g_{{{\mbox{e}}}}+h_{{{\mbox{o}}}}^{*}\cdot g_{{{\mbox{o}}}}&=0\end{aligned}}$

Operator norm

For non-orthogonal polyphase matrices the question arises what Euclidean norms the output can assume. This can be bounded by the help of the operator norm.

$\forall x\ \|P\cdot x\|_{2}\in \left[\|P^{{-1}}\|_{2}^{{-1}}\cdot \|x\|_{2},\|P\|_{2}\cdot \|x\|_{2}\right]$

For the $\scriptstyle 2\,\times \,2$ polyphase matrix the Euclidean operator norm can be given explicitly using the Frobenius norm $\scriptstyle \|\cdot \|_{F}$ and the z transform $\scriptstyle Z$ :^[2]

${\begin{aligned}p(z)&={\frac {1}{2}}\cdot \|ZP(z)\|_{F}^{2}\\q(z)&=\left|\det[ZP(z)]\right|^{2}\\\|P\|_{2}&=\max \left\{{\sqrt {p(z)+{\sqrt {p(z)^{2}-q(z)}}}}:z\in {\mathbb {C}}\ \land \ |z|=1\right\}\\\|P^{{-1}}\|_{2}^{{-1}}&=\min \left\{{\sqrt {p(z)-{\sqrt {p(z)^{2}-q(z)}}}}:z\in {\mathbb {C}}\ \land \ |z|=1\right\}\end{aligned}}$

This is a special case of the $n\times n$ matrix where the operator norm can be obtained via z transform and the spectral radius of a matrix or the according spectral norm.

${\begin{aligned}\|P\|_{2}&={\sqrt {\max \left\{\lambda _{{{\mbox{max}}}}\left[ZP^{*}(z)\cdot ZP(z)\right]:z\in {\mathbb {C}}\ \land \ |z|=1\right\}}}\\&=\max \left\{\|ZP(z)\|_{2}:z\in {\mathbb {C}}\ \land \ |z|=1\right\}\\\|P^{{-1}}\|_{2}^{{-1}}&={\sqrt {\min \left\{\lambda _{{{\mbox{min}}}}\left[ZP^{*}(z)\cdot ZP(z)\right]:z\in {\mathbb {C}}\ \land \ |z|=1\right\}}}\end{aligned}}$

A signal, where these bounds are assumed can be derived from the eigenvector corresponding to the maximizing and minimizing eigenvalue.

Lifting scheme

The concept of the polyphase matrix allows matrix decomposition. For instance the decomposition into addition matrices leads to the lifting scheme.^[3] However, classical matrix decompositions like LU and QR decomposition cannot be applied immediately, because the filters form a ring with respect to convolution, not a field.

References

↑ Strang, Gilbert; Nguyen, Truong (1997). Wavelets and Filter Banks. Wellesley-Cambridge Press. ISBN 0-9614088-7-1.
↑ Thielemann, Henning (2001). Adaptive construction of wavelets for image compression (Diploma thesis). Martin-Luther-Universität Halle-Wittenberg, Fachbereich Mathematik/Informatik.
↑ Daubechies, Ingrid; Sweldens, Wim (1998). "Factoring wavelet transforms into lifting steps". J. Fourier Anal. Appl. 4 (3). pp. 245–267.

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.