257 research outputs found

    Robust Lattice Alignment for K-user MIMO Interference Channels with Imperfect Channel Knowledge

    Full text link
    In this paper, we consider a robust lattice alignment design for K-user quasi-static MIMO interference channels with imperfect channel knowledge. With random Gaussian inputs, the conventional interference alignment (IA) method has the feasibility problem when the channel is quasi-static. On the other hand, structured lattices can create structured interference as opposed to the random interference caused by random Gaussian symbols. The structured interference space can be exploited to transmit the desired signals over the gaps. However, the existing alignment methods on the lattice codes for quasi-static channels either require infinite SNR or symmetric interference channel coefficients. Furthermore, perfect channel state information (CSI) is required for these alignment methods, which is difficult to achieve in practice. In this paper, we propose a robust lattice alignment method for quasi-static MIMO interference channels with imperfect CSI at all SNR regimes, and a two-stage decoding algorithm to decode the desired signal from the structured interference space. We derive the achievable data rate based on the proposed robust lattice alignment method, where the design of the precoders, decorrelators, scaling coefficients and interference quantization coefficients is jointly formulated as a mixed integer and continuous optimization problem. The effect of imperfect CSI is also accommodated in the optimization formulation, and hence the derived solution is robust to imperfect CSI. We also design a low complex iterative optimization algorithm for our robust lattice alignment method by using the existing iterative IA algorithm that was designed for the conventional IA method. Numerical results verify the advantages of the proposed robust lattice alignment method

    Interference Alignment for Cognitive Radio Communications and Networks: A Survey

    Get PDF
    © 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).Interference alignment (IA) is an innovative wireless transmission strategy that has shown to be a promising technique for achieving optimal capacity scaling of a multiuser interference channel at asymptotically high-signal-to-noise ratio (SNR). Transmitters exploit the availability of multiple signaling dimensions in order to align their mutual interference at the receivers. Most of the research has focused on developing algorithms for determining alignment solutions as well as proving interference alignment’s theoretical ability to achieve the maximum degrees of freedom in a wireless network. Cognitive radio, on the other hand, is a technique used to improve the utilization of the radio spectrum by opportunistically sensing and accessing unused licensed frequency spectrum, without causing harmful interference to the licensed users. With the increased deployment of wireless services, the possibility of detecting unused frequency spectrum becomes diminished. Thus, the concept of introducing interference alignment in cognitive radio has become a very attractive proposition. This paper provides a survey of the implementation of IA in cognitive radio under the main research paradigms, along with a summary and analysis of results under each system model.Peer reviewe

    Distributed probabilistic-data-association-based soft reception employing base station cooperation in MIMO-aided multiuser multicell systems

    No full text
    Intercell cochannel interference (CCI) mitigation is investigated in the context of cellular systems relying on dense frequency reuse (FR). A distributed base-station (BS)-cooperation-aided soft reception scheme using the probabilistic data association (PDA) algorithm and soft combining (SC) is proposed for the uplink of multiuser multicell MIMO systems. The realistic 19-cell hexagonal cellular model relying on unity FR is considered, where both the BSs and the mobile stations (MSs) are equipped with multiple antennas. Local-cooperation-based message passing is used, instead of a global message passing chain for the sake of reducing the backhaul traffic. The PDA algorithm is employed as a low-complexity solution for producing soft information, which facilitates the employment of SC at the individual BSs to generate the final soft decision metric. Our simulations and analysis demonstrate that, despite its low additional complexity and backhaul traffic, the proposed distributed PDA-aided SC (DPDA-SC) reception scheme significantly outperforms the conventional noncooperative benchmarkers. Furthermore, since only the index of the possible discrete value of the quantized converged soft information has to be exchanged for SC in practice, the proposed DPDA-SC scheme is relatively robust to the quantization errors of the soft information exchanged. As a beneficial result, the backhaul traffic is dramatically reduced at negligible performance degradation

    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

    Integer Forcing-and-Forward Transceiver Design for MIMO Multi-Pair Two-Way Relaying

    Full text link
    In this paper, we propose a new transmission scheme, named as Integer Forcing-and-Forward (IFF), for communications among multi-pair multiple-antenna users in which each pair exchanges their messages with the help of a single multi antennas relay in the multiple-access and broadcast phases. The proposed scheme utilizes Integer Forcing Linear Receiver (IFLR) at relay, which uses equations, i.e., linear integer-combinations of messages, to harness the intra-pair interference. Accordingly, we propose the design of mean squared error (MSE) based transceiver, including precoder and projection matrices for the relay and users, assuming that the perfect channel state information (CSI) is available. In this regards, in the multiple-access phase, we introduce two new MSE criteria for the related precoding and filter designs, i.e., the sum of the equations MSE (Sum-Equation MSE) and the maximum of the equations MSE (Max-Equation MSE), to exploit the equations in the relay. In addition, the convergence of the proposed criteria is proven as well. Moreover, in the broadcast phase, we use the two traditional MSE criteria, i.e. the sum of the users' mean squred errors (Sum MSE) and the maximum of the users' mean squared errors (Max MSE), to design the related precoding and filters for recovering relay's equations by the users. Then, we consider a more practical scenario with imperfect CSI. For this case, IFLR receiver is modified, and another transceiver design is proposed, which take into account the effect of channels estimation error. We evaluate the performance of our proposed strategy and compare the results with the conventional amplify-and-forward (AF) and denoise-and-forward (DF) strategies for the same scenario. The results indicate the substantial superiority of the proposed strategy in terms of the outage probability and the sum rate.Comment: 30 pages, 7 figures, Submitted to a IEEE journa

    Elements of Cellular Blind Interference Alignment --- Aligned Frequency Reuse, Wireless Index Coding and Interference Diversity

    Full text link
    We explore degrees of freedom (DoF) characterizations of partially connected wireless networks, especially cellular networks, with no channel state information at the transmitters. Specifically, we introduce three fundamental elements --- aligned frequency reuse, wireless index coding and interference diversity --- through a series of examples, focusing first on infinite regular arrays, then on finite clusters with arbitrary connectivity and message sets, and finally on heterogeneous settings with asymmetric multiple antenna configurations. Aligned frequency reuse refers to the optimality of orthogonal resource allocations in many cases, but according to unconventional reuse patterns that are guided by interference alignment principles. Wireless index coding highlights both the intimate connection between the index coding problem and cellular blind interference alignment, as well as the added complexity inherent to wireless settings. Interference diversity refers to the observation that in a wireless network each receiver experiences a different set of interferers, and depending on the actions of its own set of interferers, the interference-free signal space at each receiver fluctuates differently from other receivers, creating opportunities for robust applications of blind interference alignment principles

    AirSync: Enabling Distributed Multiuser MIMO with Full Spatial Multiplexing

    Full text link
    The enormous success of advanced wireless devices is pushing the demand for higher wireless data rates. Denser spectrum reuse through the deployment of more access points per square mile has the potential to successfully meet the increasing demand for more bandwidth. In theory, the best approach to density increase is via distributed multiuser MIMO, where several access points are connected to a central server and operate as a large distributed multi-antenna access point, ensuring that all transmitted signal power serves the purpose of data transmission, rather than creating "interference." In practice, while enterprise networks offer a natural setup in which distributed MIMO might be possible, there are serious implementation difficulties, the primary one being the need to eliminate phase and timing offsets between the jointly coordinated access points. In this paper we propose AirSync, a novel scheme which provides not only time but also phase synchronization, thus enabling distributed MIMO with full spatial multiplexing gains. AirSync locks the phase of all access points using a common reference broadcasted over the air in conjunction with a Kalman filter which closely tracks the phase drift. We have implemented AirSync as a digital circuit in the FPGA of the WARP radio platform. Our experimental testbed, comprised of two access points and two clients, shows that AirSync is able to achieve phase synchronization within a few degrees, and allows the system to nearly achieve the theoretical optimal multiplexing gain. We also discuss MAC and higher layer aspects of a practical deployment. To the best of our knowledge, AirSync offers the first ever realization of the full multiuser MIMO gain, namely the ability to increase the number of wireless clients linearly with the number of jointly coordinated access points, without reducing the per client rate.Comment: Submitted to Transactions on Networkin
    corecore