61,916 research outputs found

    Multi-Cell Random Beamforming: Achievable Rate and Degrees of Freedom Region

    Full text link
    Random beamforming (RBF) is a practically favourable transmission scheme for multiuser multi-antenna downlink systems since it requires only partial channel state information (CSI) at the transmitter. Under the conventional single-cell setup, RBF is known to achieve the optimal sum-capacity scaling law as the number of users goes to infinity, thanks to the multiuser diversity enabled transmission scheduling that virtually eliminates the intra-cell interference. In this paper, we extend the study of RBF to a more practical multi-cell downlink system with single-antenna receivers subject to the additional inter-cell interference (ICI). First, we consider the case of finite signal-to-noise ratio (SNR) at each receiver. We derive a closed-form expression of the achievable sum-rate with the multi-cell RBF, based upon which we show an asymptotic sum-rate scaling law as the number of users goes to infinity. Next, we consider the high-SNR regime and for tractable analysis assume that the number of users in each cell scales in a certain order with the per-cell SNR. Under this setup, we characterize the achievable degrees of freedom (DoF) for the single-cell case with RBF. Then we extend the analysis to the multi-cell RBF case by characterizing the DoF region. It is shown that the DoF region characterization provides useful guideline on how to design a cooperative multi-cell RBF system to achieve optimal throughput tradeoffs among different cells. Furthermore, our results reveal that the multi-cell RBF scheme achieves the "interference-free DoF" region upper bound for the multi-cell system, provided that the per-cell number of users has a sufficiently large scaling order with the SNR. Our result thus confirms the optimality of multi-cell RBF in this regime even without the complete CSI at the transmitter, as compared to other full-CSI requiring transmission schemes such as interference alignment.Comment: 28 pages, 6 figures, to appear in IEEE Transactions of Signal Processing. This work was presented in part at IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Kyoto, Japan, March 25-30, 2012. The authors are with the Department of Electrical and Computer Engineering, National University of Singapore (emails: {hieudn, elezhang, elehht}@nus.edu.sg

    Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme

    Full text link
    In a slow fading channel, how to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decode-and-forward (DF) schemes do not improve with the number of relays in terms of the diversity multiplexing tradeoff (DMT) for multiplexing gains r higher than 0.5. In this work, we study the class of slotted amplify-and-forward (SAF) schemes. We first establish an upper bound on the DMT for any SAF scheme with an arbitrary number of relays N and number of slots M. Then, we propose a sequential SAF scheme that can exploit the potential diversity gain in the high multiplexing gain regime. More precisely, in certain conditions, the sequential SAF scheme achieves the proposed DMT upper bound which tends to the transmit diversity bound when M goes to infinity. In particular, for the two-relay case, the three-slot sequential SAF scheme achieves the proposed upper bound and outperforms the two-relay non-orthorgonal amplify-and-forward (NAF) scheme of Azarian et al. for multiplexing gains r < 2/3. Numerical results reveal a significant gain of our scheme over the previously proposed AF schemes, especially in high spectral efficiency and large network size regime.Comment: 30 pages, 11 figures, submitted to IEEE trans. IT, revised versio

    Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks

    Full text link
    In this paper, we consider a cognitive radio network that consists of one cognitive base station (CBS) and multiple cognitive users (CUs) in the presence of multiple eavesdroppers, where CUs transmit their data packets to CBS under a primary user's quality of service (QoS) constraint while the eavesdroppers attempt to intercept the cognitive transmissions from CUs to CBS. We investigate the physical-layer security against eavesdropping attacks in the cognitive radio network and propose the user scheduling scheme to achieve multiuser diversity for improving the security level of cognitive transmissions with a primary QoS constraint. Specifically, a cognitive user (CU) that satisfies the primary QoS requirement and maximizes the achievable secrecy rate of cognitive transmissions is scheduled to transmit its data packet. For the comparison purpose, we also examine the traditional multiuser scheduling and the artificial noise schemes. We analyze the achievable secrecy rate and intercept probability of the traditional and proposed multiuser scheduling schemes as well as the artificial noise scheme in Rayleigh fading environments. Numerical results show that given a primary QoS constraint, the proposed multiuser scheduling scheme generally outperforms the traditional multiuser scheduling and the artificial noise schemes in terms of the achievable secrecy rate and intercept probability. In addition, we derive the diversity order of the proposed multiuser scheduling scheme through an asymptotic intercept probability analysis and prove that the full diversity is obtained by using the proposed multiuser scheduling.Comment: 12 pages. IEEE Transactions on Communications, 201

    Exploiting Interference Alignment in Multi-Cell Cooperative OFDMA Resource Allocation

    Full text link
    This paper studies interference alignment (IA) based multi-cell cooperative resource allocation for the downlink OFDMA with universal frequency reuse. Unlike the traditional scheme that treats subcarriers as separate dimensions for resource allocation, the IA technique is utilized to enable frequency-domain precoding over parallel subcarriers. In this paper, the joint optimization of frequency-domain precoding via IA, subcarrier user selection and power allocation is investigated for a cooperative three-cell OFDMA system to maximize the downlink throughput. Numerical results for a simplified symmetric channel setup reveal that the IA-based scheme achieves notable throughput gains over the traditional scheme only when the inter-cell interference link has a comparable strength as the direct link, and the receiver SNR is sufficiently large. Motivated by this observation, a practical hybrid scheme is proposed for cellular systems with heterogenous channel conditions, where the total spectrum is divided into two subbands, over which the IAbased scheme and the traditional scheme are applied for resource allocation to users located in the cell-intersection region and cellnon- intersection region, respectively. It is shown that this hybrid resource allocation scheme flexibly exploits the downlink IA gains for OFDMA-based cellular systems.Comment: 5 pages, 5 figures, GC2011 conferenc

    Outage Efficient Strategies for Network MIMO with Partial CSIT

    Full text link
    We consider a multi-cell MIMO downlink (network MIMO) where BB base-stations (BS) with MM antennas connected to a central station (CS) serve KK single-antenna user terminals (UT). Although many works have shown the potential benefits of network MIMO, the conclusion critically depends on the underlying assumptions such as channel state information at transmitters (CSIT) and backhaul links. In this paper, by focusing on the impact of partial CSIT, we propose an outage-efficient strategy. Namely, with side information of all UT's messages and local CSIT, each BS applies zero-forcing (ZF) beamforming in a distributed manner. For a small number of UTs (KMK\leq M), the ZF beamforming creates KK parallel MISO channels. Based on the statistical knowledge of these parallel channels, the CS performs a robust power allocation that simultaneously minimizes the outage probability of all UTs and achieves a diversity gain of B(MK+1)B(M-K+1) per UT. With a large number of UTs (KMK \geq M), we propose a so-called distributed diversity scheduling (DDS) scheme to select a subset of \Ks UTs with limited backhaul communication. It is proved that DDS achieves a diversity gain of B\frac{K}{\Ks}(M-\Ks+1), which scales optimally with the number of cooperative BSs BB as well as UTs. Numerical results confirm that even under realistic assumptions such as partial CSIT and limited backhaul communications, network MIMO can offer high data rates with a sufficient reliability to individual UTs.Comment: 26 pages, 8 figures, submitted to IEEE Trans. on Signal Processin
    corecore