Asymptotic Bit Error Probability Analysis And Adaptive Algorithm Design For Spatial Scattering Modulation

In the face of the increasingly deficient wireless spectrum resources,multiple input multiple output(MIMO)technology takes advantages of its own characteristics to achieve higher spectrum efficiency,which plays a key role in the development of wireless communication.However,using multiple antennas to obtain diversity gain and multiplexing gain also brings some problems to the communication systems,such as inter channel interference(ICI)and inter antenna synchronization(IAS).In recent years,for ICI and IAS,space shift keying(SSK),spatial modulation(SM),and polarization shift keying(polarSK)are widely studied.Compared with traditional MIMO system,the single radio frequency(RF)MIMO system has higher energy efficiency,lower hardware cost and lower system complexity.Inspired by the single RF MIMO systems,the spatial scattering modulation(SSM)technology is proposed,which exploits the scattering clusters in the propagation environment as the information index to improve the spectral efficiency based on the traditional modulation.In order to analyze and improve the performance of SSM system,the closed solution of the upper bound of average bit error probability(ABEP)and its linear progressive expression are derived.On this basis,the diversity gain of SSM system is analyzed by progressive expression.Finally,based on the traditional SSM system,the adaptive SSM(ASSM)algorithm is proposed to obtain performance gains for the traditional SSM system.First of all,based on the framework of SSM system,the upper bound of closed solution and approximate solution of ABEP of SSM system are derived.The ABEP derived in this paper can replace the traditional ABEP analytical solution to analyze the system performance of SSM.The diversity gain is extracted by approximate solution,and the performance of SSM system increases with the increase of the totalnumber of scattering clusters and the decrease of the number of modulated clusters.On this basis,two kinds of ASSM algorithm based on the analytic symbol error rate(SER)are proposed in this paper,namely the scatter equal probability selection algorithm and the symbol equal probability selection algorithm.The ASSM system optimizes the system parameters in real-time for the channel response,and provides the throughput gain for the SSM system.At the same time,this paper takes the calculation of the number of the number of candidate optimization schemes as the complexity standard to analyze and compare the complexity of the ASSM algorithms.The simulation results show that,compared with the scatter equal probability selection algorithm,the symbol equal probability selection algorithm has higher throughput,but the complexity is too high.The complexity of the algorithm is in different order of magnitude with the scatter equal probability selection algorithm.