6,069 research outputs found

    Coexistence Analysis between Radar and Cellular System in LoS Channel

    Full text link
    Sharing spectrum with incumbents such as radar systems is an attractive solution for cellular operators in order to meet the ever growing bandwidth requirements and ease the spectrum crunch problem. In order to realize efficient spectrum sharing, interference mitigation techniques are required. In this letter we address techniques to mitigate MIMO radar interference at MIMO cellular base stations (BSs). We specifically look at the amount of power received at BSs when radar uses null space projection (NSP)-based interference mitigation method. NSP reduces the amount of projected power at targets that are in-close vicinity to BSs. We study this issue and show that this can be avoided if radar employs a larger transmit array. In addition, we compute the coherence time of channel between radar and BSs and show that the coherence time of channel is much larger than the pulse repetition interval of radars. Therefore, NSP-based interference mitigation techniques which depends on accurate channel state information (CSI) can be effective as the problem of CSI being outdated does not occur for most practical scenarios.Comment: Corrected some typos and reference

    Performance analysis of joint precoding and MUD techniques in multibeam satellite systems

    Get PDF
    This paper considers interference mitigation techniques in the forward link of multibeam satellite systems. In contrast to previous works, either devoted to receiver interference mitigation (e.g. multiuser detection) or transmitter interference mitigation (precoding), this work evaluates the achievable rates of the joint combination of both techniques. On the one hand, precoding cannot properly mitigate all the inter- beam interference while maintaining a sufficiently high signal-to-noise ratio. On the other hand, the receiver cost and complexity exponentially increases with the number of signals to be simultaneously detected. This highlights that the receiver cannot deal with all the interferences so that in general only 2 signals are jointly detected. As a result, the use of precoding within a coverage area jointly with multiuser detection can both benefit from each other and extremely increase the achievable rates of the system. This is numerically evaluated in a close-to-real coverage area considering simultaneous non-unique decoding strategies. The results show the benefits of this joint scheme that eventually can increase the current precoding performance a 23%.Peer ReviewedPostprint (author's final draft

    Interference Mitigation in Large Random Wireless Networks

    Full text link
    A central problem in the operation of large wireless networks is how to deal with interference -- the unwanted signals being sent by transmitters that a receiver is not interested in. This thesis looks at ways of combating such interference. In Chapters 1 and 2, we outline the necessary information and communication theory background, including the concept of capacity. We also include an overview of a new set of schemes for dealing with interference known as interference alignment, paying special attention to a channel-state-based strategy called ergodic interference alignment. In Chapter 3, we consider the operation of large regular and random networks by treating interference as background noise. We consider the local performance of a single node, and the global performance of a very large network. In Chapter 4, we use ergodic interference alignment to derive the asymptotic sum-capacity of large random dense networks. These networks are derived from a physical model of node placement where signal strength decays over the distance between transmitters and receivers. (See also arXiv:1002.0235 and arXiv:0907.5165.) In Chapter 5, we look at methods of reducing the long time delays incurred by ergodic interference alignment. We analyse the tradeoff between reducing delay and lowering the communication rate. (See also arXiv:1004.0208.) In Chapter 6, we outline a problem that is equivalent to the problem of pooled group testing for defective items. We then present some new work that uses information theoretic techniques to attack group testing. We introduce for the first time the concept of the group testing channel, which allows for modelling of a wide range of statistical error models for testing. We derive new results on the number of tests required to accurately detect defective items, including when using sequential `adaptive' tests.Comment: PhD thesis, University of Bristol, 201

    Relays for Interference Mitigation in Wireless Networks

    Get PDF
    Wireless links play an important role in the last mile network connectivity. In contrast to the strictly centralized approach of today's wireless systems, the future promises decentralization of network management. Nodes potentially engage in localized grouping and organization based on their neighborhood to carry out complex goals such as end-to-end communication. The quadratic energy dissipation of the wireless medium necessitates the presence of certain relay nodes in the network. Conventionally, the role of such relays is limited to passing messages in a chain in a point-point hopping architecture. With the decentralization, multiple nodes could potentially interfere with each other. This work proposes a technique to exploit the presence of relays in a way that mitigates interference between the network nodes. Optimal spatial locations and transmission schemes which enhance this gain are identified

    Asymptotic Moments for Interference Mitigation in Correlated Fading Channels

    Full text link
    We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically tight deterministic approximations of their moments. This random matrix model arises in several wireless communication systems of recent interest, such as distributed antenna systems or large antenna arrays. Computing the linear minimum mean square error (LMMSE) detector in such systems requires the inversion of a large covariance matrix which becomes prohibitively complex as the number of antennas and users grows. We apply the derived moment results to the design of a low-complexity polynomial expansion detector which approximates the matrix inverse by a matrix polynomial and study its asymptotic performance. Simulation results corroborate the analysis and evaluate the performance for finite system dimensions.Comment: 7 pages, 2 figures, to be presented at IEEE International Symposium on Information Theory (ISIT), Saint Petersburg, Russia, July 31 - August 5, 201
    corecore