模糊函数上的广义 Arlery-Tan-Rabaste-Levenshtein 下界及其渐近可达性
Generalized Arlery-Tan-Rabaste-Levenshtein Lower Bounds on Ambiguity Function and Their Asymptotic Achievability
AI总结:
本文提出广义 Arlery-Tan-Rabaste-Levenshtein 下界,利用时延和多普勒权重向量分析加权模糊函数矩阵的 Frobenius 范数,并证明该下界可由 Chu 序列集在低模糊区内渐近达到。
摘要:
本文针对在特定时延-多普勒低模糊区(LAZ)条件下单位模序列的最大非周期模糊函数(AF)幅度,提出了广义 Arlery-Tan-Rabaste-Levenshtein 下界。我们的核心思想是通过引入分别与时延和多普勒频移相关联的两个权重向量,来探索加权自模糊函数矩阵和互模糊函数矩阵的 Frobenius 范数的上界与下界。作为第二个主要贡献,我们通过分析所选 Chu 序列集在特定 LAZ 内的最大自模糊函数和互模糊函数幅度,证明了所推导的下界是渐近可达的。
英文摘要:
This paper presents generalized Arlery-Tan-Rabaste-Levenshtein lower bounds on the maximum aperiodic ambiguity function (AF) magnitude of unimodular sequences under certain delay-Doppler low ambiguity zones (LAZ). Our core idea is to explore the upper and lower bounds on the Frobenius norm of the weighted auto- and cross-AF matrices by introducing two weight vectors associated with the delay and Doppler shifts, respectively. As a second major contribution, we demonstrate that our derived lower bounds are asymptotically achievable with selected Chu sequence sets by analyzing their maximum auto- and cross- AF magnitudes within certain LAZ.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。