- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Journal of Electrical and Computer Engineering
Volume 2010 (2010), Article ID 324138, 5 pages
High-Rate Redundant Space-Time Coding
1Ericsson AB, 164 80 Stockholm, Sweden
2Communication Systems, Royal Institute of Technology (KTH), 164 40 Stockholm, Sweden
Received 26 September 2009; Accepted 27 December 2009
Academic Editor: Adnan Kavak
Copyright © 2010 Jawad Manssour et al. 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.
We present a new space-time encoder based on packet-level redundancy which can increase the space-time encoder rate beyond unity without compromising diversity gains. A complementary low-complexity decoding algorithm based on maximum ratio combining and successive interference cancelation is further proposed. A major merit of the decoding algorithm is that it allows to adaptively tradeoff between diversity and multiplexing gains based on the estimated channel parameters at the receiver without requiring any channel state information at the transmitter. System level simulation results give insight into the advantages of the proposed scheme when compared to its Alamouti and MIMO multiplexing based on single value decomposition counterparts.
The usage of multiple antennas has proven to be a good remedy to the unreliability of the wireless channel as it offers significant diversity and/or multiplexing gains relative to single antenna systems. In particular, space-time coding (STC) [1, 2] has attracted a significant amount of research due to its potential to improve the transmission's reliability. A general trend in current space-time code design is that different symbols are transmitted independently of each other. However, by performing some linear combining on the packets present at the input of the space-time encoder, the number of packets to be transmitted is effectively decreased, thereby increasing the rate of the encoder while ultimately preserving the desired redundancy.
In this work, we present a new way of generating space-time codes which is based on combining two (or more) data symbols into one, in a way similar to network coding . However, in the proposed method, the coding takes place at the transmitting node instead of at an intermediate node. Such a design can be exploited in order to generate high-rate and redundant space time codes. An example of such space-time codes is presented and a complementing low-complexity decoding algorithm based on successive interference cancelation (SIC) and maximum ratio combining (MRC) is proposed. The decoding algorithm can exploit the redundancy introduced in order to adaptively tradeoff between diversity and multiplexing gains for the different streams without requiring any channel state information (CSI) at the transmitter. A proof of concept is presented through system level simulation results.
The rest of this paper is organized as follows. Section 2 introduces the proposed STC and explains the corresponding decoding algorithm. Section 3 contains the SINR and sum-capacity derivations. In Section 4, the simulation environment is explained. The system-level simulation results are presented in Section 5. Lastly, conclusions are given in Section 6.
2. Redundant and High-Rate Coding
We propose a space time block encoder where at least one of the transmit instances uses a finite field encoding operation between at least two data elements. For instance, a bit wise modulo-2 operation may be applied to the bits of different data streams. As the bits from two (or more) streams are combined together into one resultant stream, the space-time encoder rate can be considerably increased without compromising the desired redundancy. The resultant data streams are then mapped to the physical transmitting antennas.
2.1. System Model
In this work, we limit our study to the case of a MIMO system; however, the generalization to an MIMO system is analogous. The channel matrix is given by where refers to the channel between transmitting antenna and receiving antenna .
At the output of the encoder, the following coded matrix is assumed: where is the codeword length of the space time encoder and the rows of represent the transmitting antenna. The coded matrix contains the bitwise manipulated bits using the proposed method prior to antenna mapping and modulation. The choice of depends on the desired spatial multiplexing and/or diversity gains based on the operating channel conditions. However, due to space restrictions, we only present one example of the proposed space-time codes in the following.
2.2. An Example of the Proposed Space-Time Codes
A Alamouti scheme can provide a diversity order up to , albeit with a rate equal to . However, it would be desirable to be able to exchange some of this diversity gain into multiplexing gains under certain channel conditions. This aim can be achieved by using the following coded transmission matrix: where , and . Note that has been introduced to simplify the notation and that the operation represents a modulo-2 addition on the binary bits of the symbols and . With the modulo-2 addition operating on binary bits of the symbols, any type of modulation can be used on the transmitted codewords (e.g., based on channel conditions). It can be seen that the codewords consist of two time slots where three different symbols are transmitted thus providing a transmission rate of . The main advantage of the proposed scheme is that each of the three symbols has been transmitted twice, each on the two different antennas, a fact that will be exploited by the decoding algorithm to achieve the desired diversity-multiplexing tradeoff.
3. SINR and Sum-Capacity Derivation
In the following we will derive the signal-to-interference-and-noise-ratio (SINR) equations based on MRC and SIC at the receiver.(Alternatively, Minimum Mean Square Error (MMSE) or Maximum Likelihood (ML) decoding may as well be used.) The transmission protocol consists of two transmission slots, and , during which the channel remains constant. Both antennas transmit with equal power .
3.1. Predecoding SINR
The predecoding SINR is the SINR computed based on the signals received after transmissions during the times and , prior to symbol decoding and combining. The received signals at the first and second antennas are given by (in the algorithm flowchart in Figure 1, is represented as ) where is the channel matrix defined in (1), is the received signal at the th receive antenna for the transmission phase , is the coded matrix in (3), and is the instantaneous noise and interference given by where is the noise and interference at the th receive antenna for the transmission phase .
The baseband received symbol at the th receive antenna for transmission phase is given by where and are the transmitted symbols during from antennas and , respectively.
Depending on the received signal strength, we can distinguish between two cases.
3.1.1. Case 1
In the first case, the received power from the first transmit antenna is stronger than the received power from the second transmit antenna. In that case (resp., ) is detected first during (resp., ) by combining through, for example, MRC the streams from the two receive antennas and treating (resp., ) as interference, then followed by detecting (resp., ) after performing SIC of the already decoded (resp., ). The predecoding SINRs are then given by where is the average interference plus noise power at the th receive antenna which is assumed constant over the two time slots.
3.1.2. Case 2
In the second case, the received power from the second transmit antenna is stronger than the received power from the first transmit antenna. Here and are first detected in their respective time slots, followed by and . Similarly to Case , assuming that and are correctly decoded, the predecoding SINRs can be obtained as
3.2. Postdecoding SINR
Following the SINR evaluation of the transmitted coded symbols (i.e., predecoding SINR), the modulated symbols will be estimated by the space-time decoder. Figure 1 shows a flowchart of the decoding algorithm. Once the symbols , , , and have been detected, the decoding will be done depending on the predecoding SINR values of those symbols, resulting in the postdecoding SINRs that would directly determine the resulting capacity.
We distinguish between two main decoding scenarios that offer different diversity-multiplexing tradeoffs.
3.2.1. Scenario 1
In the first scenario, the direct links are the strongest and both and are decoded based on their direct transmissions. Consequently we use and to obtain . (This is simply achieved by first decoding with (i.e., ) and obtaining the first estimate of . The second estimate of is obtained by decoding with . The two estimates of are then combined together to obtain the final decision.) In this scenario, the equivalent (i.e., postdecoding) SINRs, decoded , for the different symbols will then be given as follows:
3.2.2. Scenario 2
In the second scenario, one of the symbols and (the one with the higher predecoding SINR) is decoded based on its direct transmission. Consequently we use the relevant redundant symbol (i.e., or ) to obtain the other (with the lower predecoding SINR), and then use the other redundant to obtain . The two possible cases are as follows.
Case 1 (). In this case, the symbol is decoded directly, the redundant symbol is used to increase the diversity gain of the symbol , and the redundant symbol is used to obtain a multiplexing gain by decoding . The equivalent postdecoding SINRs of the different transmitted symbols will then be given by
Case 2 (). In this case, the symbol is decoded directly, the redundant symbol is used to increase the diversity gain of the symbol , and the redundant symbol is used to obtain multiplexing gain by decoding .
The equivalent SINRs of the different transmitted symbols will then be given by
3.3. Capacity Calculation
Using the postdecoding SINRs derived in the previous subsection, the sum-capacity for all the different scenarios can be written as follows: where the postdecoding SINRs depend on the chosen decoding scenario. A main merit of the proposed scheme is that the diversity-multiplexing gains for the different transmitted streams can be adaptively controlled at the receiver based on the estimated channel coefficients in conjunction with per-stream desired performance measures by simply choosing the desirable, yet feasible decoding scenario (i.e., if the channel coefficients permit), consequently not requiring any CSI at the transmitter. Furthermore, it makes it possible to employ low-complexity decoding.
4. Simulation Environment
A network deployment with seven cells is considered in order to measure the performance in the presence of inter-cell interference. Each cell has a radius of m, and a reuse factor of is assumed. All transmitting and receiving nodes are assumed to have two uncorrelated antennas each. The C2 metropolitan area pathloss and channel model from  are used in the evaluations. Non-line-of-sight propagation is assumed between the BS antennas and the transmitters. Shadow fading is log-normally distributed with a standard deviation of dB. The capacity evaluation is based on the Shannon model.
As the main goal of this work is to evaluate the capacity performance of the proposed scheme, we opt to use system-level simulation. The evaluation of the error performance, hence the usage of link-level simulation, is left as a future work. However, the SINR results that were included should give a hint about the robustness of each simulated scheme.
5. System-Level Performance Results
The proposed scheme is evaluated and compared to the Alamouti scheme with MRC combining at the receiver and the channel capacity based on single value decomposition (SVD). The cumulative distribution function (CDF) of the sum-capacity is shown in Figure 2. The average normalized sum-capacity of the Alamouti scheme is [b/s/Hz], whereas that of the SVD method is [b/s/Hz], and the proposed scheme is [b/s/Hz]. Furthermore, the CDF of the SINR performance is shown in Figure 3 where different streams of a same method have a similar performance during and due to the block fading assumption. Although the SVD method achieves the highest sum-capacity, it has two major drawbacks: it requires full CSI at both the transmitter and the receiver, and half of the transmitted streams will have a very low performance (which might not yield any gains in a practical setup). On the other hand, the proposed method is able to exchange one of the transmitted streams into a better diversity performance so that the diversity-multiplexing behavior can be controlled by the receiver as opposed to the Alamouti scheme that provides a better diversity performance in general at the expense of a lower rate. Another main merit of the proposed scheme over the Alamouti method is that whereas the latter fails in case of non block fading, this setup would provide more diversity gains to the former.
In this work, we suggested the imitation of simple linear network coding at transmitters possessing multiple antennas, and we showed how this could be exploited in order to design redundant high-rate space-time codes. We proposed a complementary low-complexity decoding algorithm based on successive interference cancelation that can adaptively tradeoff between diversity and multiplexing gains without requiring any channel state information at the transmitting side. System level simulation results were presented as a proof of concept and to gain insight into the advantages of the proposed scheme.
- 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.
- 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.
- R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204–1216, 2000.
- E. J. Meinilä, “Final report on link level and system level channel models,” Tech. Rep. IST-2003-507581 WINNER I, D5.4 v. 1.4, 2005, http://projects.celtic-initiative.org/winner+.