Interference Avoidance in Wireless Systems.pdfVIP

下载本文档

1
0
约7.8万字
约 41页
2017-04-13 发布于江苏
举报
版权申诉

Interference Avoidance in Wireless Systems.pdf

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Interference Avoidance in Wireless Systems

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 . . . . . .