Analysis of capacity and coverage region for Rayleigh fading MIMO relay channel

In this paper, we consider Rayleigh fading MIMO relay channel with channel state information at the receivers. First, we extend the previously obtained results for the ergodic capacity of uncorrelated and semi‐correlated MIMO channels and derive closed‐form expressions for the capacity bounds of MIMO relay channel. Next, we study this channel from a new point of view, maximizing coverage region for a desired transmission rate, and investigate the optimal relay location in the sense of maximizing coverage region. However, in order to overcome the mathematical complexity in desired transmission rate analysis, because of the randomness of the multiple antenna channel matrices, we evaluate this rate by using an existing exact formula and also by an approximation we find in the high signal‐to‐noise ratio regime. Numerical results show a perfect match between the Monte Carlo simulations and the obtained analytical closed‐form expressions and also confirm the effectiveness of our approach in cooperative vehicular communication for determining optimal relay location at which the coverage region is maximum. Copyright © 2013 John Wiley & Sons, Ltd.     

New Diversity Combining Receivers for Cooperative Multiplexing in Wireless Multiuser Relay Networks

We propose two new diversity combining receivers that support cooperative multiplexing in two-hop wireless multiuser relay networks. Cooperative multiplexing has the potential to double the achievable throughput by allowing the base station (BS) and the relay station (RS) to transmit to different users at the same time in the second time slot of the half time division duplexed (TDD) relay transmission. This throughput improvement comes at a cost of performance degradation due to inter-user interference between the BS and the RS. To overcome this degradation, we propose two new receivers for the relay-link users: (1) cooperative multiplexing optimum combining (CMOC) and (2) cooperative multiplexing selection combining (CMSC). The proposed CMOC receiver combines the signals in the first and second time slot of the half TDD transmission such that the output signal-to-interference-plus-noise ratio (SINR) is maximized. The proposed CMSC receiver allows the relay-link user terminal to be active in only one of the two half TDD time slots. As such, CMSC offers power savings relative to CMOC. New insights are drawn from our exact closed-form expressions that we derive for the moment generation function, probability density function, and the cumulative distribution function of the output SINR. Based on these, we present new analytical expressions for the outage probability, symbol error rate, and achievable throughput. Our results show a 3.5 times improvement in the achievable throughput relative to the standard single-channel receiver in the high interference regime.     

Multiple user information theory

A unified framework is given for multiple user information networks. These networks consist of several users communicating to one another in the presence of arbitrary interference and noise. The presence of many senders necessitates a tradeoff in the achievable information transmission rates. The goal is the characterization of the capacity region consisting of all achievable rates. The focus is on broadcast, multiple access, relay, and other channels for which the recent theory is relativdy well developed. A discussion of the Gaussian version of these channels demonstrates the concreteness of the encoding and decoding necessary to achieve optimal information flow. We also offer speculations about the form of a general theory of information flow in networks.     

Capacity Regions and Bounds for a Class of Z-Interference Channels

We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A channel in this class has the property that, for the transmitter-receiver pair that suffers from interference, the conditional output entropy at the receiver is invariant with respect to the transmitted codewords. We compare the new capacity region upper bound with the Han/Kobayashi achievable rate region for interference channels. This comparison shows that our bound is tight in some cases, thereby yielding specific points on the capacity region as well as sum capacity for certain Z-interference channels. In particular, this result can be used as an alternate method to obtain sum capacity of Gaussian Z-interference channels. We then apply an additional restriction on our channel class: the transmitter-receiver pair that suffers from interference achieves its maximum output entropy with a single input distribution irrespective of the interference distribution. For these channels, we show that our new capacity region upper bound coincides with the Han/Kobayashi achievable rate region, which is therefore capacity-achieving. In particular, for these channels superposition encoding with partial decoding is shown to be optimal and a single-letter characterization for the capacity region is obtained.     

Cooperative amplify‐and‐forward partial relay selection with outdated channel information in spectrum‐sharing systems

