Leila Musavian

Capacity and power allocation for spectrum-sharing communications in fading channels

This paper investigates the fundamental capacity limits of opportunistic spectrum-sharing channels in fading environments. The concept of opportunistic spectrum access is motivated by the frontier technology of cognitive radio which offers a tremendous potential to improve the utilization of the radio spectrum by implementing efficient sharing of the licensed spectrum. In this spectrum-sharing technology, a secondary user may utilize the primary users licensed band as long as its interference to the primary receiver remains below a tolerable level. Herein, we consider that the secondary users transmission has to adhere to limitations on the ensuing received power at the primarys receiver, and investigate the capacity gains offered by this spectrum-sharing approach in a Rayleigh fading environment. Specifically, we derive the fading channel capacity of a secondary user subject to both average and peak received-power constraints at the primarys receiver. In particular, considering flat Rayleigh fading, we derive the capacity and optimum power allocation scheme for three different capacity notions, namely, ergodic, outage, and minimum-rate, and provide closed-form expressions for these capacity metrics. Numerical simulations are conducted to corroborate our theoretical results.

Fundamental capacity limits of cognitive radio in fading environments with imperfect channel information

In this paper, we analyze the capacity gains of opportunistic spectrum-sharing channels in fading environments with imperfect channel information. In particular, we consider that a secondary user may access the spectrum allocated to a primary user as long as the interference power, inflicted at the primars receiver as an effect of the transmission of the secondary user, remains below predefined power limits, average or peak, and investigate the capacity gains offered by this spectrum-sharing approach when only partial channel information of the link between the secondaryiquests transmitter and primarys receiver is available to the secondary user. Considering average received-power constraint, we derive the ergodic and outage capacities along with their optimum power allocation policies for Rayleigh flat-fading channels, and provide closedform expressions for these capacity metrics. We further assume that the interference power inflicted on the primaryiquests receiver should remain below a peak threshold. Introducing the concept of interference-outage, we derive lower bounds on the ergodic and outage capacities of the channel. In addition, we obtain closedform expressions for the expenditure-power required at the secondary transmitter to achieve the above-mentioned capacity metrics. Numerical simulations are conducted to corroborate our theoretical results.

Effective capacity for interference and delay constrained cognitive radio relay channels

This paper investigates delay constrained performance of a cognitive radio relay network when the cognitive (secondary) user transmission is subject to satisfying spectrum-sharing restrictions imposed by a primary user. The primary user allows a secondary user to gain access to its allocated spectrum band as long as certain thresholds on the interference power, on the peak or average values, inflicted on the primary receiver are not exceeded by the transmission of the secondary users. In addition, we assume that the secondary transmitter benefits from an intermediate node, chosen from K terminals, to relay its signal to the destination. Considering that the transmission of the secondary user is subject to satisfying a statistical delay quality-of-service (QoS) constraint, we study the maximum arrival rate of the secondary users relay link while the interference limitations required by the primary user are satisfied. Particularly, we obtain the effective capacity of the secondary network and determine the power allocation policies that maximize the effective capacity of the secondary users relaying channel. In addition, we derive closed-form expressions for the effective capacity of the channel in Rayleigh block-fading environment under peak or average interference-power constraints. Numerical simulations are provided to endorse our theoretical results.

Ergodic and Outage Capacities of Spectrum-Sharing Systems in Fading Channels

In this fast growing technology world, where communications play a major rule for connecting people and machines together, the growth in wireless applications have caused an increasing demand for gaining access to the radio spectrum. However, the outdated spectrum utilization policies, imposed by the regulatory bodies in the past century, have caused the spectrum to look over-saturated. Recently, the concept of opportunistic spectrum access has been introduced as a tool to overcome the scarcity of the spectrum. The latter technology offers a tremendous potential to improve the utilization of the radio spectrum by implementing an efficient sharing of the licensed spectrum, whereby a secondary user may utilize the primary users licensed band as long as its interference to the primary receiver remains below a tolerable level. In this paper, we investigate the capacity gains offered by this spectrum-sharing approach in Rayleigh fading environments. In particular, we derive the fading channel capacity of a secondary user subject to both average and peak received-power constraints at the primarys receiver. Considering both constraints, we derive the ergodic and outage capacities along with their optimum power allocation policies for Rayleigh flat-fading channel, and provide closed-form expressions for these capacity metrics. Furthermore, numerical simulations are conducted to corroborate our theoretical results.

Effective capacity of delay-constrained cognitive radio in Nakagami fading channels

In this paper, we consider coexistence of secondary and primary users who share particular portions of the spectrum and propose a delay-constrained power and rate allocation scheme for the secondary user link. Secondary users are allowed to access the spectrum occupied by a primary user subject to satisfying interference-power limitations imposed by the primary user. Applying this limitation, we obtain the maximum arrival-rate supported by the secondary channel in Nakagami-m block-fading environment subject to satisfying a given statistical delay quality-of-service (QoS) constraint. In this respect, we derive the optimal rate and power adaptation policy that maximizes the effective capacity of the channel, and provide closed-form expressions for the power allocation and the effective capacity. In addition, we obtain closed-form expressions for the expenditure-power that is required at the secondary transmitter to achieve the above-mentioned capacity metric. Moreover, for comparison purposes, we consider two widely deployed power allocation strategies, namely, optimal power and rate allocation (opra) and channel inversion with fixed rate (cifr), and investigate the effective capacity of the channel under these power transmission techniques. Numerical simulations are conducted to corroborate our theoretical results.

