大规模多输入多输出(Multiple-Input Multiple-Output,MIMO)系统由于具备较多的天线数,会导致传统线性信号检测算法如最小均方误差(Minimum Mean Square Error,MMSE)的复杂度过高。针对以上问题,提出了F修正的自适应超松弛迭代(F-correc...大规模多输入多输出(Multiple-Input Multiple-Output,MIMO)系统由于具备较多的天线数,会导致传统线性信号检测算法如最小均方误差(Minimum Mean Square Error,MMSE)的复杂度过高。针对以上问题,提出了F修正的自适应超松弛迭代(F-corrected Adaptive Successive over Relaxation,FA-SOR)检测算法。该算法首先利用超松弛迭代(Successive over Relaxation,SOR)算法避免高阶矩阵求逆运算,降低复杂度;其次使用F修正的公式自动更新SOR算法迭代使用的松弛参数,同时优化迭代的公式与初始解来加快收敛速度。仿真结果表明,不论在理想独立信道还是相关信道下,相比于现有的自适应SOR算法,FA-SOR都能以更低的复杂度达到更低的误码率,同时逼近MMSE算法的性能。展开更多
In this paper, we investigate an accelerated version of the discrete-time Jacobi waveform relaxation iteration method. Based on the well known Chebyshev polynomial theory, we show that significant speed up can be achi...In this paper, we investigate an accelerated version of the discrete-time Jacobi waveform relaxation iteration method. Based on the well known Chebyshev polynomial theory, we show that significant speed up can be achieved by taking linear combinations of earlier iterates. The convergence and convergence speed of the new iterative method are presented and it is shown that the convergence speed of the new iterative method is sharper than that of the Jacobi method but blunter than that of the optimal SOR method. Moreover, at every iteration the new iterative method needs almost equal computation work and memory storage with the Jacobi method, and more important it can completely exploit the particular advantages of the Jacobi method in the sense of parallelism. We validate our theoretical conclusions with numerical experiments.展开更多
This present paper has proved the theorem of the Point Optimal Variable Successive Over Relaxation (OVSOR) method of the three-dimensional unsteady flow in the reservoir, and has put forward a formu- la for calculatin...This present paper has proved the theorem of the Point Optimal Variable Successive Over Relaxation (OVSOR) method of the three-dimensional unsteady flow in the reservoir, and has put forward a formu- la for calculating optimal parameters for OVSOR which vary with space points and time points. Using this method, internal memory of computer is the smallest, calculating work is the smallest, and calculating funds are the smallest. It is very easy to operate on microcomputers for three-dimensional res- ervoir simulation. The method is stable and convergent even if the time steps are taken to be large (for example, one year). The same applies for space steps. It is applicable both for homogeneous, isotropic porous mediums and for heterogeneous, anisotropic porous medium. On IBM microcomputers with internal memory of 512 thousand bytes, 8000 grid points may be cal- culated for three-dimensional simulation. It takes only two minutes to get convergence for one time step. It may be extended to three-dimensional heat conduction equation and three-dimensional simulation of the ground water flow. It looks much more advantageous for two-dimensional simulation.展开更多
文摘大规模多输入多输出(Multiple-Input Multiple-Output,MIMO)系统由于具备较多的天线数,会导致传统线性信号检测算法如最小均方误差(Minimum Mean Square Error,MMSE)的复杂度过高。针对以上问题,提出了F修正的自适应超松弛迭代(F-corrected Adaptive Successive over Relaxation,FA-SOR)检测算法。该算法首先利用超松弛迭代(Successive over Relaxation,SOR)算法避免高阶矩阵求逆运算,降低复杂度;其次使用F修正的公式自动更新SOR算法迭代使用的松弛参数,同时优化迭代的公式与初始解来加快收敛速度。仿真结果表明,不论在理想独立信道还是相关信道下,相比于现有的自适应SOR算法,FA-SOR都能以更低的复杂度达到更低的误码率,同时逼近MMSE算法的性能。
文摘In this paper, we investigate an accelerated version of the discrete-time Jacobi waveform relaxation iteration method. Based on the well known Chebyshev polynomial theory, we show that significant speed up can be achieved by taking linear combinations of earlier iterates. The convergence and convergence speed of the new iterative method are presented and it is shown that the convergence speed of the new iterative method is sharper than that of the Jacobi method but blunter than that of the optimal SOR method. Moreover, at every iteration the new iterative method needs almost equal computation work and memory storage with the Jacobi method, and more important it can completely exploit the particular advantages of the Jacobi method in the sense of parallelism. We validate our theoretical conclusions with numerical experiments.
文摘This present paper has proved the theorem of the Point Optimal Variable Successive Over Relaxation (OVSOR) method of the three-dimensional unsteady flow in the reservoir, and has put forward a formu- la for calculating optimal parameters for OVSOR which vary with space points and time points. Using this method, internal memory of computer is the smallest, calculating work is the smallest, and calculating funds are the smallest. It is very easy to operate on microcomputers for three-dimensional res- ervoir simulation. The method is stable and convergent even if the time steps are taken to be large (for example, one year). The same applies for space steps. It is applicable both for homogeneous, isotropic porous mediums and for heterogeneous, anisotropic porous medium. On IBM microcomputers with internal memory of 512 thousand bytes, 8000 grid points may be cal- culated for three-dimensional simulation. It takes only two minutes to get convergence for one time step. It may be extended to three-dimensional heat conduction equation and three-dimensional simulation of the ground water flow. It looks much more advantageous for two-dimensional simulation.
