Research Article | Open Access

# SER Performance of Enhanced Spatial Multiplexing Codes with ZF/MRC Receiver in Time-Varying Rayleigh Fading Channels

**Academic Editor:**Joaquin Miguez

#### Abstract

We propose enhanced spatial multiplexing codes (E-SMCs) to enable various encoding rates. The symbol error rate (SER) performance of the E-SMC is investigated when zero-forcing (ZF) and maximal-ratio combining (MRC) techniques are used at a receiver. The proposed E-SMC allows a transmitted symbol to be repeated over time to achieve further diversity gain at the cost of the encoding rate. With the spatial correlation between transmit antennas, SER equations for -ary QAM and PSK constellations are derived by using a moment generating function (MGF) approximation of a signal-to-noise ratio (SNR), based on the assumption of independent zero-forced SNRs. Analytic and simulated results are compared for time-varying and spatially correlated Rayleigh fading channels that are modelled as first-order Markovian channels. Furthermore, we can find an optimal block length for the E-SMC that meets a required SER.

#### 1. Introduction

Multiple-input multiple-output (MIMO) schemes are typical for the purposes of maximizing data rate [1] or diversity gain [2, 3]. A maximum data rate is achieved by a spatial multiplexing method [1, 4] by which a single user’s data stream is split into multiple substreams and transmits them in parallel using an array of transmit antennas over the same frequency band. A spatial multiplexing code (SMC) given in [1, equation ] is capable of achieving high spectral efficiency. However, it does not achieve spatial transmit diversity since each antenna transmits an independent data stream. Such a SMC has been adopted in cooperative systems as well as cognitive radio systems in order to improve the spectral efficiency [5–7].

In this study, we address enhanced SMCs, referred to as E-SMCs, which extend the conventional SMC in [1, equation ] to transmit the same symbol repeatedly over time and hence enhance temporal transmit diversity instead of losing certain multiplexing gain. In the literature, variable-rate space-time block codes (vr-STBCs) also have been considered as a tool of realizing a tradeoff between the multiplexing and the spatial diversity gain [8, 9]. The vr-STBCs introduce the multiplexing gain into STBCs that achieve the full spatial diversity gain on slow fading channels. Unlike vr-STBCs, E-SMCs achieve time diversity gain on fast varying channels. E-SMCs as well as vr-STBCs are useful for obtaining various encoding rates and unequal error protection in MIMO systems. E-SMCs in this paper use a simple repetition code structure. Since other efficient code structures with coding schemes superior to the repetition coding scheme can improve the performance further, E-SMCs with repetition coding may give a lower bound on the performance.

In decoding E-SMCs, we separate received signals using a zero-forcing (ZF) receiver [4] per time slot and then combine the outputs of the ZF receiver using maximal-ratio combining (MRC) [10] per code block. The MRC is selectively performed only for the repeated symbols in a code block. We use a ZF receiver since it generally has low implementation complexity and makes SER analysis tractable. Furthermore, MRC offers a maximum coding gain of the E-SMC with the ZF receiver.

Given a required symbol error rate (SER) for each data stream, we provide a method that constructs E-SMCs consisting of a minimal number of time slots. And the codes are further optimized to have a maximum encoding rate. We will compare the data rates between E-SMCs and vr-STBCs when required SER is given. E-SMCs perform better than vr-STBCs when the time correlation of radio channels is low since vr-STBCs are designed on the assumption that the channel is constant during a transmitting code block.

To investigate SER performance for various encoding rates of E-SMCs, we assume an equal number of transmit and receiving antennas, an equal power allocation between the transmitters, and perfect channel state information known at the receivers. We also assume that spatial correlation exists only at the transmitters, which is valid when the transmitters are sufficiently high above the local scattering environments [11, 12]. Under these assumptions, SER equations of -ary QAM and PSK constellations are analytically obtained, respectively, by using a moment generating function (MGF) approximation for signal-to-noise ratio (SNR) under the independence assumption on the ZF output SNRs.