Effect of Channel Uncertainty on the Mutual Information of MIMO Fading Channels

In this paper, we study the effect of channel estimation error at the receiver on the mutual information of a multiple-input-multiple-output (MIMO) channel obeying correlated Rayleigh fading. We assume that perfect knowledge of the channel correlation is available at the receiver and find upper and lower bounds on the mutual information for Gaussian input signals. We prove that for a generic input covariance matrix, the gap between these two bounds at high transmit powers does not exceed a certain value, which depends on the number of nonzero eigenvalues of the receive correlation matrix. We also show that in a system with uncorrelated transmit antennas and correlated receive antennas and with uniform power distribution over the transmit antennas, these bounds are asymptotically tight for a large number of transmit antennas. We show that when the correlation information is available at the transmitter, the transmitting strategy that maximizes the mutual information lower bound is to transmit toward the directions of the eigenvectors of the transmit correlation matrix. We further derive upper and lower bounds on the mutual information of a MIMO multiple-access channel with imperfect channel estimation at the receiver. We also prove that when the input power at each user is uniformly distributed over its transmit antennas, the bounds on the mutual information are asymptotically tight for Gaussian input signals, and this tightness increases when the number of users increases. Numerical simulations are conducted to corroborate theoretical results.

SINR Balancing Technique for Downlink Beamforming in Cognitive Radio Networks

We propose a novel signal to interference and noise (SINR) balancing technique for a downlink cognitive radio network (CRN) wherein multiple cognitive users (also referred to as secondary users (SUs)) coexist and share the licensed spectrum with the primary users (PUs) using the underlay approach. The proposed beamforming technique maximizes the worst SU SINR while ensuring that the interference leakage to PUs is below specific thresholds. Due to the additional interference constraints imposed by PUs, the principle of uplink-downlink duality used in the conventional downlink beamformer design cannot be directly applied anymore. To circumvent this problem, using an algebraic manipulation on the interference constraints, we propose a novel SINR balancing technique for CRNs based on uplink-downlink iterative design techniques. Simulation results illustrate the convergence and the optimality of the proposed beamformer design.

Closed-form capacity expressions of orthogonalized correlated MIMO channels

Space-time block codes are known to orthogonalize the multiple-input multiple-output (MIMO) wireless channel, thus reducing the space-time vector detection to a simpler scalar detection problem. The capacity over orthogonalized ergodic correlated Rayleigh and Ricean flat-fading MIMO channels has so far only been given in integral form. This letter derives a closed form capacity expression over such channels, hence avoiding numerical integrations or Monte Carlo simulations.

Cross-Layer Analysis of Cognitive Radio Relay Networks under Quality of Service Constraints

In this paper, we investigate the performance gains of cognitive radio relay networks under delay quality of service (QoS) limitations at the secondary users, and spectrum-sharing restrictions imposed by the primary users of the channel. In particular, we assume that the primary user allows secondary users to gain access to its allocated spectrum band as long as a certain threshold on its corresponding outage probability is satisfied. Using this constraint, we find the maximum limit on the interference-power inflicted on the primary receiver that should not be exceeded by the transmission of the secondary users. In addition, we assume that the secondary transmitter benefits from an intermediate node, chosen from K terminals, to relay its signal to the destination. Considering that the transmission of the secondary user is subject to satisfying a statistical delay QoS constraint, we obtain the maximum arrival-rate supported by the secondary users relaying link. In this respect, we derive closed-form expressions for the effective capacity of the channel in Rayleigh block-fading environment. Numerical simulations are provided to endorse our theoretical results.

Joint Beamforming and User Maximization Techniques for Cognitive Radio Networks Based on Branch and Bound Method

We consider a network of cognitive users (also referred to as secondary users (SUs)) coexisting and sharing the spectrum with primary users (PUs) in an underlay cognitive radio network (CRN). Specifically, we consider a CRN wherein the number of SUs requesting channel access exceeds the number of available frequency bands and spatial modes. In such a setting, we propose a joint fast optimal resource allocation and beamforming algorithm to accommodate maximum possible number of SUs while satisfying quality of service (QoS) requirement for each admitted SU, transmit power limitation at the secondary network basestation (SNBS) and interference constraints imposed by the PUs. Recognizing that the original user maximization problem is a nondeterministic polynomial-time hard (NP), we use a mixed-integer programming framework to formulate the joint user maximization and beamforming problem. Subsequently, an optimal algorithm based on branch and bound (BnB) method has been proposed. In addition, we propose a suboptimal algorithm based on BnB method to reduce the complexity of the proposed algorithm. Specifically, the suboptimal algorithm has been developed based on the first feasible solution it achieves in the fast optimal BnB method. Simulation results have been provided to compare the performance of the optimal and suboptimal algorithms.