认知无线电毕业设计论文

《认知无线电毕业设计论文》由会员分享，可在线阅读，更多相关《认知无线电毕业设计论文（45页珍藏版）》请在毕设资料网上搜索。

1、摘要 I 摘 要 现如今无线通信的技术发展的越来越火热，但同时也会面临这样的问题：频谱的资 源变得也来越少。以前处于静态的无线频谱管理的方式会让一些频谱常常处于一种空闲 的状态。这些常常处于空闲的状态会限制频谱利用率。如果长时间这样，则会影响频谱 的利用率，造成频谱资源的浪费。主要的目的是为了提高频谱的利用率，人们于是提出 认知无线电的思想。在基于认知无线电的基础上发展正交频分复用可以降低总的发送功 率，由串行的高功率变成多个并行的子载波低功率发送。 首先，这篇文章介绍了认知无线电产生的背景和两个对认知无线电的概念的解释， 认知无线电特点当中的认知能力更够感应外部环境的检测，分析频谱和对频谱的

2、判定。 其次，就 OFDM 的认知无线电频谱感知做出了一些研究，通过搭建感知的系统模型， 研究其功能等特点。 对于认知无线电 OFDM 系统资源分配算法， 本节通过简单的介绍了 Wong算法、 最 小容量最大化算法、RA 算法、迭代注水算法等，需要找一种多用户资源分配算法当中 的最优算法。本章节仿真采用的是典型的迭代注水算法，得出的结论是这个算法的主要 是能够实现使功率最小或者速率的最大化。 关键词：认知无线电；OFDM；多用户；注水算法 Abstract II Abstract Now the technology of wireless communication is developin

3、g more and more hot, but at the same time, it also will face the problem: the resources of the spectrum become more and less. Before the static wireless spectrum management approach will let some spectrum is often in an idle state. These are often idle and limit the spectrum utilization. If this is

4、long, it will affect the utilization of the spectrum, resulting in the waste of spectrum resources. The main purpose is to improve the utilization of the spectrum, people then put forward the idea of cognitive radio. The development of the orthogonal frequency division multiplexing based on the cogn

5、itive radio can reduce the total transmission power, and transmit the high power from serial to multiple parallel sub carriers with low power. First, this article introduced explained the background of cognitive radio and two of cognitive radio concept, cognitive radio characteristics of cognitive c

6、apacity enough induction of the external environment detection, analysis of spectrum and the spectrum determination. Secondly, some research is made on the cognitive radio spectrum of OFDM, and the features of the cognitive radio spectrum sensing system are studied. For cognitive radio OFDM resource allocation algorithm, in this section, through simple introduced Wong algorithm, minimum capacity maximization algorithm, RA algorithm, iterative water filling algorithm and need to find a multiuser