Low-complexity signal detection for massive MIMO systems via trace iterative method

Linear minimum mean square error(MMSE)detection has been shown to achieve near-optimal performance for massive multiple-input multiple-output(MIMO)systems but inevitably involves complicated matrix inversion,which entails high complexity.To avoid the exact matrix inversion,a considerable number of implicit and explicit approximate matrix inversion based detection methods is proposed.By combining the advantages of both the explicit and the implicit matrix inversion,this paper introduces a new low-complexity signal detection algorithm.Firstly,the relationship between implicit and explicit techniques is analyzed.Then,an enhanced Newton iteration method is introduced to realize an approximate MMSE detection for massive MIMO uplink systems.The proposed improved Newton iteration significantly reduces the complexity of conventional Newton iteration.However,its complexity is still high for higher iterations.Thus,it is applied only for first two iterations.For subsequent iterations,we propose a novel trace iterative method(TIM)based low-complexity algorithm,which has significantly lower complexity than higher Newton iterations.Convergence guarantees of the proposed detector are also provided.Numerical simulations verify that the proposed detector exhibits significant performance enhancement over recently reported iterative detectors and achieves close-to-MMSE performance while retaining the low-complexity advantage for systems with hundreds of antennas.

Efficient Iterative Method for Solving the General Restricted Linear Equation

An iterative method is developed for solving the solution of the general restricted linear equation. The convergence, stability, and error estimate are given. Numerical experiments are presented to demonstrate the efficiency and accuracy.

A Low-Complexity Signal Detection Utilizing AOR Iterative Method for Massive MIMO Systems

Massive multiple-input multiple-output(MIMO) system is capable of substantially improving the spectral efficiency as well as the capacity of wireless networks relying on equipping a large number of antenna elements at the base stations. However, the excessively high computational complexity of the signal detection in massive MIMO systems imposes a significant challenge for practical hardware implementations. In this paper, we propose a novel minimum mean square error(MMSE) signal detection using the accelerated overrelaxation(AOR) iterative method without complicated matrix inversion, which is capable of reducing the overall complexity of the classical MMSE algorithm by an order of magnitude. Simulation results show that the proposed AOR-based method can approach the conventional MMSE signal detection with significant complexity reduction.

Autofocus technique for ISAR imaging of uniformly rotating targets based on the ExCoV method

The inverse synthetic aperture radar (ISAR) imaging can be converted into a sparse reconstruction problem and solved by the l1norm minimization algorithm. The basis matrix in sparse ISAR imaging is usually characterized by the unknown rotation rate of a moving target, thus the rotation rate and the sparse signal should be jointly estimated. Especially due to the imperfect coarse motion compensation, we consider the phase error correction problem in the context of the sparse signal reconstruction. To address this issue, we propose an iterative reweighted method, which jointly estimates the rotation rate, corrects the phase error and reconstructs a high resolution ISAR image. The proposed method gives a gradual and interweaved iterative process to refine the unknown parameters to achieve the best sparse representation for the ISAR signals. Particularly, in ISAR image reconstruction, the l1norm minimization algorithm is sensitive to user parameters. Setting these user parameters are not trivial and the reconstruction performance depends significantly on their choices. Then, we consider an expansion-compression variance-component (ExCoV) based method, which is automatic and demands no prior knowledge about signal-sparsity or measurement-noise levels. Both numerical and electromagnetic data experiments are implemented to show the effectiveness of the proposed method. It is shown that the proposed method can estimate the rotation rate and correct the phase errors simultaneously, and its superior performance is proved in terms of high resolution ISAR image. © 2017 Beijing Institute of Aerospace Information.

A Remarkable Chord Iterative Method for Roots of Uncertain Multiplicity

In this note we at first briefly review iterative methods for effectively approaching a root of an unknown multiplicity. We describe a first order, then a second order estimate for the multiplicity index m of the approached root. Next we present a second order, two-step method for iteratively nearing a root of an unknown multiplicity. Subsequently, we introduce a novel chord, or a two- step method, not requiring beforehand knowledge of the multiplicity index m of the sought root, nor requiring higher order derivatives of the equilibrium function, which is quadratically convergent for any , and then reverts to superlinear.