Recently, cooperative relaying techniques have been integrated into spectrum‐sharing systems in an effort to yield higher spectral efficiency. Many investigations on such systems have assumed that the channel state information between the secondary transmitter and primary receiver used to calculate the maximum allowable transmit secondary user transmit power to limit the interference is known to be perfect. However, because of feedback delay from the primary receiver or the time‐varying properties of the channel, the channel information may be outdated, which is an important scenario to cognitive radio systems. In this paper, we investigate the impact of outdated channel state information for relay selection on the performance of partial relay selection with amplify and forward in underlay spectrum‐sharing systems. We begin by deriving a closed‐form expression for the outage probability of the secondary network in a Rayleigh fading channel along with peak received interference power constraint and maximum allowable secondary user transmit power. We also provide a closed‐form expression for the average bit‐error rate of the underlying system. Moreover, we present asymptotic expressions for both the outage probability and average bit‐error rate in the high signal‐to‐noise ratio regime that reveal practical insights on the achievable diversity gain. Finally, we confirm our results through comparisons with computer simulations. Copyright © 2016 John Wiley & Sons, Ltd.     

Outage and ergodic sum‐rate performance of cooperative MIMO‐NOMA with imperfect CSI and SIC

In this paper, we examine a half‐duplex cooperative multiple‐input multiple‐output non‐orthogonal multiple access system with imperfect channel state information (CSI) and successive interference cancelation. The base station (BS) and mobile users with multi‐antenna communicate by the assistance of a CSI based or fixed gain amplify‐and‐forward (AF) relay with a single antenna. The diversity schemes, transmit antenna selection, and maximal ratio combining are applied at the BS and mobile users, respectively. We study the system performance in terms of outage probability (OP) and ergodic sum‐rate. Accordingly, the exact OP expressions are first derived jointly for the CSI based and fixed gain AF relay cases in Nakagami‐m fading channels. Next, the corresponding lower and upper bound expressions of the OP are obtained. The high signal‐to‐noise ratio analyses are also carried out to demonstrate the error floor value resulted in the practical case and achievable diversity order and array gain in the ideal case. Moreover, the lower and upper bounds of the ergodic sum‐rate expressions are derived together for the CSI based and fixed gain AF relay cases. Finally, the Monte‐Carlo simulations are used to verify the correctness of the analytical results.     

Performance analysis of two‐way wireless‐powered Amplify‐and‐Forward relaying in the presence of co‐channel interference

In this paper, we investigate the performance assessment of a bidirectional relaying system using energy harvesting techniques. We assume independent and nonidentically distributed (i.n.i.d.) Nakagami‐m fading channels where the amplify‐and‐forward relay is subject to co‐channel interference (CCI) due to transmissions of other transmitters. Two different scenarios, namely, scenario I and scenario II are evaluated. In scenario I, both end‐sources provide the required energy for the relay, whereas the relay also harvests energy from the co‐channel interferes. Then, in the first phase of cooperation, both end‐sources send the information to the relay, and after amplifying the received signal, relay transfers information to the appropriate destination in the second time‐slot. In the scenario II, both end‐sources harvest energy from the relay. After that, the information cooperative transmission is done similar to the first scenario. For both considered scenarios, tight closed‐form expressions of outage probability, symbol error probability, ergodic capacity, and throughput are obtained at arbitrary signal‐to‐noise‐ratios (SNRs). To get more insights, simplified high SNR results for both scenarios are also deduced where the diversity orders are obtained. Monte Carlo simulation results are presented to validate the correctness of our proposed analysis. Our results explicitly demonstrate that the first scenario has a better performance than the second one in the medium and high SNR region, whereas the second scenario outperforms the first one in the low SNR regime.     

On the diversity gain region of the dynamic decode-and-forward relay-assisted Z-channel

