Interference Avoidance in Wireless Systems.pdf

Interference Avoidance in Wireless SystemsChristopher Rose, Sennur Ulukus Roy YatesMarch 29, 1999 WINLAB, Dept. of Electrical and Computer EngineeringRutgers University73 Brett RoadPiscataway NJ 08854-8060email: crose@ulukus@ryates@AbstractMotivated by the emergence of programmable radios, we seek to understand a classof communication system where pairs of transmitters and receivers can adapt theirmodulation/demodulation method in the presence of interference to achieve betterperformance. Using signal to interference ratio as a metric, we present a class ofiterative distributed algorithms for synchronous systems which results in an ensembleof optimal waveforms for multiple users connected to a common receiver (or co-locatedindependent receivers). That is, the waveform ensemble meets the Welch Boundwith equality and therefore achieves minimum average interference over the ensembleof signature waveforms. We provide convergence proofs for a number of scenariosand propose further research to help develop a theory and practice of interferenceavoidance for future licensed and unlicensed band systems. i Rose, Ulukus and Yates: Interference Avoidance in Wireless Systems iiContents1 Introduction 12 Background 23 Interference Avoidance for Multiple Users 63.1 Maximizing Symmetric/Sum Capacity . . . . . . . . . . . . . . . . . 63.2 Total Square Correlation and Sum Capacity . . . . . . . . . . . . . . 73.3 Iterative Methods of TSC Reduction . . . . . . . . . . . . . . . . . . 104 Fixed Point Properties for Greedy Interference Avoidance Algo-rithms 124.1 Fixed Points for Equal-Power Agile Users . . . . . . . . . . . . . . . . 134.2 Fixed Points for Mixtures of Fixed and Agile Users . . . . . . . . . . 144.3 Fixed Points for Interference Avoidance with Unequal Power . . . . . 204.4 Escape from Local Minima: a formal method . . . . . . . . . . . . . . 215 Discussion 245.1 Eigen-Algorithm: numerical examples . . . . . . . . . . . . . . . . . . 245.2 Dierent Basis Sets . . . . . .