With numerical investigation, analytical and simulated results are compared for spatially correlated and time-varying Rayleigh fading channels where the time variability is modelled as first-order Markovian channel [13]. Numerical results show that the analytical SER curve is perfectly matched with the simulated one if the correlation of channels between time slots does not exist, and the gap between the simulated SER result for zero time correlation and that for low time correlation (e.g., less than 0.7 in the numerical results) is negligible, regardless of the spatial correlation. Moreover, the results show that the proposed E-SMCs offer better SER performance, given a data rate, than the conventional SMC at high SNRs. We also study the impact of transmit correlation on the SER performance.

This paper is organized as follows. Section 2 describes the system and the channel model considered in this paper and introduces the E-SMC. Section 3 provides approximate SER analysis for E-SMCs with ZF and MRC. Section 4 presents an optimization of the E-SMC. Section 5 gives the numerical results in which the analytical results are compared with the simulated ones. Finally, Section 6 concludes the paper.

#### 2. System Description

##### 2.1. Enhanced Spatial Multiplexing Codes (E-SMCs)

An E-SMC matrix for time slots is defined as the following form: where is a set of complex symbols to be transmitted and is a fixed code matrix of dimension for the th complex symbol which satisfies the following properties.(a)Each entry of for is either 0 or 1.(b)The sum of the entries in each column of is either 0 or 1.(c), where each entry of matrix is either 0 or 1.

In the three properties, it is noted that modulo-2 arithmetic is not assumed. Thus, the properties imply that the E-SMC is based on a simple repetition code over time slots and not able to transmit the same symbols over transmit antennas in each time slot. With the E-SMC transmission matrix in (1), complex symbols are transmitted via transmit antennas over time slots, and the encoding rate of an E-SMC is referred to as Two examples of E-SMCs are as follows: where denotes the th complex symbol at the th time slot for and . In (3), and with have and , respectively. It is noted that a conventional SMC is a special case of E-SMCs with and , which is given as where denotes the transpose.

##### 2.2. Received Signals in Spatially Correlated MIMO Channels

We consider a MIMO system with transmit antennas and receiving antennas. Let denote an transmission matrix, where denotes the code length. Then, the received signal is expressed as where vector is the th column of transmission matrix , denotes the total average power transmitted on antennas, and denotes the channel matrix at time slot . vector is the additive white Gaussian noise (AWGN) at a receiver and the AWGN with noise variance , given by filtering and sampling the noisy received signal, is modelled by a complex-valued Gaussian vector: where is an column vector with all zero elements and is an identity matrix.

We consider time-varying and flat Rayleigh fading channels. We also assume the perfect channel information at a receiver and the presence of only transmit correlation; that is, there is sufficiently rich scattering at a receiver so that the receiver antennas would be uncorrelated. Analogous to a first-order Markovian model used in [13], time-varying and spatially transmit-correlated MIMO channels can be modelled as follows: where is the time correlation factor, denotes the correlation between transmit antennas, and stands for the Hermitian square root of a matrix. Each element of matrix is an independent and identically distributed (i.i.d.) complex Gaussian random variable with mean zero and variance per dimension. For the initial channel coefficients, , where the elements of are i.i.d. complex Gaussian random variables with mean zero and variance 0.5 per dimension. When , the spatial channel varies independently from one to another time slot. In contrast, for , the channel keeps constant over time slots. Consequently, the flat Rayleigh MIMO channel in this paper is modelled as a time-varying channel with certain correlations during time slots but independent from block to block of the length of time slots. It is noted that the channel is varying very rapidly since we assume that it varies every time slot.

#### 3. SER Performance of E-SMCs

##### 3.1. SNR of SMCs with a ZF Receiver

When a ZF receiver is used for the received signals in (4), assuming that the receiver has perfect channel information, the ZF output SNR of symbol at time slot is given by [4] where denotes the th element of a matrix, is the index of the transmit antenna that is used to transmit symbol at time slot , and denotes the Hermitian.

