3,319 research outputs found

    Cognitive Orthogonal Precoder for Two-tiered Networks Deployment

    Full text link
    In this work, the problem of cross-tier interference in a two-tiered (macro-cell and cognitive small-cells) network, under the complete spectrum sharing paradigm, is studied. A new orthogonal precoder transmit scheme for the small base stations, called multi-user Vandermonde-subspace frequency division multiplexing (MU-VFDM), is proposed. MU-VFDM allows several cognitive small base stations to coexist with legacy macro-cell receivers, by nulling the small- to macro-cell cross-tier interference, without any cooperation between the two tiers. This cleverly designed cascaded precoder structure, not only cancels the cross-tier interference, but avoids the co-tier interference for the small-cell network. The achievable sum-rate of the small-cell network, satisfying the interference cancelation requirements, is evaluated for perfect and imperfect channel state information at the transmitter. Simulation results for the cascaded MU-VFDM precoder show a comparable performance to that of state-of-the-art dirty paper coding technique, for the case of a dense cellular layout. Finally, a comparison between MU-VFDM and a standard complete spectrum separation strategy is proposed. Promising gains in terms of achievable sum-rate are shown for the two-tiered network w.r.t. the traditional bandwidth management approach.Comment: 11 pages, 9 figures, accepted and to appear in IEEE Journal on Selected Areas in Communications: Cognitive Radio Series, 2013. Copyright transferred to IEE

    Cognitive Wyner Networks with Clustered Decoding

    Full text link
    We study an interference network where equally-numbered transmitters and receivers lie on two parallel lines, each transmitter opposite its intended receiver. We consider two short-range interference models: the "asymmetric network," where the signal sent by each transmitter is interfered only by the signal sent by its left neighbor (if present), and a "symmetric network," where it is interfered by both its left and its right neighbors. Each transmitter is cognizant of its own message, the messages of the tℓt_\ell transmitters to its left, and the messages of the trt_r transmitters to its right. Each receiver decodes its message based on the signals received at its own antenna, at the rℓr_\ell receive antennas to its left, and the rrr_r receive antennas to its right. For such networks we provide upper and lower bounds on the multiplexing gain, i.e., on the high-SNR asymptotic logarithmic growth of the sum-rate capacity. In some cases our bounds meet, e.g., for the asymmetric network. Our results exhibit an equivalence between the transmitter side-information parameters tℓ,trt_\ell, t_r and the receiver side-information parameters rℓ,rrr_\ell, r_r in the sense that increasing/decreasing tℓt_\ell or trt_r by a positive integer δ\delta has the same effect on the multiplexing gain as increasing/decreasing rℓr_\ell or rrr_r by δ\delta. Moreover---even in asymmetric networks---there is an equivalence between the left side-information parameters tℓ,rℓt_\ell, r_\ell and the right side-information parameters tr,rrt_r, r_r.Comment: Second revision submitted to IEEE Transactions on Information Theor

    Overhead-Aware Distributed CSI Selection in the MIMO Interference Channel

    Full text link
    We consider a MIMO interference channel in which the transmitters and receivers operate in frequency-division duplex mode. In this setting, interference management through coordinated transceiver design necessitates channel state information at the transmitters (CSI-T). The acquisition of CSI-T is done through feedback from the receivers, which entitles a loss in degrees of freedom, due to training and feedback. This loss increases with the amount of CSI-T. In this work, after formulating an overhead model for CSI acquisition at the transmitters, we propose a distributed mechanism to find for each transmitter a subset of the complete CSI, which is used to perform interference management. The mechanism is based on many-to-many stable matching. We prove the existence of a stable matching and exploit an algorithm to reach it. Simulation results show performance improvement compared to full and minimal CSI-T.Comment: 5 pages, 2 figures. to appear at EUSIPCO 2015, Special Session on Algorithms for Distributed Coordination and Learnin

    A digital interface for Gaussian relay and interference networks: Lifting codes from the discrete superposition model

    Full text link
    For every Gaussian network, there exists a corresponding deterministic network called the discrete superposition network. We show that this discrete superposition network provides a near-optimal digital interface for operating a class consisting of many Gaussian networks in the sense that any code for the discrete superposition network can be naturally lifted to a corresponding code for the Gaussian network, while achieving a rate that is no more than a constant number of bits lesser than the rate it achieves for the discrete superposition network. This constant depends only on the number of nodes in the network and not on the channel gains or SNR. Moreover the capacities of the two networks are within a constant of each other, again independent of channel gains and SNR. We show that the class of Gaussian networks for which this interface property holds includes relay networks with a single source-destination pair, interference networks, multicast networks, and the counterparts of these networks with multiple transmit and receive antennas. The code for the Gaussian relay network can be obtained from any code for the discrete superposition network simply by pruning it. This lifting scheme establishes that the superposition model can indeed potentially serve as a strong surrogate for designing codes for Gaussian relay networks. We present similar results for the K x K Gaussian interference network, MIMO Gaussian interference networks, MIMO Gaussian relay networks, and multicast networks, with the constant gap depending additionally on the number of antennas in case of MIMO networks.Comment: Final versio

    Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

    Full text link
    This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical-layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical-layer message authentication is also introduced briefly. The survey concludes with observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials, 201

    Downlink Noncoherent Cooperation without Transmitter Phase Alignment

    Full text link
    Multicell joint processing can mitigate inter-cell interference and thereby increase the spectral efficiency of cellular systems. Most previous work has assumed phase-aligned (coherent) transmissions from different base transceiver stations (BTSs), which is difficult to achieve in practice. In this work, a noncoherent cooperative transmission scheme for the downlink is studied, which does not require phase alignment. The focus is on jointly serving two users in adjacent cells sharing the same resource block. The two BTSs partially share their messages through a backhaul link, and each BTS transmits a superposition of two codewords, one for each receiver. Each receiver decodes its own message, and treats the signals for the other receiver as background noise. With narrowband transmissions the achievable rate region and maximum achievable weighted sum rate are characterized by optimizing the power allocation (and the beamforming vectors in the case of multiple transmit antennas) at each BTS between its two codewords. For a wideband (multicarrier) system, a dual formulation of the optimal power allocation problem across sub-carriers is presented, which can be efficiently solved by numerical methods. Results show that the proposed cooperation scheme can improve the sum rate substantially in the low to moderate signal-to-noise ratio (SNR) range.Comment: 30 pages, 6 figures, submitted to IEEE Transactions on Wireless Communication

    Cellular Interference Alignment

    Full text link
    Interference alignment promises that, in Gaussian interference channels, each link can support half of a degree of freedom (DoF) per pair of transmit-receive antennas. However, in general, this result requires to precode the data bearing signals over a signal space of asymptotically large diversity, e.g., over an infinite number of dimensions for time-frequency varying fading channels, or over an infinite number of rationally independent signal levels, in the case of time-frequency invariant channels. In this work we consider a wireless cellular system scenario where the promised optimal DoFs are achieved with linear precoding in one-shot (i.e., over a single time-frequency slot). We focus on the uplink of a symmetric cellular system, where each cell is split into three sectors with orthogonal intra-sector multiple access. In our model, interference is "local", i.e., it is due to transmitters in neighboring cells only. We consider a message-passing backhaul network architecture, in which nearby sectors can exchange already decoded messages and propose an alignment solution that can achieve the optimal DoFs. To avoid signaling schemes relying on the strength of interference, we further introduce the notion of \emph{topologically robust} schemes, which are able to guarantee a minimum rate (or DoFs) irrespectively of the strength of the interfering links. Towards this end, we design an alignment scheme which is topologically robust and still achieves the same optimum DoFs
    • …
    corecore