Transmit Signal and Bandwidth Optimization in Multiple-Antenna Relay Channels

Transmit signal and bandwidth optimization is considered in multiple-antenna relay channels. Assuming all terminals have channel state information, the cut-set capacity upper bound and decode-and-forward rate under full-duplex relaying are evaluated by formulating them as convex optimization problems. For half-duplex relays, bandwidth allocation and transmit signals are optimized jointly. Moreover, achievable rates based on the compress-and-forward transmission strategy are presented using rate-distortion and Wyner-Ziv compression schemes. It is observed that when the relay is close to the source, decode-and-forward is almost optimal, whereas compress-and-forward achieves good performance when the relay is close to the destination.Comment: 16 pages, 10 figure

Achievable Rate Regions for Two-Way Relay Channel using Nested Lattice Coding

This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes. A compress-and-forward relaying strategy using nested lattice codes is first proposed. Then, the proposed scheme is improved by performing a layered coding : a common layer is decoded by both receivers and a refinement layer is recovered only by the receiver which has the best channel conditions. The achievable rates of the new scheme are characterized and are shown to be higher than those provided by the decode-and-forward strategy in some regions.Comment: 27 pages, 13 figures, Submitted to IEEE Transactions on Wireless Communications (October 2013

Hardware Impairments Aware Transceiver Design for Full-Duplex Amplify-and-Forward MIMO Relaying

In this work we study the behavior of a full-duplex (FD) and amplify-and-forward (AF) relay with multiple antennas, where hardware impairments of the FD relay transceiver is taken into account. Due to the inter-dependency of the transmit relay power on each antenna and the residual self-interference in an FD-AF relay, we observe a distortion loop that degrades the system performance when the relay dynamic range is not high. In this regard, we analyze the relay function in presence of the hardware inaccuracies and an optimization problem is formulated to maximize the signal to distortion-plus-noise ratio (SDNR), under relay and source transmit power constraints. Due to the problem complexity, we propose a gradient-projection-based (GP) algorithm to obtain an optimal solution. Moreover, a nonalternating sub-optimal solution is proposed by assuming a rank-1 relay amplification matrix, and separating the design of the relay process into multiple stages (MuStR1). The proposed MuStR1 method is then enhanced by introducing an alternating update over the optimization variables, denoted as AltMuStR1 algorithm. It is observed that compared to GP, (Alt)MuStR1 algorithms significantly reduce the required computational complexity at the expense of a slight performance degradation. Finally, the proposed methods are evaluated under various system conditions, and compared with the methods available in the current literature. In particular, it is observed that as the hardware impairments increase, or for a system with a high transmit power, the impact of applying a distortion-aware design is significant.Comment: Submitted to IEEE Transactions on Wireless Communication

Lossy Source Transmission over the Relay Channel

Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels. Then the Gaussian relay channel where the source and the side information are jointly Gaussian is analyzed. For this Gaussian model, several new source-channel cooperation schemes are introduced and analyzed in terms of the squared-error distortion at the destination. A comparison of the proposed upper bounds with the cut-set lower bound is given, and it is seen that joint source-channel cooperation improves the reconstruction quality significantly. Moreover, the performance of the joint code is close to the lower bound on distortion for a wide range of source and channel parameters.Comment: Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 200

The Multi-way Relay Channel

The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multi-way relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate simultaneously, where the users within the same cluster wish to exchange messages among themselves. It is assumed that the users cannot receive each other's signals directly, and hence the relay terminal in this model is the enabler of communication. In particular, restricted encoders, which ignore the received channel output and use only the corresponding messages for generating the channel input, are considered. Achievable rate regions and an outer bound are characterized for the Gaussian mRC, and their comparison is presented in terms of exchange rates in a symmetric Gaussian network scenario. It is shown that the compress-and-forward (CF) protocol achieves exchange rates within a constant bit offset of the exchange capacity independent of the power constraints of the terminals in the network. A finite bit gap between the exchange rates achieved by the CF and the amplify-and-forward (AF) protocols is also shown. The two special cases of the mRC, the full data exchange model, in which every user wants to receive messages of all other users, and the pairwise data exchange model which consists of multiple two-way relay channels, are investigated in detail. In particular for the pairwise data exchange model, in addition to the proposed random coding based achievable schemes, a nested lattice coding based scheme is also presented and is shown to achieve exchange rates within a constant bit gap of the exchange capacity.Comment: Revised version of our submission to the Transactions on Information Theor