Considering that in order to simplify the statistical analysis, the PDF of is obtained by [4] where and .

##### 3.2. MRC Technique for ZF Output Signals

We consider a MRC technique which renders a received SNR maximum. The ZF output signals are combined linearly with the following MRC weights: Using (7) and (9), the MRC output SNR for the th symbol is then given as where , , denote the indices of the time slots assigned to transmit the th symbol and is the number of time slots used to transmit the th symbol in the E-SMC. Since the jointly statistical analysis of for may be difficult in flat Rayleigh fading channels that are changing between time slots, we assume that ’s are independent. To justify the independent assumption, we plot Figure 1 that shows the sample correlations of ZF output SNRs with respect to the time correlation factor in Rayleigh fading channels. It is observed that the sample correlations for all the cases are below 0.05 and 0.22 when and , respectively. It means that for low time correlation, the correlation of ZF output SNRs is close to zero, and hence the second equality in (11) can be approximately yielded. We can then obtain the MGF approximation of in flat Rayleigh fading channels that vary from one to another time slot. As a result, the MGF of is expressed as the following equation: where represents the expectation operation with respect to .

Without loss of generality, we assume that and there exist distinct values in such that where . Then, the MGF of can be rewritten as Using the partial fraction expansion of the MGF, it can be expressed as [14] where and denotes the set of nonnegative integers such that

##### 3.3. SER of -ary QAM for E-SMCs with ZF and MRC

Using a MGF-based approach, we write the average SER of symbol in an E-SMC with -ary QAM as in [15] where . Substituting (14) in (17) and using and in [15], we can obtain that where where Therefore, the overall average SER of E-SMCs with ZF and MRC for -ary QAM in transmit-correlated Rayleigh MIMO channels is given by

##### 3.4. SER of -ary PSK for E-SMCs with ZF and MRC

The average SER of the th symbol in an E-SMC with -ary PSK is given as in [15] where . Inserting (14) into (22) and using in [15], it can be expressed as

where Hence, for -ary PSK, the overall average SER of E-SMCs with ZF and MRC in transmit-correlated Rayleigh MIMO channels is obtained by

#### 4. Optimization of the Slot Length in E-SMCs

We assume that a symbol block to be encoded with the E-SMC consists of complex symbols each of which is from the respective different data stream that requires () as a target SER. Our goal is to find a minimum-length E-SMC that satisfies the SER requirement for each data stream. For symbol , let where denotes the set of nonnegative integers and is the SER of data stream obtained by either (18) or (23). It is noted that can be easily found since is a monotone decreasing function of . We assume, without any loss of generality, that .

##### 4.1. The Minimum Slot Length for a Single Symbol Block

When we have a single -symbol block, an optimization problem to minimize the block length with the required SER is

Conditions (a) and (c) for the proposed E-SMC in Section 2.1 are satisfied when either only one symbol or nothing is transmitted at a transmit antenna in a time slot. Constraint (28) indicates that the size of a code block should be greater than or equal to that needed to transmit symbols while achieving the required SERs, respectively. Constraint (29) implies that the block length cannot be less than the largest number among the required time slots for respective data streams, which is a necessary condition to maintain property (b) of the E-SMC.

From (28) and (29), an optimal block length is given by When is obtained, the following simple symbol allocation method (SSM) provides an E-SMC that satisfies conditions (a)–(c) in Section 2.1. Let denote the ()th element of code matrix for symbol and recall .

*Step 1. *Initialize all ’s to be zero, and let , , , and .

*Step 2. *If , then go to Step 3. Otherwise, let , , and ; if , then let , , and repeat Step 2.

*Step 3. *If , then stop the symbol allocation procedure since the code matrix is already obtained. Otherwise, let and , and go to Step 2.

Lemma 1. *The above SSM always finds that satisfies conditions (a)–(c) in Section 2.1, the column length of which is equal to .*

