Line 57: Line 57:
  
 
<span style="color:green"> To be consistent with the problem statement, frequency notation<math>\mu</math> corresponds to the spatial notation <math>m </math> and is the first parameter. As a result, the solution of the (a) and (b) can be switched. </span>
 
<span style="color:green"> To be consistent with the problem statement, frequency notation<math>\mu</math> corresponds to the spatial notation <math>m </math> and is the first parameter. As a result, the solution of the (a) and (b) can be switched. </span>
 
  
 
c)  
 
c)  
 
+
They do not; <math>{{p}_{0}}(n)\ and\ {{p}_{1}}(m)</math> are projections at two angles, and do not contain enough information to reconstruct x(m,n).
c) <br> <math>
+
<math>
\sum\limits_{n=-\infty }^{\infty }{{{p}_{0}}(n)}==\sum\limits_{n=-\infty }^{\infty }{\sum\limits_{m=-\infty }^{\infty }{x(m,n)}}=X({{e}^{j0}},{{e}^{j0}})
+
\begin{align}
</math>  
+
  & X({{e}^{j\mu }},{{e}^{j\upsilon }})=\sum\limits_{m=-\infty }^{\infty }{\left[ \sum\limits_{n=-\infty }^{\infty }{x(m,n)} \right]}{{e}^{-jm\mu }}{{e}^{-jn\upsilon }} \\
 
+
  & X({{e}^{j\mu }},{{e}^{j\upsilon }})\ne \sum\limits_{m=-\infty }^{\infty }{{{p}_{1}}(m)}{{e}^{-jm\mu }}{{e}^{-jn\upsilon }}\ne {{P}_{1}}({{e}^{j\mu }}){{e}^{-jn\upsilon }} \\  
d)No. ''P''<sub>''0 &nbsp;''</sub>''only&nbsp;''represents the&nbsp;<span class="texhtml">μ</span>&nbsp;axis on <span class="texhtml">''X''(''e''<sup>''j''μ</sup>,''e''<sup>''j''ν</sup>)</span>. ''P<sub>1</sub>''&nbsp;only represents the <span class="texhtml">ν</span>&nbsp;axis on <span class="texhtml">''X''(''e''<sup>''j''μ</sup>,''e''<sup>''j''ν</sup>)</span>. It is not enough to represent&nbsp;<span class="texhtml">''X''(''e''<sup>''j''μ</sup>,''e''<sup>''j''ν</sup>)</span>.
+
& \Rightarrow Can't_{{}}^{{}}do_{{}}^{{}}it!
 
+
\end{align}</math>
<span style="color:green"> Similarly to the above comment, <math>P_0(e^{jw}) </math>is the slice along <math>\nu </math> axis. </span>
+
 
+
For example, assume two different array x''<sub>1</sub>'' and x''<sub>2</sub>''.
+
 
+
<math>x_1 = \left [
+
    \begin{array}{cc}
+
    3 & 4 \\
+
    5 & 6
+
    \end{array}
+
    \right ]</math>&nbsp;and&nbsp;<math>x_2 = \left [
+
    \begin{array}{cc}
+
    4 & 3 \\
+
    4 & 7
+
    \end{array}
+
    \right ]</math>&nbsp;have the same&nbsp;<span class="texhtml">''p''<sub>0&nbsp;</sub>and''&nbsp;p''<sub>1</sub>'''<sub>.&nbsp;</sub>'''</span>  
+
  
 
<span class="texhtml">'''<sub></sub>'''</span>Therefore, ''P''<sub>''0''</sub> and ''P''<sub>''1''</sub> will be the same for ''X<sub>0</sub>'' and ''X<sub>1</sub>''. We will not be able to recover x<sub><span style="font-size: 11px;">''0''</span></sub>&nbsp;and x<sub><span style="font-size: 11px;">''1''</span></sub>&nbsp;based on ''P''<sub>''0''</sub> and ''P''<sub>''1''</sub>.&nbsp;  
 
<span class="texhtml">'''<sub></sub>'''</span>Therefore, ''P''<sub>''0''</sub> and ''P''<sub>''1''</sub> will be the same for ''X<sub>0</sub>'' and ''X<sub>1</sub>''. We will not be able to recover x<sub><span style="font-size: 11px;">''0''</span></sub>&nbsp;and x<sub><span style="font-size: 11px;">''1''</span></sub>&nbsp;based on ''P''<sub>''0''</sub> and ''P''<sub>''1''</sub>.&nbsp;  

Revision as of 20:45, 1 May 2017


ECE Ph.D. Qualifying Exam in Communication Networks Signal and Image processing (CS)

= Question 5, August 2013(Published on May 2017),

Problem 1,2



Solution 1:

a) $ {{P}_{0}}({{e}^{j\omega }})=\sum\limits_{n=-\infty }^{\infty }{{{p}_{0}}(n){{e}^{-jn\omega }}}=\sum\limits_{n=-\infty }^{\infty }{\left( \sum\limits_{m=-\infty }^{\infty }{x(m,n)} \right){{e}^{-jn\omega }}}=\sum\limits_{m=-\infty }^{\infty }{\sum\limits_{n=-\infty }^{\infty }{x(m,n)}{{e}^{-j(m0+n\omega )}}=X({{e}^{j0}},{{e}^{j\omega }})} $

