GSM-MBM系统中基于松弛迭代的低复杂度检测算法

A Low-Complexity Detection Algorithm Based on Relaxation Iteration Method for GSM-MBM Systems

针对基于媒介调制的广义空间调制(GSM-MBM)系统接收端最大似然(ML)检测算法计算复杂度高且随激活天线数呈指数递增的问题,提出一种基于能量排序下的松弛迭代思想的低复杂度检测算法(EO-RIM).该算法对所有可能的发射天线组合及相应镜像激活模式组合下的信号能量总值进行排序,再通过松弛迭代算法依次检测相应的调制信号,并通过预设阈值来协调误码率(BER)性能和计算复杂度之间的关系.仿真结果表明,在GSMMBM系统中,EO-RIM算法的BER性能逼近ML检测算法,与基于有序块的最小均方误差(OB-MMSE)检测算法几乎一致,而EO-RIM的计算复杂度随激活天线数呈平方递增而非指数递增,相比OB-MMSE算法降低了一个数量级.

The complexity of the maximum likelihood(ML)detector of the generalized spatial modulation-media based modulation system is very high and exponentially grows with the number of active antennas.A low-complexity detection algorithm termed energy ordered-relaxation iteration method(EORIM)is proposed.First,the possible active transmit antenna combinations and corresponding mirror activation pattern combinations are sorted according to their signal energy,then a relaxation iterative method is performed to obtain corresponding modulated signals.According to a predefined threshold,the algorithm strikes a trade-off between complexity and performance.Simulations show that the bit error ratio performance of EO-RIM algorithm approaches that of ML detection algorithm and is comparable to that of the ordered block minimum mean squared error detection algorithm.The computational complexity of EORIM grows with the square of the number of active antennas,while ML detector has exponential complexity.