Cooperative Lattice Coding and Decoding

A novel lattice coding framework is proposed for outage-limited cooperative channels. This framework provides practical implementations for the optimal cooperation protocols proposed by Azarian et al. In particular, for the relay channel we implement a variant of the dynamic decode and forward protocol, which uses orthogonal constellations to reduce the channel seen by the destination to a single-input single-output time-selective one, while inheriting the same diversity-multiplexing tradeoff. This simplification allows for building the receiver using traditional belief propagation or tree search architectures. Our framework also generalizes the coding scheme of Yang and Belfiore in the context of amplify and forward cooperation. For the cooperative multiple access channel, a tree coding approach, matched to the optimal linear cooperation protocol of Azarain et al, is developed. For this scenario, the MMSE-DFE Fano decoder is shown to enjoy an excellent tradeoff between performance and complexity. Finally, the utility of the proposed schemes is established via a comprehensive simulation study.Comment: 25 pages, 8 figure

Optimization in multi-relay wireless networks

The concept of cooperation in communications has drawn a lot of research attention in recent years due to its potential to improve the efficiency of wireless networks. This new form of communications allows some users to act as relays and assist the transmission of other users' information signals. The aim of this thesis is to apply optimization techniques in the design of multi-relay wireless networks employing cooperative communications. In general, the thesis is organized into two parts: ``Distributed space-time coding' (DSTC) and ``Distributed beamforming', which cover two main approaches in cooperative communications over multi-relay networks. In Part I of the thesis, various aspects of distributed implementation of space-time coding in a wireless relay network are treated. First, the thesis proposes a new fully-diverse distributed code which allows noncoherent reception at the destination. Second, the problem of coordinating the power allocation (PA) between source and relays to achieve the optimal performance of DSTC is studied and a novel PA scheme is developed. It is shown that the proposed PA scheme can obtain the maximum diversity order of DSTC and significantly outperform other suboptimal PA schemes. Third, the thesis presents the optimal PA scheme to minimize the mean-square error (MSE) in channel estimation during training phase of DSTC. The effect of imperfect channel estimation to the performance of DSTC is also thoroughly studied. In Part II of the thesis, optimal distributed beamforming designs are developed for a wireless multiuser multi-relay network. Two design criteria for the optimal distributed beamforming at the relays are considered: (i) minimizing the total relay power subject to a guaranteed Quality of Service (QoS) measured in terms of signal-to-noise-ratio (SNR) at the destinations, and (ii) jointly maximizing the SNR margin at the destinations subject to power constraints at the relays. Based on convex optimization techniques, it is shown that these problems can be formulated and solved via second-order conic programming (SOCP). In addition, this part also proposes simple and fast iterative algorithms to directly solve these optimization problems

Distributed Quasi-Orthogonal Space-Time coding in wireless cooperative relay networks

Cooperative diversity provides a new paradigm in robust wireless re- lay networks that leverages Space-Time (ST) processing techniques to combat the effects of fading. Distributing the encoding over multiple relays that potentially observe uncorrelated channels to a destination terminal has demonstrated promising results in extending range, data- rates and transmit power utilization. Specifically, Space Time Block Codes (STBCs) based on orthogonal designs have proven extremely popular at exploiting spatial diversity through simple distributed pro- cessing without channel knowledge at the relaying terminals. This thesis aims at extending further the extensive design and analysis in relay networks based on orthogonal designs in the context of Quasi- Orthogonal Space Time Block Codes (QOSTBCs). The characterization of Quasi-Orthogonal MIMO channels for cooper- ative networks is performed under Ergodic and Non-Ergodic channel conditions. Specific to cooperative diversity, the sub-channels are as- sumed to observe different shadowing conditions as opposed to the traditional co-located communication system. Under Ergodic chan- nel assumptions novel closed-form solutions for cooperative channel capacity under the constraint of distributed-QOSTBC processing are presented. This analysis is extended to yield closed-form approx- imate expressions and their utility is verified through simulations. The effective use of partial feedback to orthogonalize the QOSTBC is examined and significant gains under specific channel conditions are demonstrated. Distributed systems cooperating over the network introduce chal- lenges in synchronization. Without extensive network management it is difficult to synchronize all the nodes participating in the relaying between source and destination terminals. Based on QOSTBC tech- niques simple encoding strategies are introduced that provide compa- rable throughput to schemes under synchronous conditions with neg- ligible overhead in processing throughout the protocol. Both mutli- carrier and single-carrier schemes are developed to enable the flexi- bility to limit Peak-to-Average-Power-Ratio (PAPR) and reduce the Radio Frequency (RF) requirements of the relaying terminals. The insights gained in asynchronous design in flat-fading cooperative channels are then extended to broadband networks over frequency- selective channels where the novel application of QOSTBCs are used in distributed-Space-Time-Frequency (STF) coding. Specifically, cod- ing schemes are presented that extract both spatial and mutli-path diversity offered by the cooperative Multiple-Input Multiple-Output (MIMO) channel. To provide maximum flexibility the proposed schemes are adapted to facilitate both Decode-and-Forward (DF) and Amplify- and-Forward (AF) relaying. In-depth Pairwise-Error-Probability (PEP) analysis provides distinct design specifications which tailor the distributed- STF code to maximize the diversity and coding gain offered under the DF and AF protocols. Numerical simulation are used extensively to confirm the validity of the proposed cooperative schemes. The analytical and numerical re- sults demonstrate the effective use of QOSTBC over orthogonal tech- niques in a wide range of channel conditions

