Distributed space-time coding for two-way wireless relay networks

In this paper, we consider distributed space-time coding for two-way wireless relay networks, where communication between two terminals is assisted by relay nodes. Relaying protocols using two, three, and four time slots are proposed. The protocols using four time slots are the traditional amplify-and-forward (AF) and decode-and-forward (DF) protocols, which do not consider the property of the two-way traffic. A new class of relaying protocols, termed as partial decode-and-forward (PDF), is developed for the two time slots transmission, where each relay first removes part of the noise before sending the signal to the two terminals. Protocols using three time slots are proposed to compensate the fact that the two time slots protocols cannot make use of direct transmission between the two terminals. For all protocols, after processing their received signals, the relays encode the resulting signals using a distributed linear dispersion (LD) code. The proposed AF protocols are shown to achieve the diversity order of min{N,K}(1- (log log P/log P)), where N is the number of relays, P is the total power of the network, and K is the number of symbols transmitted during each time slot. When random unitary matrix is used for LD code, the proposed PDF protocols resemble random linear network coding, where the former operates on the unitary group and the latter works on the finite field. Moreover, PDF achieves the diversity order of min{N,K} but the conventional DF can only achieve the diversity order of 1. Finally, we find that two time slots protocols also have advantages over four-time-slot protocols in media access control (MAC) layer

Detect-and-forward relaying aided cooperative spatial modulation for wireless networks

A novel detect-and-forward (DeF) relaying aided cooperative SM scheme is proposed, which is capable of striking a flexible tradeoff in terms of the achievable bit error ratio (BER), complexity and unequal error protection (UEP). More specifically, SM is invoked at the source node (SN) and the information bit stream is divided into two different sets: the antenna index-bits (AI-bits) as well as the amplitude and phase modulation-bits (APM-bits). By exploiting the different importance of the AI-bits and the APM-bits in SM detection, we propose three low-complexity, yet powerful relay protocols, namely the partial, the hybrid and the hierarchical modulation (HM) based DeF relaying schemes. These schemes determine the most appropriate number of bits to be re-modulated by carefully considering their potential benefits and then assigning a specific modulation scheme for relaying the message. As a further benefit, the employment of multiple radio frequency (RF) chains and the requirement of tight inter-relay synchronization (IRS) can be avoided. Moreover, by exploiting the benefits of our low-complexity relaying protocols and our inter-element interference (IEI) model, a low-complexity maximum-likelihood (ML) detector is proposed for jointly detecting the signal received both via the source-destination (SD) and relay-destination (RD) links. Additionally, an upper bound of the BER is derived for our DeF-SM scheme. Our numerical results show that the bound is asymptotically tight in the high-SNR region and the proposed schemes provide beneficial system performance improvements compared to the conventional MIMO schemes in an identical cooperative scenario.<br/

Design guidelines for spatial modulation

A new class of low-complexity, yet energyefficient Multiple-Input Multiple-Output (MIMO) transmission techniques, namely the family of Spatial Modulation (SM) aided MIMOs (SM-MIMO) has emerged. These systems are capable of exploiting the spatial dimensions (i.e. the antenna indices) as an additional dimension invoked for transmitting information, apart from the traditional Amplitude and Phase Modulation (APM). SM is capable of efficiently operating in diverse MIMO configurations in the context of future communication systems. It constitutes a promising transmission candidate for large-scale MIMO design and for the indoor optical wireless communication whilst relying on a single-Radio Frequency (RF) chain. Moreover, SM may also be viewed as an entirely new hybrid modulation scheme, which is still in its infancy. This paper aims for providing a general survey of the SM design framework as well as of its intrinsic limits. In particular, we focus our attention on the associated transceiver design, on spatial constellation optimization, on link adaptation techniques, on distributed/ cooperative protocol design issues, and on their meritorious variants

Collaborative modulation multiple access for single hop and multihop networks

