检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]f西安电子科技大学综合业务网理论及关键技术国家重点实验室,西安710071
出 处:《电子与信息学报》2011年第7期1532-1536,共5页Journal of Electronics & Information Technology
基 金:国家973计划项目(2009CB320404);国家自然科学基金(60902033);中央高校基本科研业务费专项基金(K50510010022)资助课题
摘 要:序贯检测的检测时间是随实际接收信号采样点的变化而不同的随机变量,在平均意义上,序贯检测有较高的检测速度,但是个别情况下可能需要很长的检测时间,为了避免这种现象的发生,同时提高认知无线电中频谱感知的速度,该文提出了一种截断序贯检测算法。首先分析了截断对传统序贯检测性能的影响,给出了虚警概率和漏检概率的上限,然后基于该性能上限得到了截断序贯检测的检测门限,最后给出了截断序贯检测算法的流程。仿真结果表明,该算法在有限的检测时间内,能够满足系统的性能要求,且其平均检测时间小于传统的能量检测。The detection time required to reach a decision in sequential detection is a random variable.Although the sequential detection has a high average detection speed,very long detection time may be required in some specific cases.In order to improve the speed of spectrum sensing as well as to avoid some too-long-sensing-time tests in cognitive radio,a truncated sequential detection algorithm is proposed.Firstly,the effect of truncation on the performance of conventional sequential detection is analyzed,and the upper bounds of the false alarm and the miss detection probability are derived.Then the detection thresholds of truncated sequential detection are derived based on the upper bounds.Finally,the process of the truncated sequential detection algorithm is proposed.The simulation results show that the proposed algorithm,under the constraint of limited sensing time,can satisfy the performance requirement,and still have a shorter average sensing time than the conventional energy detection does.
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30