Modified quasi-orthogonal space-time block coding in distributed wireless networks

Cooperative networks have developed as a useful technique that can achieve the same advantage as multi-input and multi-output (MIMO) wireless systems such as spatial diversity, whilst resolving the difficulties of co-located multiple antennas at individual nodes and avoiding the effect of path-loss and shadowing. Spatial diversity in cooperative networks is known as cooperative diversity, and can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. It enables single-antenna terminals in a wireless relay network to share their antennas to form a virtual antenna array on the basis of their distributed locations. However, there remain technical challenges to maximize the benefit of cooperative communications, e.g. data rate, asynchronous transmission and outage. In this thesis, therefore, firstly, a modified distributed quasi-orthogonal space-time block coding (M-D-QO-STBC) scheme with increased code gain distance (CGD) for one-way and two-way amplify-and-forward wireless relay networks is proposed. This modified code is designed from set partitioning a larger codebook formed from two quasi-orthogonal space time block codes with different signal rotations then the subcodes are combined and pruned to arrive at the modified codebook with the desired rate in order to increase the CGD. Moreover, for higher rate codes the code distance is maximized by using a genetic algorithm to search for the optimum rotation matrix. This scheme has very good performance and significant coding gain over existing codes such as the open-loop and closed-loop QO-STBC schemes. In addition, the topic of outage probability analysis in the context of multi-relay selection from $N$ available relay nodes for one-way amplify-and-forward cooperative relay networks is considered together with the best relay selection, the $N^{th}$ relay selection and best four relay selection in two-way amplify-and-forward cooperative relay networks. The relay selection is performed either on the basis of a max-min strategy or one based on maximizing exact end-to-end signal-to-noise ratio. Furthermore, in this thesis, robust schemes for cooperative relays based on the M-D-QO-STBC scheme for both one-way and two-way asynchronous cooperative relay networks are considered to overcome the issue of a synchronism in wireless cooperative relay networks. In particular, an orthogonal frequency division multiplexing (OFDM) data structure is employed with cyclic prefix (CP) insertion at the source in the one-way cooperative relay network and at the two terminal nodes in the two-way cooperative network to combat the effects of time asynchronism. As such, this technique can effectively cope with the effects of timing errors. Finally, outage probability performance of a proposed amplify-and-forward cooperative cognitive relay network is evaluated and the cognitive relays are assumed to exploit an overlay approach. A closed form expression for the outage probability for multi-relay selection cooperation over Rayleigh frequency flat fading channels is derived for perfect and imperfect spectrum acquisitions. Furthermore, the M-QO-STBC scheme is also proposed for use in wireless cognitive relay networks. MATLAB and Maple software based simulations are employed throughout the thesis to support the analytical results and assess the performance of new algorithms and methods

Power Allocation in Wireless Relay Networks

