PowerPoint Presentation Channel Assignment using ChaoticPowerPoint演示文稿的信道分配使用混沌.pptVIP

PowerPoint Presentation Channel Assignment using ChaoticPowerPoint演示文稿的信道分配使用混沌.ppt

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

Channel Assignment using Chaotic Simulated Annealing Enhanced Hopfield Neural Network Amir massoud Farahmand (a,b) Mohammad Javad Yazdanpanah (b) Your Big Company Suppose that you have a mobile communication company and want you to earn money as much as possible. You want to service to your costumers in a large geographical space, e.g. Vancouver. You need to assign a unique frequency channel to each costumer (e.g. 870.12MHz to 870.14MHz). The problem is that you only have a limited frequency range (e.g. 869MHz - 894MHz for downlink in Canada). Cells and Interference Divide the region to smaller sub-regions (cells). You have the whole frequency range for each cell. Channel Assignment Problem Channel assignment problem is a common problem in cellular telecommunication. Resources: frequency channels and cells. Sources of Interference: Interference between adjacent cells Dominant for frequency-close channels. Interference between two frequency channels in the same cell. Goal: assign channels in order to maximize the utilization of the network while minimizing the interference. This problem is a instance of a combinatorial optimization problem. NP-Hard! Example Example Combinatorial Optimization Problem Combinatorial Optimization Problem (Samples) Traveling Salesman Problem VLSI Connection Optimization Job Scheduling Postal Delivery Car Sequencing Channel Assignment Problem How to Solve a COP? Search all space?! Infeasible for large problems. Approximately solve it Different heuristics Meta-heuristics Simulated Annealing Tabu Search Evolutionary Computation Methods Hopfield Neural Networks Hopfield N.N. for COP Hopfield N.N. for COP Difficulties Infeasible solutions Solutions that do not satisfy constraints Energy function is strictly decreasing Local minima dilemma Solutions Hill-Climbing methods to escape from local minima Simulated Annealing noise Chaotic noise Forcing constraints Force lying in constraint plane Example of Trapping in a Local Minimum Main Idea Inj

您可能关注的文档

文档评论(0)

118books + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档