b) $ {{P}_{1}}({{e}^{j\omega }})=\sum\limits_{m=-\infty }^{\infty }{{{p}_{1}}(m){{e}^{-jm\omega }}}=\sum\limits_{m=-\infty }^{\infty }{\left( \sum\limits_{n=-\infty }^{\infty }{x(m,n)} \right){{e}^{-jm\omega }}}=\sum\limits_{m=-\infty }^{\infty }{\sum\limits_{n=-\infty }^{\infty }{x(m,n)}{{e}^{-j(m\omega +n0)}}=X({{e}^{j\omega }},{{e}^{j0}})} $

The solution used $ v $ and $ \mu $ to represent frequency axis. It used $ w $ to subuslitude both $ v $ and $ \mu $ which is confusing. The solution should stated let $ w=v $ and $ w=\mu $ at (a) and (b).

c)
$ \sum\limits_{n=-\infty }^{\infty }{{{p}_{0}}(n)}==\sum\limits_{n=-\infty }^{\infty }{\left( \sum\limits_{m=-\infty }^{\infty }{x(m,n)} \right)}=\sum\limits_{m=-\infty }^{\infty }{\sum\limits_{n=-\infty }^{\infty }{x(m,n)}{{e}^{-j(m0+n0)}}=X({{e}^{j0}},{{e}^{j0}})} $

d) No, they don’t. From part (a) and (b), we know that $ {{P}_{0}}({{e}^{jw}}) $ and $ {{P}_{1}}({{e}^{jw}}) $ represent the horizontal and vertical axes of the 2D DSFT $ X({{e}^{j\mu }},{{e}^{j\upsilon }}) $, which is not enough for reconstruction of x(m, n). For example, $ {{x}_{1}}(m,n)=\left( \begin{matrix} 1 & 3 \\ 2 & 4 \\ \end{matrix} \right),_{{}}^{{}}and_{{}}^{{}}{{x}_{2}}(m,n)=\left( \begin{matrix} 0 & 4 \\ 3 & 3 \\ \end{matrix} \right) $ have the same $ {{p}_{0}}(n)=\left[ \begin{matrix} 3 & 7 \\ \end{matrix} \right]_{{}}^{{}}and_{{}}^{{}}{{p}_{1}}(m)=\left[ \begin{matrix} 4 \\ 6 \\ \end{matrix} \right] $. So, x(m,n) can’t be reconstructed from $ {{p}_{0}}(n)=\left[ \begin{matrix} 3 & 7 \\ \end{matrix} \right]_{{}}^{{}}and_{{}}^{{}}{{p}_{1}}(m)=\left[ \begin{matrix} 4 \\ 6 \\ \end{matrix} \right] $.

Solution 2:

a) $ {{P}_{0}}({{e}^{j\omega }})=\sum\limits_{n=-\infty }^{\infty }{\sum\limits_{m=-\infty }^{\infty }{x(m,n)} {{e}^{-jn\omega }}}=X({{e}^{j0}},{{e}^{j\omega }}) $

b) $ {{P}_{1}}({{e}^{j\omega }})=\sum\limits_{m=-\infty }^{\infty }{\sum\limits_{n=-\infty }^{\infty }{x(m,n)}{{e}^{-jm\omega }}}=X({{e}^{j\omega }},{{e}^{j0}}) $


To be consistent with the problem statement, frequency notation$ \mu $ corresponds to the spatial notation $ m $ and is the first parameter. As a result, the solution of the (a) and (b) can be switched.

c) They do not; $ {{p}_{0}}(n)\ and\ {{p}_{1}}(m) $ are projections at two angles, and do not contain enough information to reconstruct x(m,n). $ \begin{align} & X({{e}^{j\mu }},{{e}^{j\upsilon }})=\sum\limits_{m=-\infty }^{\infty }{\left[ \sum\limits_{n=-\infty }^{\infty }{x(m,n)} \right]}{{e}^{-jm\mu }}{{e}^{-jn\upsilon }} \\ & X({{e}^{j\mu }},{{e}^{j\upsilon }})\ne \sum\limits_{m=-\infty }^{\infty }{{{p}_{1}}(m)}{{e}^{-jm\mu }}{{e}^{-jn\upsilon }}\ne {{P}_{1}}({{e}^{j\mu }}){{e}^{-jn\upsilon }} \\ & \Rightarrow Can't_{{}}^{{}}do_{{}}^{{}}it! \end{align} $

Therefore, P0 and P1 will be the same for X0 and X1. We will not be able to recover x0 and x1 based on P0 and P1



Related Problem

1.Let g(x,y) = s'i'n'c(x / 2,y / 2), and let <span class="texhtml" />s(m,n) = g('T,n'T) where T = 1.

a) Calculate G(μ,ν) the CSFT of g(x,y).
b) Calculate S(ejμ,ejν) the DSFT of s(m,n).

2. Assume that we know (or can measure) the function

$ p(x) = \int_{-\infty}^{\infty}f(x,y)dy $

Using the definitions of the Fourier transform, derive an expressoin for F(u,0) in terms of the function p(x).

(Refer to ECE637 2008 Exam1 Problem2.)


Back to ECE QE page:

Alumni Liaison

Basic linear algebra uncovers and clarifies very important geometry and algebra.

Dr. Paul Garrett