Aydin Sezgin

Capacity of the two-way relay channel within a constant gap

SUMMARY We study the capacity of the full-duplex bidirectional (or t wo-way) relay channel with two nodes and one relay. The channels in the forward direction are assumed to be different (in general) than the channels in the backward direction, i.e. channel reciprocity is not ass umed. We use the recently proposed deterministic approach to capture the essence of the problem and to determine a good transmission and relay strategy for the Gaussian channel. Depending on the ratio of the individual channel gains, we propose to use either a simple amplify-and-forward or a particular superposition coding strategy at the relay. We analyze the achievable rate region and show that the scheme achieves to within 3 bits the cut-set bound for all values of channel gains. Copyright c 0000 AEIT

A new cooperative transmission scheme using the space-time delay code

We propose a new resource efficient transmission scheme to achieve cooperative diversity of a distributed smart antenna system consisting of an information source, destination, and two alternating supportive relay stations. Each station is equipped with one antenna element. Furthermore we assume perfect synchronization and channel knowledge at the receivers. The proposed linear encoding functions with interference cancellation at one relay station result in an equivalent space-time delay coded system, but with additionally colored noise from the relay stations. Based on the maximum likelihood sequence estimator we derive criteria to evaluate the performance compared to the direct S1SO transmission. Finally the numerical simulation results of an suboptimal sequence estimator show significant performance gains if the power gain from the hopping is gainful exploited. If not, the additional noise from the relay stations will degrade the performance at reasonable transmit powers.

Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network

The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic channel model. The capacity region of this network when the relay is operating at either full-duplex mode or half-duplex mode for arbitrary number of pairs is characterized. It is shown that the cut-set upper-bound is tight and the capacity region is achieved by a so called divide-and-conquer relaying strategy. The insights gained from the deterministic network are then used for the Gaussian bidirectional relay network. The strategy in the deterministic channel translates to a specific superposition of lattice codes and random Gaussian codes at the source nodes and successive interference cancelation at the receiving nodes for the Gaussian network. The achievable rate of this scheme with two pairs is analyzed and it is shown that for all channel gains it achieves to within 3 bits/sec/Hz per user of the cut-set upper-bound. Hence, the capacity region of the two-pair bidirectional Gaussian relay network to within 3 bits/sec/Hz per user is characterized.

Approximate capacity of the two-way relay channel: A deterministic approach

We study the capacity of the full-duplex bidirectional (or two-way) relay channel with two nodes and one relay. The channels in the forward direction are assumed to be different (in general) than the channels in the backward direction, i.e. channel reciprocity is not assumed. We use the recently proposed deterministic approach to capture the essence of the problem and to determine a good transmission and relay strategy for the Gaussian channel. Depending on the ratio of the individual channel gains, we propose to use either a simple amplify-and-forward or a particular superposition coding strategy at the relay. We analyze the achievable rate region and show that the scheme achieves to within 3 bits the cut-set bound for all values of channel gains.

Approximate capacity region of the two-pair bidirectional Gaussian relay network

We study the capacity of the Gaussian two-pair fullduplex directional (or two-way) relay network with a single-relay supporting the communication of the pairs. This network is a generalization of the well known bidirectional relay channel, where we have only one pair of users. We propose a novel transmission technique which is based on a specific superposition of lattice codes and random Gaussian codes at the source nodes. The relay attempts to decode the Gaussian codewords and the superposition of the lattice codewords of each pair. Then it forwards this information to all users. We analyze the achievable rate of this scheme and show that for all channel gains it achieves to within 2 bits/sec/Hz per user of the cut-set upper bound on the capacity region of the two-pair bidirectional relay network.

Capacity region of the deterministic multi-pair bi-directional relay network

In this paper we study the capacity region of the multi-pair bidirectional (or two-way) wireless relay network, in which a relay node facilitates the communication between multiple pairs of users. This network is a generalization of the well known bidirectional relay channel, where we have only one pair of users. We examine this problem in the context of the deterministic channel interaction model, which eliminates the channel noise and allows us to focus on the interaction between signals. We characterize the capacity region of this network when the relay is operating at either full-duplex mode or half-duplex mode (with non adaptive listen-transmit scheduling). In both cases we show that the cut-set upper bound is tight and, quite interestingly, the capacity region is achieved by a simple equation-forwarding strategy.

