Dgdrxrt

Does classifying an integer as a discrete log require it be part of a multiplicative group?

Using audio cues to encourage good posture

Can an alien society believe that their star system is the universe?

Is it cost-effective to upgrade an old-ish Giant Escape R3 commuter bike with entry-level branded parts (wheels, drivetrain)?

How to react to hostile behavior from a senior developer?

Is it a good idea to use CNN to classify 1D signal?

When the Haste spell ends on a creature, do attackers have advantage against that creature?

Generate an RGB colour grid

Find the length x such that the two distances in the triangle are the same

Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied?

How do I stop a creek from eroding my steep embankment?

Do I really need recursive chmod to restrict access to a folder?

How to answer "Have you ever been terminated?"

How to show element name in portuguese using elements package?

Why do the resolve message appear first?

Can a new player join a group only when a new campaign starts?

Irreducible of finite Krull dimension implies quasi-compact?

Should I use a zero-interest credit card for a large one-time purchase?

What is this building called? (It was built in 2002)

What is homebrew?

First console to have temporary backward compatibility

Why are both D and D# fitting into my E minor key?

Is there such thing as an Availability Group failover trigger?

Around usage results

How to solve this problem using linear-algebra?

0

$begingroup$

I have a matrix $bf HinmathbbC^Ttimes R$. There are $T$ transmitters and $R$ receivers with $T>R$.

Let $h_t,r$ denotes the $(t,r)$ component of $bf H$.

Each receiver needs to choose one of the transmitters that gives $max(textabs(h_t,r)),t=1,2,cdots T$.

Of course, I can do it heuristically.

However, is there any way to do it using linear algebra? Does SVD or eigen value can be used to do it? Note that two receivers may end up choosing the same transmitter.

linear-algebra eigenvalues-eigenvectors

share|cite|improve this question

edited Apr 1 at 13:49

dipak narayanan

asked Apr 1 at 13:02

dipak narayanandipak narayanan

275

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Question is incomplete
  $endgroup$
  – Shubham Johri
  Apr 1 at 13:26
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @ShubhamJohri, which the part you feel that is not completed?
  $endgroup$
  – dipak narayanan
  Apr 1 at 13:35
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  "Each receiver, $r$ want to choose the transmitter such that $max(textabs(h_t,r)),t=1,2,⋯T.$"
  $endgroup$
  – Shubham Johri
  Apr 1 at 13:44
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Are two receivers allowed to choose the same transmitter or not? If they do, is there a penalty?
  $endgroup$
  – Hans Engler
  Apr 1 at 13:47
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @HansEngler, at this moment, two receivers are allowed to choose the same transmitter.
  $endgroup$
  – dipak narayanan
  Apr 1 at 13:53
  

  
  
  
  

 | 
show 2 more comments

0

$begingroup$

I have a matrix $bf HinmathbbC^Ttimes R$. There are $T$ transmitters and $R$ receivers with $T>R$.

Let $h_t,r$ denotes the $(t,r)$ component of $bf H$.

Each receiver needs to choose one of the transmitters that gives $max(textabs(h_t,r)),t=1,2,cdots T$.

Of course, I can do it heuristically.

However, is there any way to do it using linear algebra? Does SVD or eigen value can be used to do it? Note that two receivers may end up choosing the same transmitter.

linear-algebra eigenvalues-eigenvectors

share|cite|improve this question

edited Apr 1 at 13:49

dipak narayanan

asked Apr 1 at 13:02

dipak narayanandipak narayanan

275

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Question is incomplete
  $endgroup$
  – Shubham Johri
  Apr 1 at 13:26
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @ShubhamJohri, which the part you feel that is not completed?
  $endgroup$
  – dipak narayanan
  Apr 1 at 13:35
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  "Each receiver, $r$ want to choose the transmitter such that $max(textabs(h_t,r)),t=1,2,⋯T.$"
  $endgroup$
  – Shubham Johri
  Apr 1 at 13:44
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Are two receivers allowed to choose the same transmitter or not? If they do, is there a penalty?
  $endgroup$
  – Hans Engler
  Apr 1 at 13:47
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @HansEngler, at this moment, two receivers are allowed to choose the same transmitter.
  $endgroup$
  – dipak narayanan
  Apr 1 at 13:53
  

  
  
  
  

 | 
show 2 more comments

$begingroup$

I have a matrix $bf HinmathbbC^Ttimes R$. There are $T$ transmitters and $R$ receivers with $T>R$.

Let $h_t,r$ denotes the $(t,r)$ component of $bf H$.

Each receiver needs to choose one of the transmitters that gives $max(textabs(h_t,r)),t=1,2,cdots T$.

Of course, I can do it heuristically.

However, is there any way to do it using linear algebra? Does SVD or eigen value can be used to do it? Note that two receivers may end up choosing the same transmitter.

linear-algebra eigenvalues-eigenvectors

share|cite|improve this question

edited Apr 1 at 13:49

dipak narayanan

asked Apr 1 at 13:02

dipak narayanandipak narayanan

275

$endgroup$

share|cite|improve this question

edited Apr 1 at 13:49

dipak narayanan

asked Apr 1 at 13:02

dipak narayanandipak narayanan

275

share|cite|improve this question

edited Apr 1 at 13:49

dipak narayanan

asked Apr 1 at 13:02

dipak narayanandipak narayanan

275

asked Apr 1 at 13:02

dipak narayanandipak narayanan

275

asked Apr 1 at 13:02

dipak narayanandipak narayanan

275