A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray...
Transcript of A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray...
![Page 1: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/1.jpg)
A mathematician’s foray into signal processing
Carlos Beltran
Universidad de Cantabria, Santander, Spain
From Complexity to Dynamics: A conference celebrating thework of Mike Shub
Carlos Beltran A foray into SP
![Page 2: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/2.jpg)
Credits
This work has been greatly inspiredby Mike’s thoughts and works
Coautors: Oscar Gonzalez and RafaelSantamarıa
Carlos Beltran A foray into SP
![Page 3: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/3.jpg)
How is it possible?20 people can use their mobiles at the same time in the same room
Carlos Beltran A foray into SP
![Page 4: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/4.jpg)
How is it possible?20 people can use their mobiles at the same time in the same room
Carlos Beltran A foray into SP
![Page 5: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/5.jpg)
How is it possible?20 people can use their mobiles at the same time in the same room
Carlos Beltran A foray into SP
![Page 6: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/6.jpg)
Why 0, 1 sequences are waves?And one reason for engineers to know complex numbers
Carlos Beltran A foray into SP
![Page 7: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/7.jpg)
Why 0, 1 sequences are waves?And one reason for engineers to know complex numbers
Carlos Beltran A foray into SP
![Page 8: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/8.jpg)
Why 0, 1 sequences are waves?And one reason for engineers to know complex numbers
Carlos Beltran A foray into SP
![Page 9: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/9.jpg)
Why 0, 1 sequences are waves?And one reason for engineers to know complex numbers
Carlos Beltran A foray into SP
![Page 10: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/10.jpg)
So you can send a vector in CN , N the number of“antennas”And your friend receives a linear modification of it
Carlos Beltran A foray into SP
![Page 11: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/11.jpg)
So you can send a vector in CN , N the number of“antennas”And your friend receives a linear modification of it
Carlos Beltran A foray into SP
![Page 12: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/12.jpg)
Interference Alignment: an idea of Jafar’s and Khandani’sresearch groupsEach phone must do some linear algebra
Carlos Beltran A foray into SP
![Page 13: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/13.jpg)
Interference Alignment: an idea of Jafar’s and Khandani’sresearch groupsEach phone must do some linear algebra
Carlos Beltran A foray into SP
![Page 14: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/14.jpg)
Interference Alignment: an idea of Jafar’s and Khandani’sresearch groupsEach phone must do some linear algebra
Carlos Beltran A foray into SP
![Page 15: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/15.jpg)
Interference Alignment: an idea of Jafar’s and Khandani’sresearch groupsEach phone must do some linear algebra
Carlos Beltran A foray into SP
![Page 16: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/16.jpg)
The full problemAfter engineering considerations have been taken into
Let K be the number of transmitters/receivers. Let
Φ = {(k , `) : transmitter ` interfers receiver k} ⊆ {1, . . . ,K}2.
Let transmitter ` have M` antennas, receiver k have Nk antennas.Let dj ≤ min{Mj ,Nj}, 1 ≤ j ≤ K , and let
Hk` ∈MNk×M`(C)
be fixed (known). Do there exist Uk ∈MMk×dk (C), 1 ≤ k ≤ Kand V` ∈MN`×d`(C), 1 ≤ ` ≤ K such that
UTk Hk`V` = 0 ∈Mdk×d`(C), k 6= `?
Equivalently, compute the maximal dj that you can use (degrees ofFreedom=what SP guys want). This problem has been opensince 2006. About 60 research papers.
Carlos Beltran A foray into SP
![Page 17: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/17.jpg)
Seen Mike’s Complexity papers? you’ve seen this beforeSo our question is: is π−1
1 (Hkl) = ∅? For which choices of (Hkl)(k,l)∈Φ?
Carlos Beltran A foray into SP
![Page 18: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/18.jpg)
Seen Mike’s Complexity papers? you’ve seen this beforeSo our question is: is π−1
1 (Hkl) = ∅? For which choices of (Hkl)(k,l)∈Φ?
This “double fibration” scheme is a whole business in complex-ity theory and numerical analysis. See for example the works ofShub, Smale and many others by other authors like Armentano, B.,Boito, Burgisser, Cucker, Dedieu, Kim, Leykin, Malajovich, Marsten,Pardo, Renegar, Rojas, Shutherland... and others.
Carlos Beltran A foray into SP
![Page 19: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/19.jpg)
Compute some dimensionsThe only non–elementary task follows from the preimage theorem
V is a manifold, and
dimCH =∑
(k,l)∈Φ
(NkMl − 1).
dimC S =∑
1≤j≤K(dj(Nj + Mj − 2dj)).
dimC V =
∑(k,l)∈Φ
NkMl − dkdl
+
∑k∈ΦR
Nkdk − d2k
+
∑l∈ΦT
Mldl − d2l
− ](Φ).
Carlos Beltran A foray into SP
![Page 20: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/20.jpg)
Are you paying attention?
The problem is therefore solved:
I If dimH > dimV there is no hope that the problem can besolved for generic (Hkl) ∈ H.
I If dimH ≤ dimV the problem can be solved for generic(Hkl) ∈ H, because we are in complex and algebraic situations.
... So 60 papers can be summarized with a dimension countargument.The simple case that every transmitter has M, every receiver hasN antennas and d degrees of freedom are reached, this dimensioncount reads:
(K + 1)d ≤ M + N,K the maximum number of users
Carlos Beltran A foray into SP
![Page 21: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/21.jpg)
A projection between equal dimensions whose image is azero measure setBut this WON’T happen in real–life problems like the one here, right?
Carlos Beltran A foray into SP
![Page 22: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/22.jpg)
Real life problems are indeed singular many timesThis makes life harder and talks longer
Recall that
(K + 1)d ≤ M + N,K the maximum number of users
is a necessary condition for generic feasibility of the InterferenceAlignment.
But...
M = N = 3, d = 2, K = 2
satisfies this condition and is known NOT to be genericallyfeasible. So, we have to be more serious.
Carlos Beltran A foray into SP
![Page 23: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/23.jpg)
Real life problems are indeed singular many timesThis makes life harder and talks longer
Recall that
(K + 1)d ≤ M + N,K the maximum number of users
is a necessary condition for generic feasibility of the InterferenceAlignment. But...
M = N = 3, d = 2, K = 2
satisfies this condition and is known NOT to be genericallyfeasible.
So, we have to be more serious.
Carlos Beltran A foray into SP
![Page 24: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/24.jpg)
Real life problems are indeed singular many timesThis makes life harder and talks longer
Recall that
(K + 1)d ≤ M + N,K the maximum number of users
is a necessary condition for generic feasibility of the InterferenceAlignment. But...
M = N = 3, d = 2, K = 2
satisfies this condition and is known NOT to be genericallyfeasible. So, we have to be more serious.
Carlos Beltran A foray into SP
![Page 25: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/25.jpg)
A little gift
Carlos Beltran A foray into SP
![Page 26: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/26.jpg)
A little gift
Carlos Beltran A foray into SP
![Page 27: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/27.jpg)
A little gift
Carlos Beltran A foray into SP
![Page 28: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/28.jpg)
A little gift
Carlos Beltran A foray into SP
![Page 29: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/29.jpg)
A general mathematical truthand two examples
(local property
topological constraint
)→ global property.
Two examples:(Vector field admits local solution
Manifold is compact
)→ solution exists for all t > 0
(hyperbolicityaccesibility
)→ ergodic
Carlos Beltran A foray into SP
![Page 30: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/30.jpg)
A general mathematical truthand two examples
(local property
topological constraint
)→ global property.
Two examples:(Vector field admits local solution
Manifold is compact
)→ solution exists for all t > 0
(hyperbolicityaccesibility
)→ ergodic
Carlos Beltran A foray into SP
![Page 31: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/31.jpg)
A general mathematical truthand two examples
(local property
topological constraint
)→ global property.
Two examples:(Vector field admits local solution
Manifold is compact
)→ solution exists for all t > 0
(hyperbolicityaccesibility
)→ ergodic
Carlos Beltran A foray into SP
![Page 32: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/32.jpg)
One of the most beautiful theorems I have seenFor the bored listener: which is yours?
Theorem (Ehresmann 1951)
Let X ,Y be smooth manifolds with Y connected. Let U ⊆ X be anonempty open subset of X , and let π : U → Y satisfy:
I π is a submersion.
I π is proper, i.e. π−1(compact) = compact.
Then, π : U → Y is a fiber bundle. In particular, it is surjective.
Corollary
If additionally we assume dim(X ) = dim(Y ) then π is a coveringmap. In particular, the number of preimages of every y ∈ Y isfinite and constant.
Carlos Beltran A foray into SP
![Page 33: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/33.jpg)
One of the most beautiful theorems I have seenFor the bored listener: which is yours?
Theorem (Ehresmann 1951)
Let X ,Y be smooth manifolds with Y connected. Let U ⊆ X be anonempty open subset of X , and let π : U → Y satisfy:
I π is a submersion.
I π is proper, i.e. π−1(compact) = compact.
Then, π : U → Y is a fiber bundle. In particular, it is surjective.
Corollary
If additionally we assume dim(X ) = dim(Y ) then π is a coveringmap. In particular, the number of preimages of every y ∈ Y isfinite and constant.
Carlos Beltran A foray into SP
![Page 34: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/34.jpg)
One of the most beautiful theorems I have seenFor the bored listener: which is yours?
Theorem (Ehresmann 1951)
Let X ,Y be smooth manifolds with Y connected. Let U ⊆ X be anonempty open subset of X , and let π : U → Y satisfy:
I π is a submersion.
I π is proper, i.e. π−1(compact) = compact.
Then, π : U → Y is a fiber bundle. In particular, it is surjective.
Corollary
If additionally we assume dim(X ) = dim(Y ) then π is a coveringmap. In particular, the number of preimages of every y ∈ Y isfinite and constant.
Carlos Beltran A foray into SP
![Page 35: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/35.jpg)
Seen Mike’s Complexity papers? you’ve seen this beforeSo our question is: is π−1
1 (Hkl) = ∅? For which choices of (Hkl)(k,l)∈Φ?
Carlos Beltran A foray into SP
![Page 36: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/36.jpg)
We apply Ehresmann’s theorem to the first projection π1
to see if it is surjective
Let U = {regular points of π1. The restriction π1 |U is a surjectionof course.
But, it is not properLet Σ ⊆ H be the set of singular values of π1. LetU = π−1
1 (H \ Σ). Again, π1 |U is surjective. And, this time, it isnot difficult to see that it is also proper.So, that’s it, Ehresmann’s theorem guarantees thatπ1 : U → H\Σ is a fiber bundle, thus surjective, and by continuitywe conclude that π−1
1 (Hkl) 6= ∅ for every (Hkl) ∈ H.Is this correct?Let us recall the hypotheses of Ehresmann’s theorem.We did notcheck that U 6= ∅. And this is exactly what happens in these“singularly projected” cases: U is empty sometimes.
Carlos Beltran A foray into SP
![Page 37: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/37.jpg)
We apply Ehresmann’s theorem to the first projection π1
to see if it is surjective
Let U = {regular points of π1. The restriction π1 |U is a surjectionof course. But, it is not proper
Let Σ ⊆ H be the set of singular values of π1. LetU = π−1
1 (H \ Σ). Again, π1 |U is surjective. And, this time, it isnot difficult to see that it is also proper.So, that’s it, Ehresmann’s theorem guarantees thatπ1 : U → H\Σ is a fiber bundle, thus surjective, and by continuitywe conclude that π−1
1 (Hkl) 6= ∅ for every (Hkl) ∈ H.Is this correct?Let us recall the hypotheses of Ehresmann’s theorem.We did notcheck that U 6= ∅. And this is exactly what happens in these“singularly projected” cases: U is empty sometimes.
Carlos Beltran A foray into SP
![Page 38: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/38.jpg)
We apply Ehresmann’s theorem to the first projection π1
to see if it is surjective
Let U = {regular points of π1. The restriction π1 |U is a surjectionof course. But, it is not properLet Σ ⊆ H be the set of singular values of π1. LetU = π−1
1 (H \ Σ). Again, π1 |U is surjective. And, this time, it isnot difficult to see that it is also proper.
So, that’s it, Ehresmann’s theorem guarantees thatπ1 : U → H\Σ is a fiber bundle, thus surjective, and by continuitywe conclude that π−1
1 (Hkl) 6= ∅ for every (Hkl) ∈ H.Is this correct?Let us recall the hypotheses of Ehresmann’s theorem.We did notcheck that U 6= ∅. And this is exactly what happens in these“singularly projected” cases: U is empty sometimes.
Carlos Beltran A foray into SP
![Page 39: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/39.jpg)
We apply Ehresmann’s theorem to the first projection π1
to see if it is surjective
Let U = {regular points of π1. The restriction π1 |U is a surjectionof course. But, it is not properLet Σ ⊆ H be the set of singular values of π1. LetU = π−1
1 (H \ Σ). Again, π1 |U is surjective. And, this time, it isnot difficult to see that it is also proper.So, that’s it, Ehresmann’s theorem guarantees thatπ1 : U → H\Σ is a fiber bundle, thus surjective, and by continuitywe conclude that π−1
1 (Hkl) 6= ∅ for every (Hkl) ∈ H.
Is this correct?Let us recall the hypotheses of Ehresmann’s theorem.We did notcheck that U 6= ∅. And this is exactly what happens in these“singularly projected” cases: U is empty sometimes.
Carlos Beltran A foray into SP
![Page 40: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/40.jpg)
We apply Ehresmann’s theorem to the first projection π1
to see if it is surjective
Let U = {regular points of π1. The restriction π1 |U is a surjectionof course. But, it is not properLet Σ ⊆ H be the set of singular values of π1. LetU = π−1
1 (H \ Σ). Again, π1 |U is surjective. And, this time, it isnot difficult to see that it is also proper.So, that’s it, Ehresmann’s theorem guarantees thatπ1 : U → H\Σ is a fiber bundle, thus surjective, and by continuitywe conclude that π−1
1 (Hkl) 6= ∅ for every (Hkl) ∈ H.Is this correct?
Let us recall the hypotheses of Ehresmann’s theorem.We did notcheck that U 6= ∅. And this is exactly what happens in these“singularly projected” cases: U is empty sometimes.
Carlos Beltran A foray into SP
![Page 41: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/41.jpg)
We apply Ehresmann’s theorem to the first projection π1
to see if it is surjective
Let U = {regular points of π1. The restriction π1 |U is a surjectionof course. But, it is not properLet Σ ⊆ H be the set of singular values of π1. LetU = π−1
1 (H \ Σ). Again, π1 |U is surjective. And, this time, it isnot difficult to see that it is also proper.So, that’s it, Ehresmann’s theorem guarantees thatπ1 : U → H\Σ is a fiber bundle, thus surjective, and by continuitywe conclude that π−1
1 (Hkl) 6= ∅ for every (Hkl) ∈ H.Is this correct?Let us recall the hypotheses of Ehresmann’s theorem.
We did notcheck that U 6= ∅. And this is exactly what happens in these“singularly projected” cases: U is empty sometimes.
Carlos Beltran A foray into SP
![Page 42: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/42.jpg)
We apply Ehresmann’s theorem to the first projection π1
to see if it is surjective
Let U = {regular points of π1. The restriction π1 |U is a surjectionof course. But, it is not properLet Σ ⊆ H be the set of singular values of π1. LetU = π−1
1 (H \ Σ). Again, π1 |U is surjective. And, this time, it isnot difficult to see that it is also proper.So, that’s it, Ehresmann’s theorem guarantees thatπ1 : U → H\Σ is a fiber bundle, thus surjective, and by continuitywe conclude that π−1
1 (Hkl) 6= ∅ for every (Hkl) ∈ H.Is this correct?Let us recall the hypotheses of Ehresmann’s theorem.We did notcheck that U 6= ∅. And this is exactly what happens in these“singularly projected” cases: U is empty sometimes.
Carlos Beltran A foray into SP
![Page 43: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/43.jpg)
A test for feasibilityThere may be not formula for deciding feasibility. But there is a test:
I Choose some (H,U,V ) ∈ V.
I Compute the rank of Dπ1(H,U,V ).
I If the rank is maximal, answer the problem is feasible.Otherwise, answer the problem is infeasible.
Because of Sard’s Theorem, if (H,U,V ) are chosen “generically”,they will be a regular point (if there is some regular point) so thistest checks if the set of regular points is empty or not. Just as wewanted.
The second step above is just LA. The first one can be changed to:
Uj = Vj =
(Id0
), 1 ≤ j ≤ K , Hkl =
(0 Akl
Bkl 0
),
where Akl and Bkl are chosen with complex coefficients followingthe normal distribution.
Carlos Beltran A foray into SP
![Page 44: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/44.jpg)
A test for feasibilityThere may be not formula for deciding feasibility. But there is a test:
I Choose some (H,U,V ) ∈ V.
I Compute the rank of Dπ1(H,U,V ).
I If the rank is maximal, answer the problem is feasible.Otherwise, answer the problem is infeasible.
Because of Sard’s Theorem, if (H,U,V ) are chosen “generically”,they will be a regular point (if there is some regular point) so thistest checks if the set of regular points is empty or not. Just as wewanted.The second step above is just LA. The first one can be changed to:
Uj = Vj =
(Id0
), 1 ≤ j ≤ K , Hkl =
(0 Akl
Bkl 0
),
where Akl and Bkl are chosen with complex coefficients followingthe normal distribution.
Carlos Beltran A foray into SP
![Page 45: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/45.jpg)
A discrete algorithm in BPP
One can describe a discrete algorithm using a classical result byMilnor on the number of connected components of algebraicallyclosed sets, and a result relating the height of numbers appearingin a set to the number of connected components of the set (firstsuch a result due to Koiran):
In the argument above, it suffices totake Akl and Bkl as matrices with Gaussian integers with bit lengthbounded by a certain polynomial on M,N, d ,K . This makes thetest above a BPP algorithm for deciding feasibility of InterferenceAlignment.
Carlos Beltran A foray into SP
![Page 46: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/46.jpg)
A discrete algorithm in BPP
One can describe a discrete algorithm using a classical result byMilnor on the number of connected components of algebraicallyclosed sets, and a result relating the height of numbers appearingin a set to the number of connected components of the set (firstsuch a result due to Koiran): In the argument above, it suffices totake Akl and Bkl as matrices with Gaussian integers with bit lengthbounded by a certain polynomial on M,N, d ,K . This makes thetest above a BPP algorithm for deciding feasibility of InterferenceAlignment.
Carlos Beltran A foray into SP
![Page 47: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/47.jpg)
Just a comment on the reactions to this work
The full version is under consideration for publication in Journal ofInformation Theory. But, a reduced version was sent to someconference (EDAS) of that topic. Here are the three refereereports:
I This paper has to be rejected because there is no interest indeciding algorithmically something, unless you can use thealgorithm to produce some conjecture.
I This paper uses too high mathematics and thus has to berejected because it cannot be understood.
I This is a great paper and must be accepted.
Happily, the third referee’s opinion was the prevalent one in theeditorial board.
Carlos Beltran A foray into SP
![Page 48: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/48.jpg)
Just a comment on the reactions to this work
The full version is under consideration for publication in Journal ofInformation Theory. But, a reduced version was sent to someconference (EDAS) of that topic. Here are the three refereereports:
I This paper has to be rejected because there is no interest indeciding algorithmically something, unless you can use thealgorithm to produce some conjecture.
I This paper uses too high mathematics and thus has to berejected because it cannot be understood.
I This is a great paper and must be accepted.
Happily, the third referee’s opinion was the prevalent one in theeditorial board.
Carlos Beltran A foray into SP
![Page 49: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/49.jpg)
Just a comment on the reactions to this work
The full version is under consideration for publication in Journal ofInformation Theory. But, a reduced version was sent to someconference (EDAS) of that topic. Here are the three refereereports:
I This paper has to be rejected because there is no interest indeciding algorithmically something, unless you can use thealgorithm to produce some conjecture.
I This paper uses too high mathematics and thus has to berejected because it cannot be understood.
I This is a great paper and must be accepted.
Happily, the third referee’s opinion was the prevalent one in theeditorial board.
Carlos Beltran A foray into SP
![Page 50: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/50.jpg)
Just a comment on the reactions to this work
The full version is under consideration for publication in Journal ofInformation Theory. But, a reduced version was sent to someconference (EDAS) of that topic. Here are the three refereereports:
I This paper has to be rejected because there is no interest indeciding algorithmically something, unless you can use thealgorithm to produce some conjecture.
I This paper uses too high mathematics and thus has to berejected because it cannot be understood.
I This is a great paper and must be accepted.
Happily, the third referee’s opinion was the prevalent one in theeditorial board.
Carlos Beltran A foray into SP
![Page 51: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/51.jpg)
Carlos Beltran A foray into SP
![Page 52: A mathematician's foray into signal processing€¦ · · 2012-05-24A mathematician’s foray into signal processing Carlos Beltr an ... jg, 1 j K, and let H k‘ 2M N k M ... ‘](https://reader031.fdocuments.net/reader031/viewer/2022030617/5ae27e9f7f8b9a7b218c04f0/html5/thumbnails/52.jpg)
Carlos Beltran A foray into SP