Abstract
The concept of Generalized Spatial modulation (GSM) has been proposed as a promising architecture for low complexity massive MIMO systems. The GSM systems activates only small number of transmit antennas at a symbol time which simply the complexity in implementation. Different selection of the activating antennas patterns change the average symbol error rate (SER) performance, however the optimal selection of the activating antenna patterns is an NP hard problem due to the complicated connection in the universe of antenna patterns set. Through [1] has proposed a suboptimal design criterion for the codeword construction problem, it does not proposed the corresponding algorithms to realize the criterion. Even the suboptimal algorithm for the GSM codeword construction problem has not been proposed yet. Motivating by the above reasons, in this thesis we propose two GSM codeword construction criterions in the sense of minimizing the average symbol error rate (SER). We also design the corresponding systematic greedy-like algorithms for the proposed criterions and for the criterion proposed by [1]. At the last of the thesis we show the numerical results for the proposed codeword construction algorithms and we verify the performance of the proposed algorithms are indeed better than the algorithm whose design criterion is proposed by [1] and also better than the random selection method.