*Proof. *For mathematical induction, suppose that 1’s are successfully allocated, with SSM, to the ()th element in . Then, remaining 1’s can be allocated until the ()th element in is considered since
Furthermore, 1’s allocated at do not violate conditions (a)–(c) since . By (30), 1’s for symbol 1 are always allocated at the first row of , which completes the proof by mathematical induction.

For example, the following code blocks and are obtained by SSM: for , , , , , , , , and hence ; for , , , , , , , and hence :

It is noted that th and th elements of are unused, which implies that constraint (28) holds in a strict inequality. This unusage wastes the radio resource but could be avoided by allocating additional symbols. The following section addresses this issue further.

##### 4.2. Removing Unused Code Positions in the Transmission Matrix

Once the unused position in the code matrix is removed, a maximum code rate is achieved. Thus, a problem of removing the unused optimally can be formulated as where and the equality in (34) ensures that there is no void element in a code matrix, which makes the code rate maximized. It is noted that if the above problem has an optimal , then a -symbol block is transmitted with a code matrix. Moreover, if , the resulting code matrix induces additional delay compared with the code obtained in Section 4.1.

Since (34) holds in equality in order to get rid of the unused position in the transmission code matrix, Let . If , and should be the smallest nonnegative integers that satisfy . In the other case of , let where the greatest common denominator of and is 1. Then, (34) becomes , where . Let be the smallest nonnegative integer such that ; then, and .

After achieving , SSM described in the previous section also can be applied for getting the code matrices if is used instead of . For example, the previous code block is now extended to where and .

#### 5. Simulation and Analytic Results

In the simulation, we consider spatially transmit-correlated MIMO channels when , and the transmit correlation matrix is assumed as where denotes the correlation coefficient between the th and the th transmit antennas. In order to obtain the correlations between two antennas, we use the following approximation [16]: where represents the distance in wavelengths between two antennas and denotes the angular spread. Note that is defined for any distribution of power in the azimuth plain, and values close to 0.0 denote completely directional scenarios whereas those at 1.0 represent more uniform spreading of energies in space. Based on this approximation, the correlation matrix in (38) is simplified for a linear array at the transmitter with equidistant antenna spacing as the following Toeplitz structure correlation matrix [17]: From (40), the correlation matrices for uncorrelated and correlated MIMO channels considered in this section are, respectively, given by where and in the case of correlated one.

To obtain the numerical results, we test and in (3) as E-SMCs. Figures 2–5 compare the average SER performance of the two E-SMCs with ZF and MRC at a receiver. Both simulation and analytic results are plotted for Rayleigh MIMO channels. Especially, the simulated curves are obtained using time-varying channels with various time correlation factors defined in (6). In particular, Figures 2 and 3 show the average SER for QPSK in uncorrelated and correlated Rayleigh channels with and , respectively, and Figures 4 and 5 also exhibit the average SER for the same scenario used in Figures 2 and 3 except that 16-ary QAM is investigated instead of QPSK. In comparing the analytic SER curve obtained using the MGF approximation with the simulated curves, it is clear that the analytic curve is perfectly matched with the simulated one with irrespective of the modulation schemes and the spatial correlations. The gap between the simulated result for a time correlation factor of zero and that for a time correlation factor less than 0.8 does not exceed 1 dB. Hence, approximate SER expressions (18) and (23) for -ary QAM and PSK, respectively, can be used to study SER performance for E-SMCs with ZF and MRC over time-varying Rayleigh MIMO channels with rather a low correlation between time slots. Those four figures also illustrate that with provides better SER performance than with from a tradeoff between the coding rate in (2) and SER performance. In addition, SER performance becomes better as the time correlation factor decreases since the time diversity gain increases as the channels between time slots vary more independently. An increase in the correlation between transmit antennas induces the degradation of SER performance, while it does not affect the approximation gap between and as well as the simulation results with various time correlation factors.