Banach空间中Mann-Ishikawa迭代和Multi-Step迭代的等价性问题

本文研究了一致光滑Banach空间中迭代算法等价性的问题.利用泛函分析的方法,获得了广义强连接Φ伪压缩算子在具误差的修正的Mann-Ishikawa迭代和具误差的修正的multi-step迭代下收敛等价性的结果,推广了目前的相关结果.

ON DECOMPOSITION METHOD FOR ACOUSTIC WAVE SCATTERING BY MULTIPLE OBSTACLES

Consider acoustic wave scattering by multiple obstacles with different sound properties on the boundary, which can be modeled by a mixed boundary value problem for the Helmholtz equation in frequency domain. Compared with the standard scattering problem for one obstacle, the difficulty of such a new problem is the interaction of scattered wave by different obstacles. A decomposition method for solving this multiple scattering problem is developed. Using the boundary integral equation method, we decompose the total scattered field into a sum of contributions by separated obstacles. Each contribution corresponds to scattering problem of single obstacle. However, all the single scattering problems are coupled via the boundary conditions, representing the physical interaction of scattered wave by different obstacles. We prove the feasibility of such a decomposition. To compute these contributions efficiently, an iteration algorithm of Jacobi type is proposed, decoupling the interaction of scattered wave from the numerical points of view. Under the well-separation assumptions on multiple obstacles, we prove the convergence of iteration sequence generated by the Jacobi algorithm, and give the error estimate between exact scattered wave and the iteration solution in terms of the obstacle size and the minimal distance of multiple obstacles. Such a quantitative description reveals the essences of wave scattering by multiple obstacles. Numerical examples showing the accuracy and convergence of our method are presented.

Picard-Newton Iterative Method with Time Step Control for Multimaterial Non-Equilibrium Radiation Diffusion Problem

For a new nonlinear iterative method named as Picard-Newton(P-N)iterative method for the solution of the time-dependent reaction-diffusion systems,which arise in non-equilibrium radiation diffusion applications,two time step control methods are investigated and a study of temporal accuracy of a first order time integration is presented.The non-equilibrium radiation diffusion problems with flux limiter are considered,which appends pesky complexity and nonlinearity to the diffusion coef-ficient.Numerical results are presented to demonstrate that compared with Picard method,for a desired accuracy,significant increase in solution efficiency can be obtained by Picard-Newton method with the suitable time step size selection.

AN ITERATIVE ALGORITHM FOR OPTIMAL DESIGN OF NON-FREQUENCY-SELECTIVE FIR DIGITAL FILTERS

This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing method.Different from the traditional optimization concept of adjusting the window or the filter order in the windowing design of an FIR digital filter,the key idea of the algorithm is minimizing the approximation error by succes-sively modifying the design result through an iterative procedure under the condition of a fixed window length.In the iterative procedure,the known deviation of the designed frequency response in each iteration from the ideal frequency response is used as a reference for the next iteration.Because the approximation error can be specified variably,the algorithm is applicable for the design of FIR digital filters with different technical requirements in the frequency domain.A design example is employed to illustrate the efficiency of the algorithm.

Three-step Iterations with Errors for Nonlinear Strongly Accretive Operator Equations

In this paper, we suggest and analyse a three-step iterative scheme with errors for solving nonlinear strongly accretive operator equation Tx = f without the Lipshitz condition. The results presented in this paper improve and extend current results in the more general setting.

BRIDGE-TOUGHENING ANALYSIS OF THE FIBER REINFORCED COMPOSITE CONTAINING INTERPHASE EFFECT

