Name
Abstract | ||
|---|---|---|
A new lower bound is proposed in this article. Like Levenshtein bound, it relates to the maximum correlation value (autocorrelation and cross-correlation) a set of sequences can achieve. The novelty introduced here is that each sequence is associated with a mismatched filter. The proposed bound is inspired from Levenshtein’s, holds for any set of unimodular sequences and can be applied in both aperiodic and periodic cases. It appears that the obtained expression does not deviate a lot from the (matched) Levenshtein, which indicates that the use of a mismatched filter will not guarantee much better sidelobe performance, as the number fo sequences is significant, contrary to the popular belief. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TIT.2020.3002066 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Correlation,Delays,Radar,Signal to noise ratio,Optimization,Filtering theory,Telecommunications | Journal | 66 |
Issue | ISSN | Citations |
10 | 0018-9448 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Uy Hour Tan | 1 | 0 | 0.34 |
| Fabien Arlery | 2 | 0 | 0.34 |
| Olivier Rabaste | 3 | 0 | 1.69 |
| Frédéric Lehmann | 4 | 5 | 3.17 |
| Jean Philippe Ovarlez | 5 | 190 | 25.11 |