In an interference-limited system, the interference forwarding by a relay enhances the interference level and thereby enables the cancellation of the interference. In this work, interference forwarding by a half-duplex dynamic decode-and-forward (HD DDF) relay in a two-user Z-channel is considered. In the two-user Z-channel, one user is interference-limited while the other user is interference-free. The diversity gain region (DGR), which characterizes the tradeoff between the achievable diversity orders between the two users, is an appropriate performance metric for the Z-channel. Closed-form expression for the achievable DGR with the interference forwarding by the HD DDF relay is presented. The multiplexing gain regions (MGRs) where the HD DDF protocol achieves better DGR over the direct transmission scheme, full-duplex decode-and-forward (FD DF) and FD partial DF relay assisted Z- channel are identified. The HD DDF protocol is shown to achieve better DGR than the FD DF and FD PDF relay for a large range of MGR. The achievable DGRs for the HD DDF, FD DF, and FD PDF relay-assisted Z-channel and direct transmission scheme are presented for various interference levels and multiplexing gain pairs.     

Interference Channels With Common Information

In this paper, the interference channel with common information (ICC), in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers, is investigated. An achievable rate region for such a channel is obtained by applying a superposition coding scheme that consists of successive encoding and simultaneous decoding. It is shown that the derived achievable rate region includes or extends several existing results for the interference channels with or without common information. The rate region is then specialized to a class of ICCs in which one sender has no private information to transmit, and a class of deterministic interference channels with common information (DICCs). In particular, the derived rate region is found to be the capacity region for this class of DICCs. Last, the achievable rate region derived for the discrete memoryless ICC is extended to the Gaussian case, in which a numerical example is provided to illustrate the improvement of our rate region over an existing result.     

Suboptimality of TDMA in the low-power regime

We consider multiaccess, broadcast, and interference channels with additive Gaussian noise. Although the set of rate pairs achievable by time-division multiple access (TDMA) is not equal to the capacity region, the TDMA achievable region converges to the capacity region as the power decreases. Furthermore, TDMA achieves the optimum minimum energy per bit. Despite those features, this paper shows that the growth of TDMA-achievable rates with the energy per bit is suboptimal in the low-power regime except in special cases: multiaccess channels where the users' energy per bit are identical and broadcast channels where the receivers have identical signal-to-noise ratios. For the additive Gaussian noise interference channel, we identify a small region of interference parameters outside of which TDMA is also shown to be suboptimal. The effect of fading (known to the receiver) on the suboptimality of TDMA is also explored.     

An achievable rate region and a capacity outer bound for 3‐user Gaussian multiple access channel with feedback

Extension of the Ozarow capacity theorem for 2‐transmitter Gaussian multiple access channel (MAC) with feedback to the channels with more than 2 transmitters is a widely studied and long standing problem (for example, see the Kramer sum‐capacity region). In this paper, we investigate and analyze this possible extension. Specifically, exploiting a class of Schalkwijk‐Kailath linear feedback codes, we obtain an achievable rate region for 3‐user Gaussian MAC with full feedback and also a capacity outer bound. Then the results are extended for a case where there is no feedback link for one user, and the corresponding achievable rate region and capacity outer bound are computed. Furthermore, the gap between the derived rates and the sum capacity of 3‐user Gaussian MAC with full and partial feedback is computed under special assumptions.     

On the achievable throughput of a multiantenna Gaussian broadcast channel

A Gaussian broadcast channel (GBC) with r single-antenna receivers and t antennas at the transmitter is considered. Both transmitter and receivers have perfect knowledge of the channel. Despite its apparent simplicity, this model is, in general, a nondegraded broadcast channel (BC), for which the capacity region is not fully known. For the two-user case, we find a special case of Marton's (1979) region that achieves optimal sum-rate (throughput). In brief, the transmitter decomposes the channel into two interference channels, where interference is caused by the other user signal. Users are successively encoded, such that encoding of the second user is based on the noncausal knowledge of the interference caused by the first user. The crosstalk parameters are optimized such that the overall throughput is maximum and, surprisingly, this is shown to be optimal over all possible strategies (not only with respect to Marton's achievable region). For the case of r>2 users, we find a somewhat simpler choice of Marton's region based on ordering and successively encoding the users. For each user i in the given ordering, the interference caused by users j>i is eliminated by zero forcing at the transmitter, while interference caused by users j相似文献   

