Timeline for Minimizing |FT(X)|_{\infty} by permutation of X_i - question on Fourier transform related to engineering problem (peak factor of OFDM system)
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2012 at 16:28 | comment | added | Alexander Chervov | What about other X such that reordering will work? How to choose optimal or suboptimal reordering? | |
| Oct 15, 2012 at 23:38 | comment | added | Mark Lewko | That was exactly my point. If there is a choice of X such that no reordering improves over the trivial estimate, what do you expect an answer to look like? | |
| Oct 15, 2012 at 11:40 | comment | added | Alexander Chervov | Also, if X_i are positive real than |Y|_inf = |X|_1 , and permutation will not have any effect. | |
| Oct 15, 2012 at 11:38 | comment | added | Alexander Chervov | May be I did not formulate the question correctly. I mean for GIVEN sequence of (X_1 ... X_N) how to find permutation that minimize ... ? Of course, if X_i=X_j then nothing can be done. | |
| Oct 15, 2012 at 11:14 | history | answered | Mark Lewko | CC BY-SA 3.0 |