- Research Article
- Open Access
Performance-Driven Symbol Mapping for Downlink and Point-to-Point MIMO Systems
© C. Masouros and E. Alsusa. 2011
- Received: 25 October 2010
- Accepted: 18 February 2011
- Published: 13 March 2011
An adaptive symbol mapping scheme is proposed for single-user point-to-point and multiuser downlink multiple-input multiple output (MIMO) systems aiming at the minimization of the overall system bit error rate. The proposed scheme introduces a disorder to the symbols to be transmitted within a MIMO subframe by means of dynamic mapping, with the objective to optimise the interference between them and enhance the received symbols' power. This is done by either changing the allocation order of the symbols to the antennas or by applying a scrambling process that alters the symbols sign. This procedure is targeted to optimizing, rather than strictly minimizing the interference between the symbols such that constructive instantaneous interference is utilized in enhancing the decision variables at the receiver on a symbol-by-symbol basis so that detection is made more reliable. In this way, the overall system performance is improved without the need to raise the transmitted power. The proposed scheme can be used in conjunction with various conventional MIMO precoding and detection techniques. The presented results show that for a given transmit power budget this scheme provides significant benefits to the corresponding conventional system's error rate performance.
- Channel State Information
- Minimum Mean Square Error
- MIMO System
- Antenna Selection
- Symbol Error Rate
The recent advances in multiple-input multiple-output (MIMO) processing  are making the application of multiantenna transmitters and receivers increasingly popular in modern wireless communications due to the enhanced capacity and space diversity they offer. MIMO schemes have recently been incorporated in communication standards such as WiMAX and 3GPP-LTE to satisfy the growing demand for higher data rates and quality of service for multimedia applications. Despite the increased information capacity offered by the MIMO channel, the spatial correlation of the multiple subchannels introduces an additional source of interference which corrupts the data symbols and in effect degrades the achievable error rate performance of such systems. In the MIMO uplink, space diversity detection techniques [2–5] can counteract this impediment to a satisfactory extent. In [2, 3], the sphere decoder is presented for an arbitrary lattice code and a lattice code resulting from applying algebraic space-time coding on a MIMO system, respectively. Regardless of the technique's near-optimal performance, the decoding complexity is quite significant, which makes it impractical for use in mobile units at downlink and point-to-point reception. Suboptimal solutions with reduced complexity are introduced in [4, 5] where diagonal- and vertical-layered architectures of the (Bell Laboratories Layered Space Time) BLAST receiver are presented, respectively. While complexity is drastically reduced the performance of these techniques is comparable to the sphere decoder in most practical scenarios. An alternative to MIMO detection is to shift the signal enhancement processing to the transmitter by use of precoding. This is particularly popular in MIMO downlink communications and point-to-point systems, which is the focus of this work. Channel inversion (CI)  entails the least complexity of the precoding techniques available. However, the disadvantages of the CI technique include a poor symbol error rate (SER) performance and the fact that the transmission rate and throughput delivered are limited and do not improve by increasing the number of antennas, as demonstrated in . The solution proposed in , which is a minimum mean square error (MMSE) form of channel inversion, provides some performance and capacity gains with respect to the conventional CI, without a considerable complexity increase. Nevertheless, the transmission rates offered by both these schemes are far from reaching the theoretical channel capacity. Dirty paper coding (DPC) techniques as, for example, in [8–11] based on the initial information theoretical analysis in , can further increase transmission rates and achieve significant capacity benefits. However, the majority of the DPC methods developed so far are impractical in many scenarios as they require sophisticated signal processing at the transmitter with complexity similar to the one of sphere decoding. A promising alternative is the joint transmit-receive beamforming scheme as presented in  amongst others in the literature. Despite being less complex than DPC, the most robust beamforming schemes require iterative communication between the transmitter and receiver for the optimization of the joint processing and the system configuration. This needs to be done every time the channel characteristics change and hence, in fast fading environments introduces considerable latency to the MIMO downlink system. Owing to their favourable performance-to-complexity tradeoff amongst the techniques mentioned above, this paper focuses on the application of the proposed scheme to the more practical V-BLAST detection and MMSE precoding.
Complementary to the aforementioned signal enhancement processing MIMO schemes, a number of resource allocation schemes [14–19] have emerged for MIMO communications mainly involving antenna selection [14–16] and power allocation [17, 18] for multielement transceivers as well as frequency (subcarrier) allocation  for MIMO-orthogonal frequency division multiplexing (OFDM) communications. All the relevant resource allocation methods focus on the reduction of interference between the spatial streams of the MIMO channel. This clearly differentiates them to the proposed scheme where the aim is not strictly to minimise the correlation of the spatial streams but rather to optimise it and accommodate for constructive interchannel interference (ICI). Moreover, resource allocation schemes such as antenna selection can be used in addition to the proposed technique to further improve the performance. The focus of this paper, however, is on signal enhancement schemes and for reasons of coherence, antenna selection and power allocation are not considered here.
In more detail, the proposed scheme which parallels the ones in [20, 21] proposed for code division multiple access (CDMA) is based on the fact that ICI is separated into constructive and destructive as discussed in detail in . The characterisation of the instantaneous ICI depends on the channel characteristics and the correlation between the spatial streams, and, equally importantly, on the instantaneous values of the transmitted symbols. By perturbing the data symbols to be transmitted by means of reordering or scrambling, the proposed scheme influences the ICI between the MIMO subchannels. It then chooses a symbol mapping such that the interference is optimised and the decision variables at the receiver are maximised. Subsequently, conventional precoding or detection can be applied with enhanced performance due to the optimisation of interference achieved by the proposed symbol mapping.
It is clear that the proposed symbol mapping scheme can be combined with various conventional MIMO detection (linear detection, V-BLAST, sphere decoding, etc.) and precoding schemes (linear precoding, dirty paper coding etc.) to improve the respective performance. For reasons of simplicity and to maintain the focus of the present paper, as mentioned above, only two of the most practical and popular MIMO techniques are considered here, MMSE precoding and V-BLAST detection.
It should be noted that the proposed data allocation method entails the transmission of control signalling (CS) to inform the receiver about the mapping process used so as to attain the correct initial order or appropriately descramble the received data after detection. It will be shown that the CS increases logarithmically with the number of candidate mapping patterns and for this reason the number of possible reordered or scrambled versions of the data to select from should be limited. In the simulations presented here this number is limited to values such that the overhead imposed by the CS transmission is restricted to less than 6% of the transmitted information.
Here and is the matrix that contains the complex frequency flat channel coefficients with the element being the zero-mean unit-variance channel tap between the transmit antenna and the receive antenna. Also, is the vector with the symbols transmitted by the antennas and is the vector of the additive white Gaussian noise (AWGN) components at the antennas. For reasons of completeness and to introduce the notation used in this paper, the following briefly presents the conventional MMSE precoding and V-BLAST detection schemes. A modification to the conventional V-BLAST is also introduced to make it more compatible with the proposed method.
2.1. Linear Minimum Mean Square Error (MMSE) Precoding
where represents the quantization operation. It is shown in  that the value of that maximizes the received SINR is , where is the noise variance at the receiver. It is demonstrated that this precoding outperforms full channel inversion in symmetric MIMO systems where such as the ones investigated here.
2.2. Vertical Bell Laboratories Layered Space Time (V-BLAST) Detector and Proposed Modification
The V-BLAST detector proposed in  involves iterative detection and cancellation of the interfering symbols at each antenna in order to attain an interference-free detection of the desired signal. No precoding is applied at the transmitter and hence as the cancellation process is applied on the received signal of (1). The function of the scheme is well explained in  and for reasons of completeness we present the compact recursive procedure of the technique:
Here denotes the column if is a matrix or the element if is a vector, denotes the transpose of , denotes the index of the selected symbol to be detected and cancelled at the recursion and is the estimated symbol. In (7e), the estimated interference from symbol is regenerated using channel state information (CSI) and canceled out from the received signal. In (7f) the rows to are zeroed in the channel matrix to provide on which the new equalization matrix is based. It is important to stress that in the recursive detection-reconstruction-cancellation part, the symbol to be cancelled is selected as the one that corresponds to the row in with the minimum norm. This is done so that the increase in noise power due to multiplication with at each recursion is minimized. However, for the pairing of V-BLAST with the proposed scheme the simulations showed that a criterion based on the one proposed for successive interference cancellation (SIC) in code division multiple access (CDMA) systems in  is more appropriate. Therefore in the simulations shown below the received signal is multiplied with the entire equalization matrix at each recursion and the symbol with the highest norm (most reliable for detection) is selected for cancellation at each iteration of the algorithm. Hence, while the conventional V-BLAST is simulated in the graphs below using the procedure in (7a)–(7f) for the combined V-BLAST and symbol mapping the BLAST algorithm is modified to:
where is the crosscorrelation of the remaining symbols at the cancellation iteration, and is the noise component after channel equalization. It can be proven that the noise component has on average increased power compared to after multiplication with the nonunitary channel equalization matrix.
In both (4) and (9) it can be seen that when the transmitted data symbols are reordered they are paired with different crosscorrelation elements in the crosscorrelation matrix and the interference between them changes so that the values of the resulting decision variables are different. Hence, instead of transmitting the symbols as they appear at the output of the information source, it would be beneficial to the communication system to reorder the symbols in a way that the decision variables resulting from (4) and (9) are enhanced. This serves as the motivation behind the proposed SA scheme, the flow diagram of which is illustrated in Figure 1. The proposed algorithm involves the following steps.
From an initial reference symbol-to-antenna allocation pattern a limited number of candidate allocation patterns are formed offline, known both to the transmitter and receiver. The value of should be limited, so that the CS bits (needed to convey which of the candidates was used to the receiver) do not impose an overwhelming transmission overhead.
For each candidate the expected decision variables are preestimated according to the signal enhancement mechanism employed (precoding or detection). For the MMSE and V-BLAST techniques considered here the preestimated symbols are given by (6) and (8d), respectively using the channel estimates. The vectors containing the decision variables for each candidate allocation are stacked to form the matrix . The column of the matrix, denoted as for simplicity, contains the preestimated decision variables for the candidate symbol allocation with .
A symbol allocation is selected based on an error rate minimization criterion that will be shown in the following.
The transmitter subsequently allocates the symbols to the antennas based on the selected allocation and, if applicable, precodes the data using some form of conventional precoding.
Additional to the data symbols the transmitter sends the CS bits that inform the receiver which of the candidate allocation patterns was used.
The receiver applies the conventional signal enhancement processing which can be V-BLAST (assumed in this paper) or any other conventional detection scheme to acquire the enhanced decision variables.
The CS is detected to determine the allocation used at the transmitter.
Using the knowledge of all possible allocation patterns, the receiver then removes the perturbation introduced at the transmitter by inverting the process of to retrieve the original data.
For reasons of clarity the separation between the notations and in the above analysis should be emphasized, as the former represents the preestimated values of the data at the transmitter using CSI and ignoring noise while the latter denotes the actual estimated data at the receiver.
It is evident that for each allocation pattern used, a number of control signaling bits need to be transmitted additionally to the information symbols to notify the receiver which of the candidate allocations was selected. Therefore if the proposed SA was applied at individual symbol periods, in realistic MIMO scenarios with limited number of antennas the need to map the symbols at each symbol period would yield a significant amount of CS. To limit the signaling overhead to practical levels, rather than applying the proposed SA on a symbol-by-symbol basis, symbols of multiple transmission time slots and spatial layers are grouped to form MIMO subframes, similar to the ones used in the LTE standard. By applying SA on these subframes and increasing the number of data information symbols per allocation the relative CS overhead is dramatically reduced.
As regards the mapping mechanism used to create the candidate allocations and introduce the diversity in the resulting interference to optimize the decision variables, this paper proposes two distinct methods which are analyzed below.
3.1. Mapping Method 1: Symbol Reordering
3.2. Mapping Method 2: Symbol Scrambling
different possible scrambled versions. It will be shown however that the performance of the proposed scheme depends on the number of actual candidate perturbed versions of the frame rather than the theoretical achievable diversity. Therefore for a practical number of candidate allocations the performances of the two mechanisms are identical as shown in the simulations that follow. The advantage of the scrambling method however lies in the fact that since the symbols arrive at the receive antennas at the initial time slots and spatial streams there is no need for the antennas to cooperate for retrieving the actual order of the transmitted data. This makes the proposed scheme also applicable to multiuser MIMO downlink transmission.
4.1. Selection Criterion
To verify the superiority of the proposed criterion over the conventional approach, the two criteria (14) and (15) are compared in the results that follow. It should be noted that since the search for the best candidate is not exhaustive amongst all possible perturbed symbol allocations but rather between possibilities—to limit the CS-the selected candidate may be suboptimum. It is shown in the simulations however that even for this suboptimal selection a significant performance improvement can be gleaned.
4.2. Selection Implementation
As regards the selection of , the obvious method for this is to calculate in (15) for each symbol period. An alternative would be to calculate for all symbol combinations for a given channel impulse response and store the values of in a memory, possibly in the for of a lookup table (LUT). For each symbol period the transmitter would then select the appropriate value of from the LUT according to the symbol combination encountered. For QPSK modulation and assumed in the following results the number of possible symbol combinations would be . However, for PSK modulation the interference encountered depends only on the relative phases of the data symbols and not their amplitudes which are common for all constellation points. Hence different data symbol combinations that share the same relative phases such as and would yield the same value of . Clearly there exist relative phase combinations arising from each of the QPSK constellation points. Hence, a total number of entries need to be calculated and stored in the LUT. This LUT-based implementation of the allocation selection is particularly preferable in slow fading cases where the channel coefficients remain unchanged for large numbers of symbol periods and large framelengths can be used.
5.1. CS Transmission
5.2. CS Transmission-Reception Efficiency
Likewise, at the receiver a number of CS symbols need to be detected for every received data symbols which gives an equal reception efficiency. In the majority of the following simulations a data subframe of symbol periods over spatial streams is assumed and a number of candidate allocations is used. As QPSK modulation is employed for both data and CS this derives a practical transmission and reception efficiency of %. At this point is should be mentioned that a 5.4% efficiency reduction, while nontrivial, is worthwhile due to the significant performance improvement attained by the proposed scheme. Indeed, it is not uncommon to sacrifice a degree of transmission efficiency to secure performance benefits and a profound example of this is forward error correction (FEC) coding. While it imposes major transmission overheads such as 33% for codes of rate , 100% for rate and so on, it greatly improves communications system performance. This is why FEC is adopted in most modern communication standards and its importance is widely acknowledged. Furthermore, the transmission efficiency of the proposed scheme in (17) can be improved by increasing and employing higher-order modulation such as 16-quardature amplitude modulation (QAM) or 64QAM. This is further illustrated in Figure 7 (and the relevant discussion in the following) which plots the transmission efficiency with increasing for the parameters mentioned above and for various modulation schemes used for the CS transmission.
Complexity in numbers of operations for MMSE and MMSE-SA.
No. of operations
No. of operations
calculate scaling factor
calculate scaling factor
In (24) is the amplitude of flat fading, is the energy per bit, is the noise power spectral density and denotes the expected value of . The probability of symbol error for QPSK modulation used in the simulations below can then be simply calculated using (22) and (23) for . It can be observed that as the signal to noise ratio (SNR) increases and the CS detection becomes more reliable tends to zero for which case (21) yields . The value for the proposed SA scheme is dependent on which of the investigated conventional techniques are used and how SA enhances performance. It is obvious that for nonzero , but the following simulations show that with the proposed SA the data detection error probability is severely reduced compared to the corresponding conventional techniques. Hence for SA is still significantly less than the error probability of the conventional methods. The exact error probability cannot be calculated in closed form due to the fluctuations in the symbol allocation and the instantaneous crosscorrelation values between the symbols. Therefore, an exact expression of the final error probability for imperfect CS detection cannot be derived. Simulation results are provided in the following section for the proof of the proposed method's superiority.
This section presents the results of Monte Carlo simulations carried out for conventional MIMO precoding and detection schemes with and without the proposed SA for various numbers of antennas on frequency flat fading MIMO channels in order to illustrate the relevant performance comparison. While it is intuitive that the benefits of the proposed scheme extend to a variety of MIMO techniques, the simulations below focus on MMSE precoding and V-BLAST detection, as these schemes offer a practical performance-to-complexity tradeoff. For the simulations shown QPSK modulation has been employed and unless stated otherwise perfect channel estimates are assumed. For the transmission of CS an increased transmission power by a factor of two compared to the data transmission is assumed, which is a common method in practical systems to achieve reliable CS and eliminate the effect on data detection. To avoid confusion it should be clarified that to ease comparison to the results of [5, 9] the total transmitted SNR is used in the graphs for MMSE precoding while the values of transmitted SNR per receive antenna are used in the graphs for V-BLAST detection.
8.1. Reference Achievable Performance Gain
8.2. Selection of Optimum and Resulting Transmission-Reception Efficiency
8.3. Further Performance Investigation
The use of static data-to-antenna allocation leads to waste of useful energy inherent in the communication channel and makes conventional MIMO schemes suboptimal. By applying adaptive mapping on the data to be transmitted and introducing diversity in the interference between the transmitted symbols of the MIMO channel this work has shown that significant performance benefits are gleaned for MIMO systems. The tradeoff to this improvement is the need for control signaling for the correct data detection. Further work can be carried out towards reducing the CS overhead and applying the proposed scheme to further and more advanced MIMO techniques including resource allocation.
This work has been jointly funded by EPSRC and Philips Research Labs, UK. The authors would like to thank Dr. Tim Moulsley for the helpful discussions throughout this research contribution.
- Caire G, Shamai S: On the achievable throughput of a multiantenna Gaussian broadcast channel. IEEE Transactions on Information Theory 2003, 49(7):1691-1706. 10.1109/TIT.2003.813523MATHMathSciNetView ArticleGoogle Scholar
- Viterbo E, Boutros J: A universal lattice code decoder for fading channels. IEEE Transactions on Information Theory 1999, 45(5):1639-1642. 10.1109/18.771234MATHMathSciNetView ArticleGoogle Scholar
- Damen O, Chkeif A, Belfiore JC: Lattice code decoder for space-time codes. IEEE Communications Letters 2000, 4(5):161-163. 10.1109/4234.846498View ArticleGoogle Scholar
- Foschini GJ: Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas. Bell Labs Technical Journal 1996, 1(2):41-59.View ArticleGoogle Scholar
- Wolniansky PW, Foschini GJ, Golden GD, Valenzuela RA: V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel. Proceedings of the URSI International Symposium on Signals, Systems, and Electronics (ISSSE '98), October 1998 295-300.Google Scholar
- Haustein T, von Helmolt C, Jorswieck E, Jungnickel V, Pohl V: Performance of MIMO systems with channel inversion. Proceedings of the 55th Vehicular Technology Conference (VTC '02), May 2002, Birmingham, Ala, USA 35-39.Google Scholar
- Peel CB, Hochwald BM, Swindlehurst AL: A vector-perturbation technique for near-capacity multiantenna multiuser communication—part I: channel inversion and regularization. IEEE Transactions on Communications 2005, 53(1):195-202. 10.1109/TCOMM.2004.840638View ArticleGoogle Scholar
- Tomlinson M: New automatic equaliser employing modulo arithmetic. Electronics Letters 1971, 7(5-6):138-139. 10.1049/el:19710089View ArticleGoogle Scholar
- Harashima H, Miyakawa H: Matched-transmission technique for channels with intersymbol interference. IEEE Transactions on Communications 1972, 20(4):774-780. 10.1109/TCOM.1972.1091221View ArticleGoogle Scholar
- Erez U, Shamai S, Zamir R: Capacity and lattice strategies for canceling known interference. IEEE Transactions on Information Theory 2005, 51(11):3820-3833. 10.1109/TIT.2005.856935MATHMathSciNetView ArticleGoogle Scholar
- El Gamal H, Caire G, Damen MO: Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels. IEEE Transactions on Information Theory 2004, 50(6):968-985. 10.1109/TIT.2004.828067MATHMathSciNetView ArticleGoogle Scholar
- Costa MHM: Writing on dirty paper. IEEE Transactions on Information Theory 1983, 29(3):439-441. 10.1109/TIT.1983.1056659MATHView ArticleGoogle Scholar
- Rashid F, Liu KJR, Tassiulas L: Transmit beamforming and power control for cellular wireless systems. IEEE Journal on Selected Areas in Communications 1998, 16(8):1437-1449. 10.1109/49.730452View ArticleGoogle Scholar
- Heath RW, Sandhu S, Paulraj A: Antenna selection for spatial multiplexing systems with linear receivers. IEEE Communications Letters 2001, 5(4):142-144. 10.1109/4234.917094View ArticleGoogle Scholar
- Gharavi-Alkhansari M, Gershman AB: Fast antenna subset selection in MIMO systems. IEEE Transactions on Signal Processing 2004, 52(2):339-347. 10.1109/TSP.2003.821099MathSciNetView ArticleGoogle Scholar
- Sanayei S, Nosratinia A: Antenna selection in MIMO systems. IEEE Communications Magazine 2004, 42(10):68-73. 10.1109/MCOM.2004.1341263View ArticleGoogle Scholar
- Yu W, Rhee W, Boyd S, Cioffi JM: Iterative water-filling for Gaussian vector multiple-access channels. IEEE Transactions on Information Theory 2004, 50(1):145-152. 10.1109/TIT.2003.821988MATHMathSciNetView ArticleGoogle Scholar
- Yu W, Rhee W, Cioffi JM: Optimal power control in multiple access fading channels with multiple antennas. Proceedings of the International Conference on Communications (ICC '01), June 2001 575-579.Google Scholar
- Pan YH, Letaief KB, Cao Z: Dynamic spatial subchannel allocation with adaptive beamforming for MIMO/OFDM systems. IEEE Transactions on Wireless Communications 2004, 3(6):2097-2107. 10.1109/TWC.2004.841542View ArticleGoogle Scholar
- Masouros C, Alsusa E: Two-stage transmitter precoding based on data-driven code-hopping and partial zero forcing beamforming for MC-CDMA communications. IEEE Transactions on Wireless Communications 2009, 8(7):3634-3645.View ArticleGoogle Scholar
- Masouros C, Alsusa E: Interference exploitation using adaptive code allocation for the downlink of precoded multiple carrier code division multiple access systems. IET Communications 2008, 2(9):1118-1130. 10.1049/iet-com:20070628View ArticleGoogle Scholar
- Masouros C, Alsusa E: Dynamic linear precoding for the exploitation of known interference in MIMO broadcast systems. IEEE Transactions on Wireless Communications 2009, 8(3):1396-1404.View ArticleGoogle Scholar
- Patel P, Holtzman J: Analysis of a simple successive interference cancellation scheme in a DS/CDMA system. IEEE Journal on Selected Areas in Communications 1994, 12(5):796-807. 10.1109/49.298053View ArticleGoogle Scholar
- Proakis JG: Digital Communications, Electrical Engineering. 3rd edition. McGraw-Hill, New York, NY, USA; 1995.Google Scholar
This article is published under license to BioMed Central Ltd. 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.