线性受限最小二乘恒模波束形成算法

Linearly Constrained LSCM Beam-forming Algorithm

将线性受限条件运用于最小二乘,提出了一种线性受限最小二乘恒模波束形成算法,称为LC-LSCMA,并将它与传统的最小二乘恒模波束形成算法(LSCMA)及预解扩最小二乘恒模波束形成算法(P-LSCMA)进行了仿真比较。仿真结果表明,提出的LC-LSCMA算法比LSCMA及P-LSCMA的信干比性能和误码率性能要好,特别在低信噪比情况下性能仍优于LSCMA。

In this paper,a linearly constrained least squares constant modulus beam-forming algorithm (LC-LSCMA) is proposed.It applies the linearly constrained condition to the least squares constant modulus algorithm.We simulated and compared the proposed LC-LSCMA with the conventional LSCMA and pre-decoding LSCMA.Simulation results show that the proposed LC-LSCMA algorithm is superior to the conventional LSCMA and P-LSCMA,especially with low SNR.