A detailed fracture mechanics analysis of bridge-toughening in a fiber reinforced composite is presented in this paper. The integral equation governing bridge-toughening as well as crack opening displacement (COD) for the composite with interfacial layer is derived from the Castigliano's theorem and interface shear-lag model. A numerical result of the COD equation is obtained using the iteration solution of the second Fredholm integral equation. In order to investigate the effect of various parameters on the toughening, an approximate analytical solution of the equation is present and its error analysis is performed, which demonstrates the approximate solution to be appropriate. A parametric study of the influence of the crack length, interfacial shear modules, thickness of the interphase, fiber radius, fiber volume fraction and properties of materials on composite toughening is therefore carried out. The results are useful for experimental demonstration and toughening design including the fabrication process of the composite.

An Improved Algorithm for 3D Reconstruction Integration Based on Stripe Reflection Method

This paper introduces the basic principle of stripe reflection method and proposes an improved algorithm on the traditional Southwell gradient iterative integration algorithm. The algorithm adds a coefficient value with an attenuation factor to the compensation height value and the value of the attenuation factor is changed by the determination of the compensation height threshold. Through computer simulation, the fitting error of the reconstructed surface show that the RMS of the new method is one order of magnitude better than the traditional algorithm and the PV value of the high frequency part is about 1/15 of the traditional algorithm. It is proved that the improved algorithm can effectively improve the convergence and noise resistance of the iterative algorithm.

基于两步迭代收缩法的多稀疏空间图像快速重构方法

由于多稀疏空间图像重构时,像素范围选取过大、峰值信噪比低以及重构时间长,导致图像重构方法存在重构效果差的问题,提出基于两步迭代收缩法的多稀疏空间图像快速重构方法。明确多稀疏空间图像重构存在的问题,在明确问题后,以迭代收缩阈值算法为基础,引入迭代加权收缩算法,结合每一轮迭代结果作为初值,完成图像重构的两步迭代收缩法设计,实现多稀疏空间图像快速重构。实验结果表明:应用该方法后的重构多稀疏空间图像峰值信噪比达到37.9 dB以上,图像重构时间仅为16.0 ms,图像结构相似性达到了0.98以上,并且重构多稀疏空间图像的效果更好,经过实验分析证实了所提方法具备可行性。

自适应时间步长法在非饱和渗流中的应用研究

Richards方程是非饱和渗流理论的基本方程,常用数值方法结合有效的迭代技术进行求解,时间步长调整方法常用来提高计算效率。为探究不同自适应时间步长法的数值表现,采用有限单元法结合自适应松弛Picard法和自适应时间步长法,开发了非饱和渗流有限元程序。通过模拟非饱和渗流算例,研究了不同自适应时间步长法对计算精度与效率的影响。结果表明,开发的程序是实用和可靠的,在时间步长发生较大变化时也能保证计算的稳定性。直接推断法虽然简单高效,但在求解迭代收敛难度较大的问题时,该方法难以保证良好的计算精度。截断误差法的数值表现受截断误差阈值影响,具有阈值越小,精度越高、效率越低;阈值越大,精度越低、效率越高的特点,通过调整阈值,该方法能更好地平衡计算精度和效率。研究成果对于高效非饱和渗流有限元程序的开发和应用具有一定的参考价值。

一种消除周期性毛刺相位误差的互补格雷码双N步相移法

互补格雷码双N步相移法因其具有鲁棒性好、检测精度高等特点在条纹投影轮廓术领域成为研究热点。然而,传统互补格雷码双N步相移法存在检测效率低以及未消除周期性毛刺相位误差的问题。针对这些问题,本文对传统互补格雷码双N步相移法进行改进消除周期性毛刺相位误差,首先通过相机捕获形变条纹图像并计算出两组截断相位,然后利用两组截断相位的相关性消除检测数据中的相位差、周期性毛刺相位误差,再对两组截断相位进行融合,最后通过互补格雷码相位展开法对融合后的截断相位进行相位展开。实验得出本文方法在检测效率不变的情况下,能有效消除周期性毛刺相位误差,得到高精度展开相位,相比于未消除周期性毛刺相位误差的互补格雷码双N步相移法,本文检测方法精度提高了约24.57%,相比于互补格雷码N步相移法,本文检测方法精度提高了约6.29%。

