arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2609.01112cs.ITeess.SPmath.IT

失配滤波器下序列集模糊函数的广义Tan-Arlery-Rabaste-Lehmann-Ovarlez下界

Generalized Tan-Arlery-Rabaste-Lehmann-Ovarlez Lower Bound on Ambiguity Function of a Set of Sequences With Mismatched Filters

  • University of Patliputra(帕蒂普特拉大学)

机构由 AI 辅助整理,请以论文原文为准。

Shibsankar Das

AI总结:

本文针对低模糊区推导单模序列最大模糊函数旁瓣的广义下界,引入失配滤波器与权重向量,扩展了2020年的Tan-Arlery-Rabaste-Lehmann-Ovarlez下界,适用于序列失配滤波场景。

AI中文摘要:

本文针对期望的低模糊区(LAZ),推导了一组单模序列的最大模糊函数(AF)旁瓣的下界。核心思路是引入与该组单模序列相关的一组失配滤波器,以及分别对应时延和多普勒频移的两个权重向量,且失配滤波器的长度可与单模序列的长度不同。所提出的针对期望LAZ的最大AF旁瓣下界,可视为2020年发表的Tan-Arlery-Rabaste-Lehmann-Ovarlez下界的扩展,该原始下界针对的是序列的常规相关性。

英文摘要:

In this paper, a lower bound on the maximum ambiguity function (AF) sidelobes of a set of unimodular sequences is formulated for the desired low-ambiguity-zone (LAZ). Our main idea is to introduce a set of mismatched filters associated to a set of unimodular sequences and two weight vectors for the delay and Doppler shifts, respectively. The length of mismatched filter maybe different to the length of unimodular sequence. The proposed lower bound on the maximum AF sidelobes for the desired LAZ can be treated as an extension of Tan-Arlery-Rabaste-Lehmann-Ovarlez lower bound, published in 2020, which dealt with the conventional correlation of sequences.

补充信息

↑