This thesis is mainly concerned with power allocation issues in wireless relay networks where a single or multiple relays assist transmission from a single or multiple sources to a destination. First, a network model with a single source and multiple relays is considered, in which both cases of orthogonal and non--orthogonal relaying are investigated. For the case of orthogonal relaying, two power allocation schemes corresponding to two partial channel state information (CSI) assumptions are proposed. Given the lack of full and perfect CSI, appropriate signal processing at the relays and/or destination is also developed. The performance behavior of the system with power allocation between the source and the relays is also analyzed. For the case of non-orthogonal relaying, it is demonstrated that optimal power allocation is not sufficiently effective. Instead, a relay beamforming scheme is proposed. A comprehensive comparison between the orthogonal relaying with power allocation scheme and the non-orthogonal relaying with beamforming scheme is then carried out, which reveals several interesting conclusions with respect to both error performance and system throughput. In the second part of the thesis, a network model with multiple sources and a single relay is considered. The transmission model is applicable for uplink channels in cellular mobile systems in which multiple mobile terminals communicate with the base station with the help of a single relay station. Single-carrier frequency division multiple access (SC-FDMA) technique with frequency domain equalization is adopted in order to avoid the amplification of the multiple access interference at the relay. Minimizing the transmit power at the relay and optimizing the fairness among the sources in terms of throughput are the two objectives considered in implementing power allocation schemes. The problems are visualized as water-filling and water-discharging models and two optimal power allocation schemes are proposed, accordingly. Finally, the last part of the thesis is extended to a network model with multiple sources and multiple relays. The orthogonal multiple access technique is employed in order to avoid multiple access interference. Proposed is a joint optimal beamforming and power allocation scheme in which an alternative optimization technique is applied to deal with the non-convexity of the power allocation problem. Furthermore, recognizing the high complexity and large overhead information exchange when the number of sources and relays increases, a relay selection scheme is proposed. Since each source is supported by at most one relay, the feedback information from the destination to each relay can be significantly reduced. Using an equal power allocation scheme, relay selection is still an NP-hard combinatorial optimization problem. Nevertheless, the proposed sub-optimal scheme yields a comparable performance with a much lower computational complexity and can be well suited for practical systems

Cooperative Diversity and Partner Selection in Wireless Networks

Next generation wireless communication systems are expected to provide a variety of services including voice, data and video. The rapidly growing demand for these services needs high data rate wireless communication systems with reliability and high user capacity. Recently, it has been shown that reliability and achievable data rate of wireless communication systems increases dramatically by employing multiple transmit and receive antennas. Transmit diversity is a powerful technique for combating multipath fading in wireless communications. However, employing multiple antennas in a mobile terminal to achieve the transmit diversity in the uplink is not feasible due to the limited size of the mobile unit. In order to overcome this problem, a new mode of transmit diversity called cooperative diversity (CD) based on user cooperation, was proposed very recently. By user cooperation, it is meant that the sender transmits to the destination and copies to other users, called partners, for relaying to the destination. The antennas of the sender and the partners together form a multiple antenna situation. CD systems are immuned not only against small scale channel fading but also against large scale channel fading. On the other hand, CD systems are more sensitive to interuser (between sender and partner) transmission errors and user mobility. In this dissertation, we propose a bandwidth and power efficient CD system which could be accommodated with minimal modifications in the currently available direct or point-to-point communication systems. The proposed CD system is based on quadrature signaling (QS). With quadrature signaling, both sender’s and partners’ information symbols are transmitted simultaneously in his/her multiple access channels. It also reduces the synchronization as well as the interference problems that occur in the schemes reported in the literature. The performance of the proposed QS-CD system is analyzed at different layers. First, we study the bit error probability (BEP) of the QS-CD system for both fixed and adaptive relaying at the partner. It is shown from the BEP performance that the QS-CD system can achieve diversity order of two. Then, a cross-layer communication system is developed by combing the proposed QS-CD system at the physical layer and the truncated stop-and- wait automatic repeat request (ARQ) at the data link layer. The performance of the cross-layer system is analyzed and compared with existing schemes in the literature for performance metrics at the data link layer and upper layers, i.e., frame error rate, packet loss rate, average packet delay, throughput, etc. In addition, the studies show that the proposed QS-CD-ARQ system outperforms existing schemes when it has a good partner. In this respect, the proposed system is fully utilizing the communication channel and less complex in terms of implementation when compared with the existing systems. Since the partner selection gives significant impact on the performance of the CD systems, partner selection algorithms (PSAs) are extensively analyzed for both static and mobile user network. In this case, each individual user would like to take advantage of cooperation by choosing a suitable partner. The objective of an individual user may conflict with the objective of the network. In this regard, we would like to introduce a PSA which tries to balance both users and network objectives by taking user mobility into consideration. The proposed PSA referred to as worst link first (WLF), to choose the best partner in cooperative communication systems. The WLF algorithm gives priority to the worst link user to choose its partner and to maximize the energy gain of the radio cell. It is easy to implement not only in centralized networks but also in distributed networks with or without the global knowledge of users in the network. The proposed WLF matching algorithm, being less complex than the optimal maximum weighted (MW) matching and the heuristic based Greedy matching algorithms, yields performance characteristics close to those of MW matching algorithm and better than the Greedy matching algorithm in both static and mobile user networks. Furthermore, the proposed matching algorithm provides around 10dB energy gain with optimal power allocation over a non-cooperative system which is equivalent to prolonging the cell phone battery recharge time by about ten times

