The minimum aperiodic crosscorrelation of binary sequences of size M and length n over the alphabet E={1, -1} has been obtained by Levenshtein for M≥4 and n≥2 These bounds improve a long standing bound giv...The minimum aperiodic crosscorrelation of binary sequences of size M and length n over the alphabet E={1, -1} has been obtained by Levenshtein for M≥4 and n≥2 These bounds improve a long standing bound given by Welch. In this paper, the Sarwate bounds for codes over the p th roots of unity with the same parameters M and n are discussed, that is,the lower bounds and trade off are established for the maximum magnitude of the aperiodic crosscorrelation function and the maximum magnitude of the out of phase aperiodic autocorrelation function for the sets of periodic sequences with the same parameters M and n by using the modified Levenshtein method. The results show that new bounds are tighter than Sarwate bounds and Levenshtein bounds.展开更多
Suppose that X is a right process which is associated with a semi-Dirichlet form （ε, D（ε）） on L2（E; m）. Let J be the jumping measure of （ε, D（ε）） satisfying J（E x E- d） 〈 ∞. Let u E D（ε）b ：= D（...Suppose that X is a right process which is associated with a semi-Dirichlet form （ε, D（ε）） on L2（E; m）. Let J be the jumping measure of （ε, D（ε）） satisfying J（E x E- d） 〈 ∞. Let u E D（ε）b ：= D（ε） N L（E; m）, we have the following Pukushima＇s decomposition u（Xt）-u（X0） --- Mut ＋ Nut. Define Pu f（x） = Ex[eNT f（Xt）]. Let Qu（f,g） = ε（f,g）＋ε（u, fg） for f, g E D（ε）b. In the first part, under some assumptions we show that （Qu, D（ε）b） is lower semi-bounded if and only if there exists a constant a0 〉 0 such that /Put/2 ≤eaot for every t 〉 0. If one of these assertions holds, then （Put〉0is strongly continuous on L2（E;m）. If X is equipped with a differential structure, then under some other assumptions, these conclusions remain valid without assuming J（E x E - d） 〈 ∞. Some examples are also given in this part. Let At be a local continuous additive functional with zero quadratic variation. In the second part, we get the representation of At and give two sufficient conditions for PAf（x） = Ex[eAtf（Xt）] to be strongly continuous.展开更多
现有无源定位闭式算法均考虑视距(Line of Sight,LOS)环境,无法直接应用于存在遮挡的城市环境低空无人机目标定位等场景,同时,非视距(Non-Line of Sight,NLOS)优化定位算法计算效率较低。针对这些问题,本文开展中继辅助下的单站目标定...现有无源定位闭式算法均考虑视距(Line of Sight,LOS)环境,无法直接应用于存在遮挡的城市环境低空无人机目标定位等场景,同时,非视距(Non-Line of Sight,NLOS)优化定位算法计算效率较低。针对这些问题,本文开展中继辅助下的单站目标定位研究,通过引入中继收发器对目标信号进行转发,构造两条路径从而规避遮挡问题,同时考虑中继和观测站位置存在随机误差,提出了一种闭式算法来确定未知目标位置。该算法分为3个步骤:首先利用校准目标-中继收发器-观测站这一路径的额外信息,修正中继和观测站位置;随后基于未知目标-中继收发器-观测站获取的观测信息,通过引入额外变量的方式构建伪线性方程,利用加权最小二乘技术给出目标位置粗略估计;最后进一步挖掘目标位置与额外变量的非线性关系,再次构建矩阵方程并给出目标位置最终估计解。经过理论剖析与仿真验证,所提出的算法在可接受的测量误差和观测站点位置误差范围内,能够逼近克拉美罗下界(Cramer-Rao Lower Bound,CRLB)。展开更多
文摘The minimum aperiodic crosscorrelation of binary sequences of size M and length n over the alphabet E={1, -1} has been obtained by Levenshtein for M≥4 and n≥2 These bounds improve a long standing bound given by Welch. In this paper, the Sarwate bounds for codes over the p th roots of unity with the same parameters M and n are discussed, that is,the lower bounds and trade off are established for the maximum magnitude of the aperiodic crosscorrelation function and the maximum magnitude of the out of phase aperiodic autocorrelation function for the sets of periodic sequences with the same parameters M and n by using the modified Levenshtein method. The results show that new bounds are tighter than Sarwate bounds and Levenshtein bounds.
基金supported by NSFC(11201102,11326169,11361021)Natural Science Foundation of Hainan Province(112002,113007)
文摘Suppose that X is a right process which is associated with a semi-Dirichlet form （ε, D（ε）） on L2（E; m）. Let J be the jumping measure of （ε, D（ε）） satisfying J（E x E- d） 〈 ∞. Let u E D（ε）b ：= D（ε） N L（E; m）, we have the following Pukushima＇s decomposition u（Xt）-u（X0） --- Mut ＋ Nut. Define Pu f（x） = Ex[eNT f（Xt）]. Let Qu（f,g） = ε（f,g）＋ε（u, fg） for f, g E D（ε）b. In the first part, under some assumptions we show that （Qu, D（ε）b） is lower semi-bounded if and only if there exists a constant a0 〉 0 such that /Put/2 ≤eaot for every t 〉 0. If one of these assertions holds, then （Put〉0is strongly continuous on L2（E;m）. If X is equipped with a differential structure, then under some other assumptions, these conclusions remain valid without assuming J（E x E - d） 〈 ∞. Some examples are also given in this part. Let At be a local continuous additive functional with zero quadratic variation. In the second part, we get the representation of At and give two sufficient conditions for PAf（x） = Ex[eAtf（Xt）] to be strongly continuous.
文摘现有无源定位闭式算法均考虑视距(Line of Sight,LOS)环境,无法直接应用于存在遮挡的城市环境低空无人机目标定位等场景,同时,非视距(Non-Line of Sight,NLOS)优化定位算法计算效率较低。针对这些问题,本文开展中继辅助下的单站目标定位研究,通过引入中继收发器对目标信号进行转发,构造两条路径从而规避遮挡问题,同时考虑中继和观测站位置存在随机误差,提出了一种闭式算法来确定未知目标位置。该算法分为3个步骤:首先利用校准目标-中继收发器-观测站这一路径的额外信息,修正中继和观测站位置;随后基于未知目标-中继收发器-观测站获取的观测信息,通过引入额外变量的方式构建伪线性方程,利用加权最小二乘技术给出目标位置粗略估计;最后进一步挖掘目标位置与额外变量的非线性关系,再次构建矩阵方程并给出目标位置最终估计解。经过理论剖析与仿真验证,所提出的算法在可接受的测量误差和观测站点位置误差范围内,能够逼近克拉美罗下界(Cramer-Rao Lower Bound,CRLB)。