Figures 6–8 compare the SER performances of the conventional SMC, indicated as “C-SMC” in the figures, and E-SMCs for various transmission rates, , that are defined as where the unit of is bps/Hz. In Figure 6, it is demonstrated that the E-SMC performs better than the conventional SMC at high SNR and takes lower modulation order for an equal transmission rate when the channels between time slots are independent. The SER curves for E-SMCs in Figure 6 give lower bounds since the time diversity gain is maximally achieved when . Through the comparison in Figure 6, we can see the maximum achievable gain of E-SMCs. More specifically, in Figures 7 and 8, we compare the SER performances of the conventional SMC and E-SMCs in time-varying and correlated Rayleigh MIMO channels when rates are given as bps/Hz and bps/Hz, respectively. In Figures 7 and 8, it is seen that the E-SMC offers better SER performance than the conventional SMC over high SNRs even for high time correlation factors. However, SER performance for E-SMCs becomes worse when the channel does not change over time slots (i.e., ) since the gap between modulation gains of BPSK and QPSK or QPSK and 16-ary QAM is larger than dB that is achieved by using MRC for the same two received signals. In comparison between Figures 7(a) and 7(b) as well as Figures 8(a) and 8(b), the spatial correlation between transmit antennas does not affect the performance gap between the conventional SMC and the E-SMC.

**(a)**

**(b)**

**(a)**

**(b)**

Figure 9 compares maximum encoding rates achieved by E-SMCs and vr-STBCs with successive interference cancellation (VS-SIC) [8] in time-varying and spatially uncorrelated Rayleigh fading channels when dB and QPSK is used. The maximum encoding rate to meet the required SER is obtained by using the sets of available encoding rates and for the E-SMC and the VS-SIC, respectively. In this figure, we draw a linear line between two adjacent results for the sake of illustration. In Figure 9, it is indicated that in time-varying channels with low time correlation the E-SMC can achieve time diversity, while the VS-SIC achieves no spatial diversity. Also, the VS-SIC is more sensitive to the time correlation factor than the E-SMC.

Figure 10 shows an optimal block length and its encoding rate for given target SER and in spatially uncorrelated Rayleigh MIMO channels when and QPSK is used. In Figure 10(a), we employ the SSM to find for symbol in (26) and then the optimal block lengths for various SNRs are obtained by using (30) in Section 4.1 and (36) in Section 4.2. In Figure 10(b), the encoding rates are then obtained from the optimal block lengths in Figure 10(a). Using (36) in Section 4.2 offers a higher encoding rate than using (30) in Section 4.1 but induces an increase in the block length.

**(a)**

**(b)**

#### 6. Conclusion

In this paper, we have proposed E-SMCs, which incorporate the symbol repetition over time. The E-SMC leads to a tradeoff between encoding rate and time diversity. For MIMO systems using E-SMCs, the received signals are decoded by ZF and MRC in this paper. SER equations of -ary QAM and PSK are then derived by using a MGF approximation for SNR under the independence assumption on the ZF output SNRs. With numerical investigation, simulation and analytical results are compared for time-varying and spatially correlated Rayleigh fading channels. Numerical results show that the analytical SER given by the approximation is exactly matched with the simulated one when there is no correlation of channels between time slots, and the gap between the SER performance for zero time correlation and that for low time correlation below 0.8 is less than 1 dB, regardless of the spatial correlation. The results also show that, at high SNR and low time correlation, the E-SMCs outperform the conventional SMC and the vr-STBCs in terms of SER and data rate, respectively.

#### Conflict of Interests

The author declares that there is no conflict of interests regarding the publication of this paper.

#### References