While the bandwidth available for wireless networks is limited, the world has seen an unprecedented growth in the number of mobile subscribers and an ever increasing demand for high data rates. Therefore efficient utilisation of bandwidth to maximise link spectral efficiency and number of users that can be served simultaneously are primary goals in the design of wireless systems. To achieve these goals, in this thesis, a new non-orthogonal uplink multiple access scheme which combines the functionalities of adaptive modulation and multiple access called collaborative modulation multiple access (CMMA) is proposed. CMMA enables multiple users to access the network simultaneously and share the same bandwidth even when only a single receive antenna is available and in the presence of high channel correlation. Instead of competing for resources, users in CMMA share resources collaboratively by employing unique modulation sets (UMS) that differ in phase, power, and/or mapping structure. These UMS are designed to insure that the received signal formed from the superposition of all users’ signals belongs to a composite QAM constellation (CC) with a rate equal to the sum rate of all users. The CC and its constituent UMSs are designed centrally at the BS to remove ambiguity, maximize the minimum Euclidian distance (dmin) of the CC and insure a minimum BER performance is maintained. Users collaboratively precode their transmitted signal by performing truncated channel inversion and phase rotation using channel state information (CSI ) obtained from a periodic common pilot to insure that their combined signal at the BS belongs to the CC known at the BS which in turn performs a simple joint maximum likelihood detection without the need for CSI. The coherent addition of users’ power enables CMMA to achieve high link spectral efficiency at any time without extra power or bandwidth but on the expense of graceful degradation in BER performance. To improve the BER performance of CMMA while preserving its precoding and detection structure and without the need for pilot-aided channel estimation, a new selective diversity combining scheme called SC-CMMA is proposed. SC-CMMA optimises the overall group performance providing fairness and diversity gain for various users with different transmit powers and channel conditions by selecting a single antenna out of a group of L available antennas that minimises the total transmit power required for precoding at any one time. A detailed study of capacity and BER performance of CMMA and SC-CMMA is carried out under different level of channel correlations which shows that both offer high capacity gain and resilience to channel correlation. SC-CMMA capacity even increase with high channel correlation between users’ channels. CMMA provides a practical solution for implementing the multiple access adder channel (MAAC) in fading environments hence a hybrid approach combining both collaborative coding and modulation referred to as H-CMMA is investigated. H-CMMA divides users into a number of subgroups where users within a subgroup are assigned the same modulation set and different multiple access codes. H-CMMA adjusts the dmin of the received CC by varying the number of subgroups which in turn varies the number of unique constellation points for the same number of users and average total power. Therefore H-CMMA can accommodate many users with different rates while flexibly managing the complexity, rate and BER performance depending on the SNR. Next a new scheme combining CMMA with opportunistic scheduling using only partial CSI at the receiver called CMMA-OS is proposed to combine both the power gain of CMMA and the multiuser diversity gain that arises from users’ channel independence. To avoid the complexity and excessive feedback associated with the dynamic update of the CC, the BS takes into account the independence of users’ channels in the design of the CC and its constituent UMSs but both remain unchanged thereafter. However UMS are no longer associated with users, instead channel gain’s probability density function is divided into regions with identical probability and each UMS is associated with a specific region. This will simplify scheduling as users can initially chose their UMS based on their CSI and the BS will only need to resolve any collision when the channels of two or more users are located at the same region. Finally a high rate cooperative communication scheme, called cooperative modulation (CM) is proposed for cooperative multiuser systems. CM combines the reliability of the cooperative diversity with the high spectral efficiency and multiple access capabilities of CMMA. CM maintains low feedback and high spectral efficiency by restricting relaying to a single route with the best overall channel. Two possible variations of CM are proposed depending on whether CSI available only at the users or just at the BS and the selected relay. The first is referred to Precode, Amplify, and Forward (PAF) while the second one is called Decode, Remap, and Forward (DMF). A new route selection algorithm for DMF based on maximising dmin of random CC is also proposed using a novel fast low-complexity multi-stage sphere based algorithm to calculate the dmin at the relay of random CC that is used for both relay selection and detection

Cooperative Transmission Techniques in Wireless Communication Networks

Cooperative communication networks have received significant interests from both academia and industry in the past decade due to its ability to provide spatial diversity without the need of implementing multiple transmit and/or receive antennas at the end-user terminals. These new communication networks have inspired novel ideas and approaches to find out what and how performance improvement can be provided with cooperative communications. The objective of this thesis is to design and analyze various cooperative transmission techniques under the two common relaying signal processing methods, namely decode-and-forward (DF) and amplify-and-forward (AF). For the DF method, the thesis focuses on providing performance improvement by mitigating detection errors at the relay(s). In particular, the relaying action is implemented adaptively to reduce the phenomenon of error propagation: whether or not a relay’s decision to retransmit depends on its decision variable and a predefined threshold. First, under the scenario that unequal error protection is employed to transmit different information classes at the source, a relaying protocol in a singlerelay network is proposed and its error performance is evaluated. It is shown that by setting the optimal signal-to-noise ratio (SNR) thresholds at the relay for different information classes, the overall error performance can be significantly improved. Second, for multiple-relay networks, a relay selection protocol, also based on SNR thresholds, is proposed and the optimal thresholds are also provided. Third, an adaptive relaying protocol and a low-complexity receiver are proposed when binary frequency-shift-keying (FSK) modulation is employed and neither the receiver nor the transmitter knows the fading coefficients. It is demonstrated that large performance improvements are possible when the optimal thresholds are implemented at the relays and destination. Finally, under the scenario that there is information feedback from the destination to the relays, a novel protocol is developed to achieve the maximum transmission throughput over a multiple-relay network while the bit-error rate satisfies a given constraint. With the AF method, the thesis examines a fixed-gain multiple-relay network in which the channels are temporally-correlated Rayleigh flat fading. Developed is a general framework for maximum-ratio-combining detection when M-FSK modulation is used and no channel state information is available at the destination. In particular, an upper-bound expression on the system’s error performance is derived and used to verify that the system achieves the maximal diversity order. Simulation results demonstrate that the proposed scheme outperforms the existing schemes for the multiple-relay network under consideration

Gaussian Broadcast Channels with an Orthogonal and Bidirectional Cooperation Link

This paper considers a system where one transmitter broadcasts a single common message to two receivers linked by a bidirectional cooperation channel, which is assumed to be orthogonal to the downlink channel. Assuming a simplified setup where, in particular, scalar relaying protocols are used and channel coding is not exploited, we want to provide elements of response to several questions of practical interest. Here are the main underlying issues: 1. The way of recombining the signals at the receivers; 2. The optimal number of cooperation rounds; 3. The way of cooperating (symmetrically or asymmetrically; which receiver should start cooperating in the latter case); 4. The influence of spectral resources. These issues are considered by studying the performance of the assumed system through analytical results when they are derivable and through simulation results. For the particular choices we made, the results sometimes do not coincide with those available for the discrete counterpart of the studied channel