A new lower bound on the maximum correlation of a set with mismatched filters - Télécom SudParis Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2020

A new lower bound on the maximum correlation of a set with mismatched filters

Résumé

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.
Fichier principal
Vignette du fichier
DEMR20051.1610530549_postprint.pdf (449.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02962309 , version 1 (14-01-2021)

Identifiants

Citer

Uy Hour Tan, Fabien Arlery, Olivier Rabaste, Frederic Lehmann, Jean-Philippe Ovarlez. A new lower bound on the maximum correlation of a set with mismatched filters. IEEE Transactions on Information Theory, 2020, 66 (10), pp.6555-6565. ⟨10.1109/TIT.2020.3002066⟩. ⟨hal-02962309⟩
48 Consultations
131 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More