共查询到19条相似文献,搜索用时 62 毫秒
1.
研究了协作通信与认知无线电的结合,针对TD-SCDMA系统和WiMAX系统组成的异构无线网络,提出了一种基于多用户分集的协作频谱感知机制.根据该算法,WiMAX用户被分成若干个簇,选择每个簇内瞬时信道条件最好的WiMAX用户协作检测频谱,并利用软硬结合的判决手段,既保证检测性能,又不增加复杂度.分析和仿真表明,该算法一方面保证了频谱检测的可靠性,降低了虚警概率,另一方面减少了通信开销,提高了判决消息传输的可靠性,达到了提升频谱利用率的目的. 相似文献
2.
考虑到现有光突发交换(OBS)网络协议在时延、丢包率性能上的不足,在恰量时间(JET)协议的基础上,提出了一种基于并行调度(PS)处理思想的新型资源预留协议--PS-JET协议,给出了该协议的实现方案及具体的信令帧格式,并通过分析与系统仿真,将其性能同带优先级的恰量时间(PJET)资源预留协议做了详细的比较.结果表明,PS-JET协议在实际的多跳网络中具有更好的时延性能和更低的丢包率,同时,具有和PJET同样良好的QoS区分特性. 相似文献
3.
针对实际系统中的信道冲激响应(CIR)泄漏问题,提出了一种适用于梳状导频正交频分复用(OFDM)系统的改进的最小二乘(LS)信道估计算法.该算法基于分数抽头延时信道近似(FTCA)的参数化信道模型,此信道模型采用一个抽头间隔为分数倍采样间隔的抽头延时线结构的有限冲激响应(FIR)滤波器表示.此算法首先通过FTCA信道模型来近似实际信道,然后再估计该信道模型中的某些参数来获取实际的信道信息;该算法利用了FTCA信道模型中所有的延时抽头,从而很好地抑制了CIR泄漏.仿真与分析表明,FTCA信道模型能够有效地近似实际信道,同时降低信道自相关矩阵的维数,从而提高信道估计的性能. 相似文献
4.
5.
《中国测试》2015,(10)
针对认知无线电(cognitive ratio,CR)中的频谱感知问题,提出一种基于可信数据或门融合的合作压缩频谱感知(reliable-OR rule data fusion cooperative compressed spectrum sensing,RFCSS)算法。首先,次级用户(secondary user,SU)利用压缩理论,获取低维观测数据,再利用基追踪去噪(basis pursuit denoising,BPDN)重构频谱,进而作出感知结果。然后,对SU的感知结果进行可信度估计,只有可信的感知结果的用户,才可向融合中心发送数据。融合中心依据所接收的数据,采用或门准则,作出最终的感知结果。仿真结表明,提出的算法能够降低系统复杂度以及提高感知结果的准确性。 相似文献
6.
7.
研究了广播信道分布式干扰消除算法的性能,提出了一种基于动态功率分配的多天线广播干扰信道对齐算法.该算法利用多用户多天线干扰信道相关矩阵的迹来计算分配功率,并采用最大化码流信干噪比的方法来得到预编码矩阵和接收滤波器矩阵.数值仿真表明,该动态功率分配算法与等功率分配算法相比,尽管低负荷下干扰对齐后的平均信干噪比增益不明显,但中、高负荷下其干扰对齐后的平均信干噪比大幅提高,特别是高负荷下可以解决等功率方法存在的信干噪比瓶颈效应.由于低负荷的应用需求并不强烈,因而该算法是一种实用的广播信道干扰消除方法. 相似文献
8.
针对源节点和目的节点之间没有直接路径的放大转发(AF)OFDM中继系统,提出了一种利用叠加导频(SP)进行信道估计和联合数据检测的算法.该算法首先将接收信号通过白化滤波器进行信号白化,然后利用SP获得等效信道的信道状态信息(CSI)初始估计值,并联合目的节点上的最大比合并(MRC)接收机,通过判决反馈迭代操作不断改进信... 相似文献
9.
基于最大似然的准则,研究了理想信道估计条件下和非理想信道估条件下OFDM系统的最优检测算法。研究结果表明,当发送信号为PSK调制方式时,无论是理想信道估计还是非理想信道估计,最大似然检测算法与传统的迫零检测算法等价。但当信道估计非理想且发送信号的调制方式为16QAM或高阶QAM时,采用最大似然检测算法才能够获得更好的性能。 相似文献
10.
《中国计量学院学报》2015,(1):110-114
在多用户OFDMA资源分配中提出一种基于子载波权衡的资源分配算法.资源分配过程中,在对公平性最差的用户进行子载波分配时,进行子载波权衡.根据权衡后子载波信道增益的变化情况,进行子载波分配.通过子载波权衡,将待分配的子载波分配给权衡用户;同时对于公平性最差的用户,从已分配给权衡用户的子载波中获得一个权衡子载波;使得权衡后分配的子载波较权衡之前获得更高的信道增益.仿真结果表明,算法在保证用户公平性的同时,提升了系统的频谱利用率. 相似文献
11.
12.
13.
对遗传算法用于解决认知无线电网络频谱分配中的无干扰约束条件问题进行分析,提出一种基于约束模板进行认知无线电网络频谱分配的遗传算法模型,该模型以系统效用最大化为目标求得无干扰的约束模板,利用约束模板的标号组合构成染色体,再通过遗传算子的进化选择适应度函数更大的约束模板组合,最终得到无干扰的可行分配策略.仿真结果表明,该算法可以避免利用传统遗传算法进行频谱分配的模型在进化过程中对种群中染色体重复性的无干扰约束处理,及由于无干扰约束处理引起的适应度函数减小等问题,可获得更高的系统效用. 相似文献
14.
15.
基于导频时分复用的多中继协同通信系统频域信道估计算法 总被引:1,自引:0,他引:1
针对频率选择性衰落环境下结合正交频分复用技术的放大转发多中继协同通信系统,提出了基于导频时分复用的频域信道估计算法,包括最小二乘(LS)估计算法和低阶近似的线性最小均方误差(Lr-LMMSE)估计算法.理论分析和仿真结果表明,该算法不仅能成功分辨多中继协同通信系统的所有频域信道衰落系数,避免各中继节点转发的导频符号在目... 相似文献
16.
Two spectrum etiquettes are developed for the use on the downlink of coexisting high-altitude platform (HAP) and terrestrial fixed broadband systems that are intended for future application with cognitive radio-based user terminals with directional antennas. The spectrum etiquettes are based on the interference to noise ratio and carrier to interference plus noise ratio levels at the receiver of an incumbent user. Antenna beamwidths and multiple modulation scheme levels determine the parameter settings for coexistence performance. It is shown that coexistence performance can be improved by exploiting the surplus transmitter power of the terrestrial system, thereby enabling the incumbent terrestrial system to accommodate additional interference arising from a newly activated HAP system. 相似文献
17.
Software radio (SWR) is an enabling technology for cognitive radio (CR) systems which promises to (de) modulate any signal, at any frequency. SWR signal therefore is composed of different standard's signals, and each standard's signal is either multicarrier or multiplex of single carriers. This combination leads to high temporal fluctuations and thus SWR signal inherits high peak to average power ratio (PAPR) or simply high power ratio (PR). Nonlinear analogue components (amplifiers, converters etc.) cause distortions (in and out of band distortion) for high PR signals which result in system performance degradation. Usually PR problem is addressed in time domain, and here frequency domain interpretation of PR which is more appropriate in SWR context is presented. Gaussian equivalence between SWR signal and orthogonal frequency division multiplexing (OFDM) signal is proved first to accentuate high PR issue in SWR as OFDM suffers the same problem. Then frequency domain interpretation of PR metric is discussed which results in a PR upper bound. This PR upper bound depends only upon spectral values of the signal thus associates spectrum with PR. As a result this bound assists in spectrum access for CR systems by providing PR metric information related to any available bandwidth. Thus bandwidth allocation in a spectrum access scenario under PR constraint is simplified. 相似文献
18.
Spectrum has become a scant quantity with recent upsurge in the field of wireless communication. Cognitive radio network (CRN) alleviates the overgrowing spectrum scarcity and underutilization problem by adequately sharing the frequency bands between licensed and unlicensed users. CRN allows unlicensed users or secondary users (SUs) to opportunistically utilize the free portion of the spectrum allocated to the licensed users or primary users. The fundamental process in the formation of CRN is the rendezvous process where SUs meet on commonly available channels and establish reliable links for effective communication. Existing rendezvous solutions based on the assumption of a common control channel (CCC) among the SUs are infeasible and less efficient in the dynamic environment of CRNs. Therefore, channel hopping (CH) technique without CCC support, often referred to as blind rendezvous, is usually employed for accomplishing the rendezvous between SUs. This paper presents a comprehensive asynchronous symmetric rendezvous (CASR) algorithm that does not require time synchronization and guarantees rendezvous of SUs in finite time. CASR algorithm exploits the MAC address of SU as the unique identifier (ID) and generates CH sequence based on the dynamic manipulation of ID according to the number of available communication channels. Leveraging the unique ID of each SU, CASR algorithm succeeded in rendezvous guarantee while perpetuating a good time to rendezvous. The efficiency of CASR algorithm is estimated theoretically and verified through various simulation experiments. Simulation results affirm that CASR algorithm performs better in terms of average time-to-rendezvous as compared with existing rendezvous algorithms. 相似文献