- E. G. Larsson and P. Stoica,
*Space-Time Block Coding for Wireless Communications*, Cambridge University Press, Cambridge, UK, 2003. View at: Publisher Site | MathSciNet - S. M. Alamouti, “A simple transmit diversity technique for wireless communications,”
*IEEE Journal on Selected Areas in Communications*, vol. 16, no. 8, pp. 1451–1458, 1998. View at: Publisher Site | Google Scholar - V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-time codes for high data rate wireless communication: performance criterion and code construction,”
*IEEE Transactions on Information Theory*, vol. 44, no. 2, pp. 744–765, 1998. View at: Publisher Site | Google Scholar | MathSciNet - D. A. Gore, R. W. Heath Jr., and A. J. Paulraj, “Transmit selection in spatial multiplexing systems,”
*IEEE Communications Letters*, vol. 6, no. 11, pp. 491–493, 2002. View at: Publisher Site | Google Scholar - F. Bahadori-Jahromi, M. A. Pourmina, and M. A. Masnadi-Shirazi, “Performance of cooperative spatial multiplexing SISO/MIMO communication systems with constellation rearrangement technique,”
*Arabian Journal for Science and Engineering*, vol. 39, no. 2, pp. 1067–1078, 2014. View at: Publisher Site | Google Scholar - T. Q. Duong, L. Shu, M. Chen, V. N. Q. Bao, and D. Ha, “Performance analysis of cooperative spatial multiplexing networks with AF/DF relaying and linear receiver over Rayleigh fading channels,”
*Wireless Communications and Mobile Computing*, 2013. View at: Publisher Site | Google Scholar - Y. Xiao and J. Kou, “Cooperative spatial multiplexing for CR users sharing a common channel with primary users,” in
*Proceedings of the International Conference on Electronics and Communication Systems*, Rhodes, Greece, 2013. View at: Google Scholar - I. M. Kim, “Space-time power optimization of variable-rate space-time block codes based on successive interference cancellation,”
*IEEE Transactions on Communications*, vol. 52, no. 7, pp. 1204–1213, 2004. View at: Publisher Site | Google Scholar - L. Zheng and D. N. C. Tse, “Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels,”
*IEEE Transactions on Information Theory*, vol. 49, no. 5, pp. 1073–1096, 2003. View at: Publisher Site | Google Scholar - S. Haykin and M. Moher,
*Modern Wireless Communications*, Prentice Hall, New York, NY, USA, 2004. - M. Godbout and H. Leib, “Space-time modulation and coding over transmit correlated fading channels,”
*IEEE Transactions on Wireless Communications*, vol. 3, no. 5, pp. 1405–1410, 2004. View at: Publisher Site | Google Scholar - D. Shiu, G. J. Foschini, M. J. Gans, and J. M. Kahn, “Fading correlation and its effect on the capacity of multielement antenna systems,”
*IEEE Transactions on Communications*, vol. 48, no. 3, pp. 502–513, 2000. View at: Publisher Site | Google Scholar - W. Su, Z. Safar, and K. J. R. Liu, “Towards maximum achievable diversity in space, time, and frequency: performance analysis and code design,”
*IEEE Transactions on Wireless Communications*, vol. 4, no. 4, pp. 1847–1857, 2005. View at: Publisher Site | Google Scholar - I. M. Kim, “Exact BER analysis of orthogonal STBCs in correlated Rayleigh MIMO channels,” in
*Proceedings of the IEEE International Conference on Communications (ICC '05)*, pp. 578–582, Seoul, Republic of Korea, May 2005. View at: Google Scholar - M. K. Simon and M.-S. Alouni,
*Digital Communication over Fading Channels: A Unified Approach to Performance Analysis*, John Wiley & Sons, 2000. - G. D. Durgin and T. S. Rappaport, “Effects of multipath angular spread on the spatial cross-correlation of received voltage envelopes,” in
*Proceedings of the IEEE VTS 50th Vehicular Technology Conference (VTC '99)*, pp. 996–1000, September 1999. View at: Google Scholar - B. Allen, R. Brito, M. Dohler, and H. Aghvami, “Performance comparison of spatial diversity array topologies in an OFDM based wireless LAN,”
*IEEE Transactions on Consumer Electronics*, vol. 50, no. 2, pp. 420–428, 2004. View at: Publisher Site | Google Scholar

#### Copyright

Copyright © 2014 In-Ho Lee. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.