STBC-CSM Cyclic Structured Space-Time Block Coded Spatial Modulation STBC-SM Space-Time Block Coded Spatial Modulation. STBC-TSM Space-Time Block Coded Spatial Modulation with Temporal Modulation STCM Space-Time Channel Modulation.
Spatial multiplexing
Spatial diversity
Smart antenna and beamforming
ML detection can be performed on this subset, thereby reducing the computational complexity of the ML detector. However, MIMO is limited by ICI, IAS, computational complexity of its detector, hardware design complexity, etc.
V-BLAST
Therefore, the most likely candidate set of the transmitted APM symbol, which provides the minimum Frobenius norms and a subset Ω, can be selected. Furthermore, ordered QR decomposition has been used to improve the computational complexity of the optimal ordered MMSE detector for V-BLAST, while preserving the error performance [19].
MIMO orthogonal frequency division multiplexing (MIMO-OFDM)
OFDM
Undercurrents are detected by curves using linear detection weights, while other undercurrents are assumed to be interference. The CP is added/hanged at the end/beginning of the OFDM symbol to reduce the effect of ISI [21, 22].
MIMO-OFDM
Alamouti space-time block codes (STBC)
In addition, STBC can achieve maximum diversity without feedback from receivers, and receivers use linear processing. However, the improvement in error performance comes with increased computational complexity, especially when using the ML detector [30].
Index modulation
- Spatial modulation (SM)
- Space shift keying modulation (SSK)
- Quadrature spatial modulation (QSM)
- STBC-SM
- STBC-SM with cyclic structure (STBC-CSM)
- STBC with temporal spatial modulation (STBC-TSM)
- Media-based modulation (MBM)
Although the spectral efficiency of classical MIMO is not improved, redundant copies of transmitted symbols bring improved error efficiency [29]. With MBM, multipath fading is converted to AWGN, improving the system's error performance.
Closed-loop (adaptive) index modulation
Furthermore, the computational complexity of STBC-SM is significantly improved by using the orthogonality of the Alamouti STBC codeword [ 40 ]. Additionally, an expression for the union bound on the average bit error probability for an optimal ML detector is derived, which to the best of the author's knowledge has not been presented in the existing literature.
Paper A: Quadrature Spatial Modulation Orthogonal Frequency Division
To reduce the computational complexity for the optimal ML detector of MBSTBC-SM/MBSTBC-CSM, a low complexity near-ML detector using orthogonal projection of signals is explored for the proposed system. One of the advantages of media-based index modulation is that the MAPs consist of good and bad channels, which are a subset of the Mrf MAPs.
Paper B: Low-Complexity Detection for Space-Time Block Coded Spatial
Numerical results to demonstrate the effectiveness of this scheme are presented and compared with competing schemes.
Paper C: RF Mirror Media-Based Space-Time Block Coded Spatial
Paper D: A Study of Spatial Media-Based Modulation Using RF Mirrors
Atawi, “Performance of spatial quadrature modulation in amplification and forward cooperative relaying,” IEEE Communications Letters, vol. Badarneh, “Impact of cochannel interference on the performance of MIMO systems for quadrature spatial modulation,” IEEE Communications Letters, vol. Wang, “High-speed space-time block-coded spatial modulation with cyclic structure,” IEEE Communications Letters, vol.
Xu, “Uncoded spatiotemporal tagging diversity - application of media modulation with RF mirrors,” IEEE Communications Letters, vol. Li, “Link adaptation for spatial modulation with limited feedback,” IEEE Transactions on Vehicular Technology , vol.
The QSM-OFDM Transmitter
Note: The following notations are used in this document; bold and uppercase letters represent matrices, while bold lowercase letters denote matrix column vectors. Other notations include (·)T, (·)H k · kF, <(·), and ⊗, which represent the transposed, Hermitian, inverse time-domain signal, Frobenius norm, real part of a complex variable, and time convolution, respectively. In this document, Nt,NrandM will represent the number of transmit antennas, the number of receive antennas, or the order of MQAM modulation.
For example, j`[p] is the data on the p-th subcarrier of the `-th OFDM symbol and will be transmitted using the `-th antenna. This process is followed by the addition of a cyclic prefix (CP) to eliminate inter-symbol interference (ISI) before the onward simultaneous transmission by Nt steering antennas via the MIMO channelH.
The QSM-OFDM Receiver
The estimates for `ˆ<,`ˆ=,uˆ It should be noted that wherever possible, the arithmetic path that yields the lower computational complexity in achieving a given detection at the receiver is assumed, and the total complexity is the sum of the real multiplications and real additions for each subcarrier. As a background to the calculation of computational complexity in terms of real operations performed during processing, a complex multiplication (CM) is achieved by performing four real multiplications (4m) and two real additions (2a), making a total of six produces real operations. , while a complex addition (CA) is obtained by performing2a, as explained in [22]. QSM-OFDM MRC-OFDM [23] Alamouti-OFDM [15] VBLAST-OFDM [3] The VBLAST-OFDM has a slightly better error performance of about 1.5dB in SNR over QSM-OFDM at a BER of 10−5, when using the same number of transmit antennas. A summary of the BER performance of the proposed QSM-OFDM system compared with other OFDM systems is presented in Table A.5. The error performance of QSM-OFDM over SM-OFDM is about 4 dB gain in SNR when using 4 bits/s/Hz for each subcarrier of the OFDM symbol. The proposed QSM-OFDM scheme exhibited excellent error performance over MRC-OFDM, MIMO-OFDM and Alamouti-OFDM. From the results, QSM-OFDM also shows a better error performance than VBLAST-OFDM at high SNR. The ML detector imposes a high CC, as will be discussed in section 2.3, hence the need for an LC detector. Proposed ABEP analysis for STBC-CSM 2] for the '-th transmitting antenna pair by choosing the ζ1 and ζ2 symbols, respectively, which yield the smallest projection norms based on the metrics given in (B.18) and (B.19), respectively. For example, in [10], a high-speed STBC-SM (H-STBC-SM) was introduced, which uses spatial constellation matrices for four and six transmitting antennas. Therefore, the spectral efficiency provided by the spatial domain of STBC-CSM is an improvement over STBC-SM. Although STBC-CSM requires fewer transmitting antennas to achieve the spectral efficiency of STBC-SM, the STBC-SM system shows slightly better error performance than STBC-CSM. Furthermore, the orthogonality of the STBC-SM codeword is used as a criterion to achieve a low-complexity ML detector [4]. The application of MBM to improve the error performance/spectral efficiency of STBC-CSM and STBC-SM, in the form of media-based STBC-SM (MBSTBC-SM) and media-based cyclic structured space-time block coded spatial modulation (MBSTBC-CSM) is proposed . Background of STBC-CSM/STBC-SM In this section, the theoretical ABEP of MBSTBC-CSM/MBSTBC-SM over a fast frequency-flat Rayleigh fading channel using ML detection is formulated. Considering that MBSTBC-CSM/MBSTBC-SM can be viewed as a NtMrf × Nr. STBC. In this section, a low-complexity detector is proposed for MBSTBC-CSM/MBSTBC-SM over a fast frequency-flat Rayleigh fading channel. The proposed low-complexity near-ML detector of MBSTBC-CSM/MBSTBC-SM, which uses orthogonal projection [24, 26], first determines ζ1 and ζ2most likely estimates z`p =h. The algorithm for the proposed low complexity detector of MBSTBC-CSM/MBSTBC-SM is as follows. In this section, the computational complexities of the proposed ML and low-complexity near-ML detectors are compared for MBSTBC-CSM/MBSTBC-SM in terms of the number of complex operations [ 26 , 27 ]. The numerical values of the computational complexity in terms of complex operations for the ML and the low complexity detectors are shown in Table C.4 for a spectral efficiency of 7 bpcu. It should be noted that although the computational complexities of MBSTBC-CSM and MBSTBC-SM are the same for a given spectral efficiency δSE, the number of transmitting antennas used by MBSTBC-SM is larger than that of MBSTBC-CSM. This section presents the BER performance of the proposed MBSTBC-CSM and MBSTBC-SM using ML and low complexity detectors. The theoretical union bound to the ABEP of the ML detectors for MBSTBC-CSM and MBSTBC-SM is evaluated and used to validate the Monte Carlo simulation results. Moreover, error performance comparisons between the ML detector, the low-complexity detector and the theoretical ABEP of the proposed MBSTBC-CSM and MBSTBC-SM are presented. C.3, MBSTBC-SM numerical results for schemes 1, 2 and 3 with STBC-CSM and STBC-SM are compared for 6 bpcu. STBC-SM yields a marginal improvement of 0.05 dB of SNR gain compared to STBC-CSM, which was not visible in the 5 bpcu plots shown in the figure. The effects of MAP optimization techniques on ABEP and the proposed computational complexity for the SMBM system are discussed. The remainder of the paper is organized as follows: Section 2 presents the system model of the SMBM system for an i.i.d. The model of the SMBM system, with mrf RF mirrors at each transmitting antenna is shown in Fig. The SMBM system uses the RF-RF mirrors to increase the spectral efficiency of the traditional SM system with mrf bits/s/Hz. An alternative design to improve the fault performance of the SMBM system is a closed-loop SMBM system, shown in Fig. NORM-MAP selection for SMBM The computational complexity imposed by the CNB-MAP selection algorithm in terms of floating point operations is calculated as follows: Since Step 1 uses the NORM-MAP algorithm in (D.9), the computational complexity imposed by Step 1 is δstep 1 = NrfNt( 2No−1). Therefore, the overall computational complexity of the CNB-MAP can be represented as δCNB-MAP = δstep 1+ δstep 4 =NrfNt(2Nr−1) + M2rf. It can be seen from Table D.3 that the NORM-MAP has a very reduced computational complexity compared to the CNB-MAP. The computational complexity involved in optimizing these MAPs is 896 and 82,496 for NORM-MAP and CNB-MAP, respectively. However, this comes as a trade-off in relation to the computational complexity, as the computational complexity of NORM-MAP is 98.9%. System model of the proposed QSM-OFDM Bar chart showing the computational complexities of different system BER versus SNR for 4 bits/s/Hz for QSM-OFDM and other schemes BER versus SNR for 6 bits/s/Hz for QSM-OFDM and other schemes BER versus SNR for 8 bits/s/Hz for QSM-OFDM and other schemes BER performances for ML, LC detectors including theoretical ABEP of the STBC- BER performances for ML, LC detectors including theoretical ABEP of the STBC- System model of MBSTBC-CSM or MBSTBC-SM BER performance of STBC-CSM, STBC-SM and MBSTBC-SM for 5 bpcu BER performance of STBC-CSM, STBC-SM and MBSTBC-SM for 6 bpcu BER performance of STBC-CSM, STBC-SM and MBSTBC-CSM for 5 bpcu BER performance of STBC-CSM, STBC-SM and MBSTBC-CSM for 6 bpcu Grouping of input bits for the proposed QSM-OFDM Outputs from the QSM modulator Comparison of computational complexity for different OFDM systems Parameters for simulation [1] Comparison of BER performances of QSM-ODFM over other schemes Comparison of CCs between ML and LC detectors Bit assignments and outputs from RF switch controller for Scheme 2 Bit assignments for Scheme 1 and Scheme 3 Outputs from RF switch controller for Scheme 1 and Scheme 3 Computational complexity of ML with low-complexity detector Illustration of bit mapping for SMBM system Output of the SMBM switch controller Computational complexities of NORM-MAP and CNB-MAPSM-OFDM [1]
Background/System model
Proposed LC detector for STBC-CSM
CC analysis
System model of the proposed MBSTBC-CSM/MBSTBC-SM
Computational complexity of the ML detector for MBSTBC-CSM/MBSTBC-
Computational complexity of the low-complexity near-ML detector for
MBSTBC-CSM and MBSTBC-SM
Low-complexity detector
CNB-MAP selection for SMBM