2022年1月8日青海门源6.9级强地震动模拟研究

为满足数字化时代应急处置的新要求,基于随机有限断层法的发展,利用青海门源地区地下三维速度结构的模型和v S30数据,通过逐步迭代射线追踪法、格林函数位移解析相位谱和有限断层法的联合计算,以青海门源6.9级地震为例,获得具有地表土层放大效应的强地震动模拟数据,进而绘制出研究区内PGA和烈度分布模拟图;并与实际台站记录的PGA和实地调查烈度结果相比,其烈度区划范围基本一致,同时也验证此联合计算方法可用于未来地震灾害的快速评估,并为灾后应急救援提供参考。

基于改进稀疏重构模型的声学层析温度分布重建

为进一步提高基于声学层析成像的温度分布重建精度,引入了一种偏差较小的误差函数(ERF)对稀疏重构模型进行改进,并使用迭代重加权算法对模型进一步优化,最后采用交替方向乘子算法(ADMM)对模型进行求解,从而完成温度分布重建。进行了仿真与实验测试,并与LASSO、ART及Landweber算法进行比较,仿真实验中基于ERF模型的温度分布重建质量最优,其平均相对误差及均方根误差分别为0.1%和0.14%;实验测试中,其设定温度点重建温度误差绝对值的平均值最小,为0.043%,明显小于其它3种算法。

Existence and numerical approximation of a solution to frictional contact problem for electro-elastic materials

In this paper,a frictional contact problem between an electro-elastic body and an electrically conductive foundation is studied.The contact is modeled by normal compliance with finite penetration and a version of Coulomb’s law of dry friction in which the coefficient of friction depends on the slip.In addition,the effects of the electrical conductivity of the foundation are taken into account.This model leads to a coupled system of the quasi-variational inequality of the elliptic type for the displacement and the nonlinear variational equation for the electric potential.The existence of a weak solution is proved by using an abstract result for elliptic variational inequalities and a fixed point argument.Then,a finite element approximation of the problem is presented.Under some regularity conditions,an optimal order error estimate of the approximate solution is derived.Finally,a successive iteration technique is used to solve the problem numerically and a convergence result is established.

星间测量基线偏差搜索算法及误差分析

基线偏差会在相对角度测量结果转换到主星坐标的过程中引入显著误差,针对这一问题在方位角和俯仰角(-60°,+60°)范围内对基线偏差引入的转换偏差进行了研究,并提出了一种测量基线在轨校准的搜索算法。该方法利用卫星搭载的近距离高精度感知系统,同时对从星位置进行感知测量,以近距离感知系统作为校准数据源,通过步长加速算法搜索基线偏差并校准,使得本系统感知结果与校准数据源同步,从而达到测量基线校准的目的。搜索完成后的方位角与俯仰角的转换偏差均优于0.012°,低于热噪声引入的最大测量误差。

DEM粗差权值衰减迭代探测算法研究

为剔除经滤波处理后的机载激光雷达(LIDAR)地面点云数据中的残留非地面点,提高由其制作生产的数字高程模型(DEM)的精度,提出一种基于LIDAR点云数据所生成的不规则分布数据DEM粗差权值衰减迭代探测算法。该算法将滤波后残留的非地面点视为DEM粗差,基于地理学局部地形相似性原理,根据数据点密度及地形起伏变化程度确定局部窗口并进行二次曲面拟合,求解局部窗口内各数据点高程残差值,从而构建粗差相关检验量来定位粗差点。同时,该算法借鉴选权迭代粗差定位法思想,通过迭代,不断衰减含粗差观测点的权值,从而不断减小其对局部窗口二次曲面拟合产生的不良影响,降低地面点被误判为粗差点的概率。通过实验验证,该算法能有效提升DEM粗差探测率并极大降低粗差误判概率,粗差剔除率为98.02%,粗差误判率为1.71%。