4.7 Article

Transmit Precoded Spatial Modulation: Maximizing the Minimum Euclidean Distance Versus Minimizing the Bit Error Ratio

Journal

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume 15, Issue 3, Pages 2054-2068

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2015.2497692

Keywords

Minimum Euclidean distance; minimum BER; multiple-input multiple-output; pre-coding technique; spatial modulation

Funding

  1. National Science Foundation of China [61501095]
  2. National High-Tech R&D Program of China (863 Project) [2014AA01A707]
  3. Foundation Project of National Key Laboratory of Science and Technology on Communications [9140C020108140C02005]
  4. Fundamental Research Funds for the Central Universities [ZYGX2015KYQD003]
  5. European Research Council's Advanced Fellow Grant
  6. European Commission under FP7-PEOPLEMITN-CROSSFIRE project [317126]

Ask authors/readers for more resources

In this paper, we investigate a pair of transmit precoding (TPC) algorithms conceived for spatial modulation (SM) systems communicating over flat-fading multiple-input multiple-output (MIMO) channels. In order to retain all the benefits of conventional SM, we design the TPC matrix to be diagonal and introduce two design criteria for optimizing the elements of the TPC matrix. Specifically, we first investigate a TPC design based on maximizing the minimum Euclidean distance d(min) (max-d(min)) between the SM signal points at the receiver side. A closed-form solution of the optimal max-d(min)-based TPC matrix is derived. Then, another TPC design algorithm is proposed for directly minimizing the bit error ratio (BER) upper bound of SM, which is capable of jointly optimizing the overall Euclidean distance between all received signal points. In the minimum BER (min-BER)-based TPC algorithm, the theoretical gradient of the BER with respect to the diagonal TPC matrix is derived and a simplified iterative conjugate gradient (SCG) algorithm is invoked for TPC optimization. Our simulation results demonstrate that the proposed max-d(min)-based TPC algorithm is optimal in terms of the minimum distance. However, increasing d(min) does not achieve a further BER improvement. We also confirm that the min-BER-based TPC outperforms the max-d(min)-based TPC schemes in terms of the achievable BER performance.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available