A rate-splitting approach to the Gaussian multiple-access channel

It is shown that any point in the capacity region of a Gaussian multiple-access channel is achievable by single-user coding without requiring synchronization among users, provided that each user “splits” data and signal into two parts. Based on this result, a new multiple-access technique called rate-splitting multiple accessing (RSMA) is proposed. RSMA is a code-division multiple-access scheme for the M-user Gaussian multiple-access channel for which the effort of finding the codes for the M users, of encoding, and of decoding is that of at most 2M-1 independent point-to-point Gaussian channels. The effects of bursty sources, multipath fading, and inter-cell interference are discussed and directions for further research are indicated     

A Stackelberg game for relay selection and power allocation in an active cooperative model involving primary users and secondary users

In recent years, cooperative communications have been widely used to improve the spectrum efficiency in cognitive radio networks. In this paper, we propose a new cooperative model involving primary and secondary users, where a primary transmitter may select a number of the secondary users to act as relays in order to maximize its data rate and to transmit at lower energy level, thereby saving energy and reducing interference at the secondary base station. The cooperative transmission is a multiple two‐hop relaying scheme, which guarantees an achievable data rate exceeding that in the direct transmission. In the proposed approach, the problem of joint relay selection and power allocation is formulated as a Stackelberg game, which converges to a unique optimal Nash equilibrium. Performance evaluation shows that this model offers benefit to both sides, where the primary users achieve higher data rate at lower energy consumption and the signal to interference plus noise ratio at the secondary base station is increased significantly. In addition, the results show that the proposed solution outperforms the investigated models in terms of achievable data rate.     

Design of Distributed Beamforming for Dual‐Hop Multiple‐Access Relay Networks

This paper studies a dual‐hop multiple‐access relay network where two independent source nodes transmit information to a common destination node with the aid of multiple single‐antenna amplify‐and‐forward relays. Each relay node is subject to an individual power constraint. We focus on the design of distributed beamforming schemes for the relays to support the transmission rate requirements of the two sources. To this end, we first characterize the achievable rate region for this network via solving a sequence of corner point optimization problems proposed in this paper. We also develop several low‐complexity suboptimal schemes in closed form. Two inner bounds of the achievable rate region are theoretically shown to be approximately optimal in two special scenarios. Finally, numerical results demonstrate the effectiveness of our proposed approaches.     

On the capacity of the single source multiple relay single destination mesh network

In this paper, we derive the information theoretic capacity of a special class of mesh networks. A mesh network is a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same wireless medium. We investigate the mesh network when there is one source, one destination, and multiple relays, which we call the single source multiple relay single destination (SSMRSD) mesh network. We derive the asymptotic capacity of the SSMRSD mesh network when the relay powers grow to infinity. Our approach is as follows. We first look at an upper bound on the information theoretic capacity of these networks in a Gaussian setting. We then show that this bound is achievable asymptotically using the compress-and-forward strategy for the multiple relay channel. We also perform numerical computations for the case when the relays have finite powers. We observe that even when the relay power is only a few times larger than the source power, the compress-and-forward rate gets close to the capacity. The results indicate the value of cooperation in wireless mesh networks. The capacity characterization quantifies how the relays can cooperate, using the compress-and-forward strategy, to either conserve node energy or to increase transmission rate.     

On the performance of two‐way relay channels using space–time codes

In this paper, we explore the advantages of network coding and space–time coding in improving the performance of two‐way‐relayed communications where two terminals absent of direct links exchange information through a single relay in between. Network coding allows embracing the interference from other terminals thereby turning it into a capacity boost. The application of space–time codes yields higher capacity by exploiting the spatial diversity. The joint performance of both techniques is studied in this paper. Specifically, we consider the class of decode‐and‐forward (DF) relaying strategy, evaluated in terms of symbol error rate using BPSK and QPSK modulations by both theoretical analysis and simulation. Based on our results, DF outperforms the amplify‐and‐decode and partial‐decode‐and‐forward protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

