Distributed space-time-frequency block code for cognitive wireless relay networks

In this study, the authors consider cooperative transmission in cognitive wireless relay networks (CWRNs) over frequency-selective fading channels. They propose a new distributed space-time–frequency block code (DSTFBC) for a two-hop non-regenerative CWRN, where a primary source node and multiple secondary source nodes convey information data to their desired primary destination node and multiple secondary destination nodes via multiple cognitive relay nodes with dynamic spectrum access. The proposed DSTFBC is designed to achieve spatial diversity gain as well as allow for low-complexity decoupling detection at the receiver. Pairwise error probability is then analysed to study the achievable diversity gain of the proposed DSTFBC for different channel models including Rician fading and mixed Rayleigh–Rician fading

Distributed space-time-frequency block code for cognitive wireless relay networks

In this study, the authors consider cooperative transmission in cognitive wireless relay networks (CWRNs) over frequency-selective fading channels. They propose a new distributed space-time–frequency block code (DSTFBC) for a two-hop non-regenerative CWRN, where a primary source node and multiple secondary source nodes convey information data to their desired primary destination node and multiple secondary destination nodes via multiple cognitive relay nodes with dynamic spectrum access. The proposed DSTFBC is designed to achieve spatial diversity gain as well as allow for low-complexity decoupling detection at the receiver. Pairwise error probability is then analysed to study the achievable diversity gain of the proposed DSTFBC for different channel models including Rician fading and mixed Rayleigh–Rician fading

Power efficient designs for 5G wireless networks

In this dissertation, to step forward towards green communication, we study power efficient solutions in three potential 5G wireless networks, namely an asynchronous multicarrier two-way Amplify-and-Forward (AF) relay network, a multi-carrier two-way Filter-and-Forward (FF) network, and a massive Multiple Input Multiple Output (MIMO) network using the Non-Orthogonal Multiple Access (NOMA) scheme. In the first network, two transceivers using the Orthogonal Frequency Division Multiplexing (OFDM) scheme communicate through multiple relays in an asynchronous manner. As an attempt to design a simple solution, we assume the AF protocol at the relays. We jointly design the power allocation and distributed beamforming coefficients to minimize the total transmission power subject to sum-rate constraints. We propose an optimal semi-closed form solution to this problem and we show that at the optimum, the end-to-end channel has only one non-zero tap. To extend the first work to high data-rate scenarios, we consider a second relaying-based network which consists of two OFDM-based transceivers and multiple FF relays. We propose two approaches to tackle a total transmission power minimization problem: a gradient steepest descent-based technique, and a low-complexity method enforcing a frequency-flat Channel Impulse Response (CIR) response at the optimum. As the last network, we consider a massive MIMO-NOMA network with both co-located and distributed structures. We study the joint problem of power allocation and user clustering to minimize the total transmit power subject to QoS constraints. We propose a novel clustering algorithm which groups the correlated users into the same cluster and has an unique ability to automatically switch between using the spatial-domain-MIMO and the power-domain-NOMA. We show that our proposed method can substantially improve the feasibility probability and power consumption performance compared to existing methods

Outage Probability of Multi-hop Networks with Amplify-and-Forward Full-duplex Relaying