Cooperative Diversity and Partner Selection in Wireless Networks

Next generation wireless communication systems are expected to provide a variety of services including voice, data and video. The rapidly growing demand for these services needs high data rate wireless communication systems with reliability and high user capacity. Recently, it has been shown that reliability and achievable data rate of wireless communication systems increases dramatically by employing multiple transmit and receive antennas. Transmit diversity is a powerful technique for combating multipath fading in wireless communications. However, employing multiple antennas in a mobile terminal to achieve the transmit diversity in the uplink is not feasible due to the limited size of the mobile unit. In order to overcome this problem, a new mode of transmit diversity called cooperative diversity (CD) based on user cooperation, was proposed very recently. By user cooperation, it is meant that the sender transmits to the destination and copies to other users, called partners, for relaying to the destination. The antennas of the sender and the partners together form a multiple antenna situation. CD systems are immuned not only against small scale channel fading but also against large scale channel fading. On the other hand, CD systems are more sensitive to interuser (between sender and partner) transmission errors and user mobility. In this dissertation, we propose a bandwidth and power efficient CD system which could be accommodated with minimal modifications in the currently available direct or point-to-point communication systems. The proposed CD system is based on quadrature signaling (QS). With quadrature signaling, both sender’s and partners’ information symbols are transmitted simultaneously in his/her multiple access channels. It also reduces the synchronization as well as the interference problems that occur in the schemes reported in the literature. The performance of the proposed QS-CD system is analyzed at different layers. First, we study the bit error probability (BEP) of the QS-CD system for both fixed and adaptive relaying at the partner. It is shown from the BEP performance that the QS-CD system can achieve diversity order of two. Then, a cross-layer communication system is developed by combing the proposed QS-CD system at the physical layer and the truncated stop-and- wait automatic repeat request (ARQ) at the data link layer. The performance of the cross-layer system is analyzed and compared with existing schemes in the literature for performance metrics at the data link layer and upper layers, i.e., frame error rate, packet loss rate, average packet delay, throughput, etc. In addition, the studies show that the proposed QS-CD-ARQ system outperforms existing schemes when it has a good partner. In this respect, the proposed system is fully utilizing the communication channel and less complex in terms of implementation when compared with the existing systems. Since the partner selection gives significant impact on the performance of the CD systems, partner selection algorithms (PSAs) are extensively analyzed for both static and mobile user network. In this case, each individual user would like to take advantage of cooperation by choosing a suitable partner. The objective of an individual user may conflict with the objective of the network. In this regard, we would like to introduce a PSA which tries to balance both users and network objectives by taking user mobility into consideration. The proposed PSA referred to as worst link first (WLF), to choose the best partner in cooperative communication systems. The WLF algorithm gives priority to the worst link user to choose its partner and to maximize the energy gain of the radio cell. It is easy to implement not only in centralized networks but also in distributed networks with or without the global knowledge of users in the network. The proposed WLF matching algorithm, being less complex than the optimal maximum weighted (MW) matching and the heuristic based Greedy matching algorithms, yields performance characteristics close to those of MW matching algorithm and better than the Greedy matching algorithm in both static and mobile user networks. Furthermore, the proposed matching algorithm provides around 10dB energy gain with optimal power allocation over a non-cooperative system which is equivalent to prolonging the cell phone battery recharge time by about ten times