Impact of spatial correlation on the performance of orthogonal space-time block codes

We analyze the impact of transmitter and receiver spatial correlation on the performance of a multiple-input multiple-output (MIMO) system which applies an orthogonal space-time block code with no channel state information at the transmitter and perfect channel state information at the receiver. We derive a general formula for the bit error rate of a MIMO system with arbitrary number of transmit and receive antennas as a function of the correlation at the transmitter and the receiver. We prove that the diversity advantage is given by M/spl middot/N if M is the rank of the transmit correlation matrix and N the rank of the receive correlation matrix, respectively.

Antenna Selection in Space-Time Block Coded Systems: Performance Analysis and Low-Complexity Algorithm

This paper presents outage probability analysis and a practical algorithm for antenna selection in multiple-input multiple-output wireless communication systems employing space-time block codes (STBC). First, to minimize the outage probability in these systems, a satisfactory antenna selection criterion for an STBC is to maximize the channel Frobenius norm. Analysis shows that the more receive antennas are selected, the better the performance. However, the performance of transmit antenna selection heavily depends on how fast the channel changes. When the channel changes slowly, since STBC averages the channel gains of the selected transmit antennas, selecting more transmit antennas causes lower coding gain and thus higher outage probability. When the channel is fast changing, it is shown analytically that the system can no longer provide transmit selection diversity in the high SNR regime. Since the transmit diversity can be still provided by using STBC, the best STBC scheme varies with SNR. Although the outage analysis helps determine the STBC scheme, finding the optimal antenna subsets with maximum channel Frobenius norm for each fading state is still a challenging problem. This is because solving the problem optimally requires an exhaustive search with exponentially growing complexity. When the numbers of antennas are large, the problem becomes intractable. To reduce the complexity, this problem is formulated as a quadratically constrained quadratic programming (QCQP) problem. Despite the fact that the problem is nonconvex, a semidefinite relaxation of QCQP enables the problem to be solved approximately in polynomial time. Simulation results indicate that the loss of semidefinite relaxation to optimal selection is negligible.

The degrees of freedom of the MIMO Y-channel

The degrees of freedom (DoF) of the MIMO Y-channel, a multi-way communication network consisting of 3 users and a relay, are characterized for arbitrary number of antennas. The converse is provided by cut-set bounds and novel genie-aided bounds. The achievability is shown by a scheme that uses beamforming to establish network coding on-the-fly at the relay in the uplink, and zero-forcing pre-coding in the downlink. It is shown that the network has min{2M2+2M3, M1+ M2 + M3,2N} DoF, where Mj and N represent the number of antennas at user j and the relay, respectively. Thus, in the extreme case where M1+M2+M3 dominates the DoF expression and is smaller than N, the network has the same DoF as the MAC between the 3 users and the relay. In this case, a decode and forward strategy is optimal. In the other extreme where 2N dominates, the DoF of the network is twice that of the aforementioned MAC, and hence network coding is necessary. As a byproduct of this work, it is shown that channel output feedback from the relay to the users has no impact on the DoF of this channel.

On the Generalized Degrees of Freedom of the Gaussian Interference Relay Channel

The symmetric two-user Gaussian interference relay channel (IRC) is studied from a generalized degrees of freedom (GDoF) perspective. While it is known that the relay does not in crease the DoF of the IRC, such a characterization has not been reported for the GDoF yet. The focus of this paper is on all cases where the interference link is stronger than the link from the source to the relay. This regime basically covers half the space of all possible parameters of the IRC. By using genie-aided approaches, new sum-capacity upper bounds are derived. These bounds are then compared with rates achieved with a novel transmission scheme, which is based on a functional decode-and-forward (FDF) strategy. It is shown that the GDoF of the IRC is achieved by FDF in the given regime, and that a relay can indeed increase the GDoF of IRC. Finally, the FDF scheme is compared with other schemes like decode-and-forward as well as compress-and-forward at low, moderate, and high signal-to-noise ratios.