2X2选频干扰信道纳什议价解的计算

2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing Pub Date : 2007-12-01 DOI:10.1109/CAMSAP.2007.4497999

E. Zehavi, Amir Leshem

{"title":"2X2选频干扰信道纳什议价解的计算","authors":"E. Zehavi, Amir Leshem","doi":"10.1109/CAMSAP.2007.4497999","DOIUrl":null,"url":null,"abstract":"In this paper we extend our previous work analyzing the interference channel as a conflict situation to frequency selective channels and joint TDM/FDM strategies. We provide an O(K log K) complexity algorithm for computing the Nash bargaining solution under mask constraint for the 2times2 frequency selective interference channel (with K frequency bins) under joint FDM/TDM strategies. Simulation results are also provided. We also show the convexity of the N players game with similar strategies.","PeriodicalId":220687,"journal":{"name":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Computing The Nash Bargaining Solution for the 2X2 Frequency Selective Interference Channel\",\"authors\":\"E. Zehavi, Amir Leshem\",\"doi\":\"10.1109/CAMSAP.2007.4497999\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we extend our previous work analyzing the interference channel as a conflict situation to frequency selective channels and joint TDM/FDM strategies. We provide an O(K log K) complexity algorithm for computing the Nash bargaining solution under mask constraint for the 2times2 frequency selective interference channel (with K frequency bins) under joint FDM/TDM strategies. Simulation results are also provided. We also show the convexity of the N players game with similar strategies.\",\"PeriodicalId\":220687,\"journal\":{\"name\":\"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAMSAP.2007.4497999\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMSAP.2007.4497999","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在本文中，我们将先前的工作扩展到分析频率选择信道和TDM/FDM联合策略的冲突情况。针对FDM/TDM联合策略下的2times2频率选择性干扰信道(含K个频箱)，提出了一种复杂度为O(K log K)的算法来计算掩模约束下的Nash议价解。并给出了仿真结果。我们还展示了具有相似策略的N人博弈的凸性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Computing The Nash Bargaining Solution for the 2X2 Frequency Selective Interference Channel

In this paper we extend our previous work analyzing the interference channel as a conflict situation to frequency selective channels and joint TDM/FDM strategies. We provide an O(K log K) complexity algorithm for computing the Nash bargaining solution under mask constraint for the 2times2 frequency selective interference channel (with K frequency bins) under joint FDM/TDM strategies. Simulation results are also provided. We also show the convexity of the N players game with similar strategies.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing

自引率

0.00%

发文量