A greedy algorithm used for the recovery of sparse signals,multiple orthogonal least squares(MOLS)have recently attracted quite a big of attention.In this paper,we consider the number of iterations required for the MO...A greedy algorithm used for the recovery of sparse signals,multiple orthogonal least squares(MOLS)have recently attracted quite a big of attention.In this paper,we consider the number of iterations required for the MOLS algorithm for recovery of a K-sparse signal x∈R^(n).We show that MOLS provides stable reconstruction of all K-sparse signals x from y=Ax+w in|6K/ M|iterations when the matrix A satisfies the restricted isometry property(RIP)with isometry constantδ_(7K)≤0.094.Compared with the existing results,our sufficient condition is not related to the sparsity level K.展开更多
针对正交时频空(Orthogonal Time Frequency Space, OTFS)调制系统中均衡器性能不佳及线性滤波器复杂度较高等问题,提出了一种LU(Lower-Upper)分解与迭代最小均方误差(Iterative Minimum Mean Square Error, IMMSE)均衡器结合的OTFS系...针对正交时频空(Orthogonal Time Frequency Space, OTFS)调制系统中均衡器性能不佳及线性滤波器复杂度较高等问题,提出了一种LU(Lower-Upper)分解与迭代最小均方误差(Iterative Minimum Mean Square Error, IMMSE)均衡器结合的OTFS系统信号检测算法(LU-IMMSE)。该算法依据时延多普勒域稀疏信道矩阵的特征,采用一种低复杂度的LU分解方法,以避免MMSE均衡器求解矩阵逆的过程,在保证均衡器性能的前提下降低了均衡器复杂度。在OTFS系统中引入一种IMMSE均衡器,通过不断迭代更新发送符号均值和方差这些先验信息来逼近MMSE均衡器最优估计值。LU-IMMSE算法通过调节迭代次数可以有效降低误比特率。在比特信噪比为8 dB时,5次迭代后的LU-IMMSE均衡器误比特率相比传统的MMSE均衡器降低了约11 dB。随着迭代次数的增大,较传统IMMSE算法降低了计算复杂度。在最大时延系数为4、符号数为16的情况下,与直接求逆相比,所提出的低复杂度LU分解方法降低了约91.72%的矩阵求逆计算复杂度。展开更多
针对高速移动场景中正交时频空间(Orthogonal Time Frequency Space, OTFS)系统线性最小均方误差(Linear Minimum Mean Square Error, LMMSE)检测复杂度过高而难以快速有效实现的问题,利用零填充(Zero Padding, ZP)OTFS系统时域信道矩...针对高速移动场景中正交时频空间(Orthogonal Time Frequency Space, OTFS)系统线性最小均方误差(Linear Minimum Mean Square Error, LMMSE)检测复杂度过高而难以快速有效实现的问题,利用零填充(Zero Padding, ZP)OTFS系统时域信道矩阵呈块对角稀疏特性提出一种逐块迭代的对称逐次超松弛(Symmetric Successive over Relaxation, SSOR)迭代算法,在降低系统复杂度的同时获得与LMMSE检测近似的性能。仿真结果表明,与逐次超松弛(Successive over Relaxation, SOR)算法相比,所提算法对松弛参数不敏感且具有更快的收敛速度,在迭代次数为10次时误码性能几乎达到LMMSE误码性能,显著降低了检测器的复杂度。展开更多
In this article,we consider a discrete right-definite Sturm-Liouville problems with two squared eigenparameter-dependent boundary conditions.By constructing some new Lagrange-type identities and two fundamental functi...In this article,we consider a discrete right-definite Sturm-Liouville problems with two squared eigenparameter-dependent boundary conditions.By constructing some new Lagrange-type identities and two fundamental functions,we obtain not only the existence,the simplicity,and the interlacing properties of the real eigenvalues,but also the oscillation properties,orthogonality of the eigenfunctions,and the expansion theorem.Finally,we also give a computation scheme for computing eigenvalues and eigenfunctions of specific eigenvalue problems.展开更多
基金supported by the National Natural Science Foundation of China(61907014,11871248,11701410,61901160)Youth Science Foundation of Henan Normal University(2019QK03).
文摘A greedy algorithm used for the recovery of sparse signals,multiple orthogonal least squares(MOLS)have recently attracted quite a big of attention.In this paper,we consider the number of iterations required for the MOLS algorithm for recovery of a K-sparse signal x∈R^(n).We show that MOLS provides stable reconstruction of all K-sparse signals x from y=Ax+w in|6K/ M|iterations when the matrix A satisfies the restricted isometry property(RIP)with isometry constantδ_(7K)≤0.094.Compared with the existing results,our sufficient condition is not related to the sparsity level K.
文摘针对正交时频空(Orthogonal Time Frequency Space, OTFS)调制系统中均衡器性能不佳及线性滤波器复杂度较高等问题,提出了一种LU(Lower-Upper)分解与迭代最小均方误差(Iterative Minimum Mean Square Error, IMMSE)均衡器结合的OTFS系统信号检测算法(LU-IMMSE)。该算法依据时延多普勒域稀疏信道矩阵的特征,采用一种低复杂度的LU分解方法,以避免MMSE均衡器求解矩阵逆的过程,在保证均衡器性能的前提下降低了均衡器复杂度。在OTFS系统中引入一种IMMSE均衡器,通过不断迭代更新发送符号均值和方差这些先验信息来逼近MMSE均衡器最优估计值。LU-IMMSE算法通过调节迭代次数可以有效降低误比特率。在比特信噪比为8 dB时,5次迭代后的LU-IMMSE均衡器误比特率相比传统的MMSE均衡器降低了约11 dB。随着迭代次数的增大,较传统IMMSE算法降低了计算复杂度。在最大时延系数为4、符号数为16的情况下,与直接求逆相比,所提出的低复杂度LU分解方法降低了约91.72%的矩阵求逆计算复杂度。
文摘针对高速移动场景中正交时频空间(Orthogonal Time Frequency Space, OTFS)系统线性最小均方误差(Linear Minimum Mean Square Error, LMMSE)检测复杂度过高而难以快速有效实现的问题,利用零填充(Zero Padding, ZP)OTFS系统时域信道矩阵呈块对角稀疏特性提出一种逐块迭代的对称逐次超松弛(Symmetric Successive over Relaxation, SSOR)迭代算法,在降低系统复杂度的同时获得与LMMSE检测近似的性能。仿真结果表明,与逐次超松弛(Successive over Relaxation, SOR)算法相比,所提算法对松弛参数不敏感且具有更快的收敛速度,在迭代次数为10次时误码性能几乎达到LMMSE误码性能,显著降低了检测器的复杂度。
基金The authors are supported by National Natural Sciences Foundation of China(11961060,11671322)the Key Project of Natural Sciences Foundation of Gansu Province(18JR3RA084).
文摘In this article,we consider a discrete right-definite Sturm-Liouville problems with two squared eigenparameter-dependent boundary conditions.By constructing some new Lagrange-type identities and two fundamental functions,we obtain not only the existence,the simplicity,and the interlacing properties of the real eigenvalues,but also the oscillation properties,orthogonality of the eigenfunctions,and the expansion theorem.Finally,we also give a computation scheme for computing eigenvalues and eigenfunctions of specific eigenvalue problems.