abstract: Full-duplex communication has attracted significant attention as it promises to increase the spectral efficiency compared to half-duplex. Multi-hop full-duplex networks add new dimensions and capabilities to cooperative networks by facilitating simultaneous transmission and reception and improving data rates. When a relay in a multi-hop full-duplex system amplifies and forwards its received signals, due to the presence of self-interference, the input-output relationship is determined by recursive equations. This thesis introduces a signal flow graph approach to solve the problem of finding the input-output relationship of a multi-hop amplify-and-forward full-duplex relaying system using Mason's gain formula. Even when all links have flat fading channels, the residual self-interference component due to imperfect self-interference cancellation at the relays results in an end-to-end effective channel that is an all-pole frequency-selective channel. Also, by assuming the relay channels undergo frequency-selective fading, the outage probability analysis is performed and the performance is compared with the case when the relay channels undergo frequency-flat fading. The outage performance of this system is performed assuming that the destination employs an equalizer or a matched filter. For the case of a two-hop (single relay) full-duplex amplify-and-forward relaying system, the bounds on the outage probability are derived by assuming that the destination employs a matched filter or a minimum mean squared error decision feedback equalizer. For the case of a three-hop (two-relay) system with frequency-flat relay channels, the outage probability analysis is performed by considering the output SNR of different types of equalizers and matched filter at the destination. Also, the closed-form upper bounds on the output SNR are derived when the destination employs a minimum mean squared error decision feedback equalizer which is used in outage probability analysis. It is seen that for sufficiently high target rates, full-duplex relaying with equalizers is always better than half-duplex relaying in terms of achieving lower outage probability, despite the higher RSI. In contrast, since full-duplex relaying with MF is sensitive to RSI, it is outperformed by half-duplex relaying under strong RSI.Dissertation/ThesisMasters Thesis Electrical Engineering 201

Cooperative underwater acoustic communications

This article presents a contemporary overview of underwater acoustic communication (UWAC) and investigates physical layer aspects on cooperative transmission techniques for future UWAC systems. Taking advantage of the broadcast nature of wireless transmission, cooperative communication realizes spatial diversity advantages in a distributed manner. The current literature on cooperative communication focuses on terrestrial wireless systems at radio frequencies with sporadic results on cooperative UWAC. In this article, we summarize initial results on cooperative UWAC and investigate the performance of a multicarrier cooperative UWAC considering the inherent unique characteristics of the underwater channel. Our simulation results demonstrate the superiority of cooperative UWAC systems over their point-to-point counterparts. © 1979-2012 IEEE

Cooperative diversity techniques for high-throughput wireless relay networks

Relay communications has attracted a growing interest in wireless communications with application to various enhanced technologies. This thesis considers a number of issues related to data throughput in various wireless relay network models. Particularly, new implementations of network coding (NC) and space-time coding (STC) techniques are investigated to offer various means of achieving high-throughput relay communications. Firstly, this thesis investigates different practical automatic repeat request (ARQ) retransmission protocols based on NC for two-way wireless relay networks to improve throughput efficiency. Two improved NC-based ARQ schemes are designed based on go-back-N and selective-repeat (SR) protocols. Addressing ARQ issues in multisource multidestination relay networks, a new NC-based ARQ protocol is proposed and two packet-combination algorithms are developed for retransmissions at relay and sources to significantly improve the throughput. In relation to the concept of channel quality indicator (CQI) reporting in two-way relay networks, two new efficient CQI reporting schemes are designed based on NC to improve the system throughput by allowing two terminals to simultaneously estimate the CQI of the distant terminal-relay link without incurring additional overhead. The transmission time for CQI feedback at the relays is reduced by half while the increase in complexity and the loss of performance are shown to be negligible. Furthermore, a low-complexity relay selection scheme is suggested to reduce the relay searching complexity. For the acknowledgment (ACK) process, this thesis proposes a new block ACK scheme based on NC to significantly reduce the ACK overheads and therefore produce an enhanced throughput. The proposed scheme is also shown to improve the reliability of block ACK transmission and reduce the number of data retransmissions for a higher system throughput. Additionally, this thesis presents a new cooperative retransmission scheme based on relay cooperation and NC to considerably reduce the number of retransmission packets and im- prove the reliability of retransmissions for a more power efficient and higher throughput system with non-overlapped retransmissions. Moreover, two relay selection schemes are recommended to determine the optimised number of relays for the retransmission. Finally, with respect to cognitive wireless relay networks (CWRNs), this thesis proposes a new cooperative spectrum sensing (CSS) scheme to improve the spectrum sensing performance and design a new CSS scheme based on NC for three-hop CWRNs to improve system throughput. Furthermore, a new distributed space-time-frequency block code (DSTFBC) is designed for a two- hop nonregenerative CWRN over frequency-selective fading channels. The proposed DSTFBC design achieves higher data rate, spatial diversity gain, and decoupling detection of data blocks at all destination nodes with a low-complexity receiver structure

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