带有广义反馈的多址接入中继信道的可达速率区域的研究

多址接入中继信道是含有多个接入节点、1个中继节点和1个目的接收节点的无线多用户信道,同时考虑接入节点之间能够接收彼此含噪的广义反馈信息,此种模型存在于接入节点之间协作通信能力较差的多跳无线网络和无线传感器网络。论文给出了带有此种广义反馈的离散无记忆多址接入中继信道的可达速率区域,并将这一结果推广到高斯信道。提出一个新的编码方案,主要基于速率划分和译码前传策略,并通过采用分组Markov叠加编码建立各接入源节点之间以及源节点和中继节点之间的协作通信,在可达性证明中还采用规则编码和反向译码策略。结果表明,在离散无记忆信道环境下可达速率区域相比较以往结果更具一般性,在高斯信道环境下可达速率区域被扩展。     

非对称双向中继系统中的协作多址广播传输方案设计与数据率性能分析

在双向中继系统中,2个节点通过一个半双工中继交换信息,2个方向的数据率都会受到较差链路的制约。当节点位置变化或信道衰落造成,中继两端的信道质量不对称时,这将导致系统的和数据率下降。为了弥补较差链路带来的数据率损失,提出了一种新的三时隙协作多址广播传输方案,使得信道质量较好的源节点与中继节点进行协作传输,并且各节点充分利用各链路所支持的最大数据率进行传输,从而有效提高系统容量及加权和数据率。推导出新方案的容量上界以及解码转发模式下的可达数据率域,并对时隙及功率等资源进行优化分配。仿真结果表明,在加性白高斯和瑞利衰落信道下,新方案在非对称信道下的性能都大大优于已有方案。     

Dynamic Channel Assignment with Flexible Reuse Partitioning in Cellular Systems

In cellular communications, one of the main research issues is how to achieve optimum system capacity with limited frequency spectrum. For many years, researchers have proposed and studied many dynamic channel assignment (DCA) schemes to increase the capacity of cellular systems. Another proposed technique, Reuse Partitioning (RP), is used to achieve higher capacity by reducing the overall reuse distance. In convention, when RP is exploited in network-based DCA, a portion of channels will be assigned permanently to each partitioned region. However, the number of channels assigned to each region may not be~optimum due to factors like the uneven and time-varying traffics. In this paper, a new network-based DCA scheme is proposed with the flexible use of RP technique, named as flexible dynamic reuse partitioning with interference information (FDRP-WI). In this scheme, channels are open to all incoming calls and no channel pre-allocation for each region is required. As long as the channel assignment satisfies the co-channel interference constraints, any user from any region can use any channel. The scheme aims to minimize the effect of assigned channels on the availability of channels for use in the interfering cells and to reduce overall reuse distance. Both FDRP-WI with stationary users and mobile users are investigated. Simulation results have confirmed the effectiveness of FDRP-WI scheme. In the case with stationary users, FDRP-WI exhibits outstanding performance in improving the system capacity under both uniform and non-uniform traffic distributions. Under the uniform traffic case, the scheme can provide over 100% capacity improvement as compared to conventional fixed channel assignment scheme with 70 system channels at 1% blocking probability. In the case with mobile users, the impact of mobility on the new call probability, P _b, and the call dropping probability, P _d, is evaluated. The effect on system capacity of reserving some channels for handoff calls is first studied. Then, we propose a new handoff scheme, called “Reverse Overflow” (RO), to improve the utilization of channels with smaller reuse distances under mobile environment. Simulation results show that, with RO handoff, the system capacity of FDRP-WI is effectively improved at the expense of higher handoff rates in the cellular system.