Dempster-Shafer （D-S） algorithm with credit scale in spectrum sensing  

作　　者：刘婷婷 Wang Jianxin Shu Feng 

机构地区：[1]School of Electronic Engineering and Optoelectronic Techniques, Nanjing University of Science and Technology, Nanjing 210094, P.R. China

出　　处：《High Technology Letters》2010年第2期143-146,共4页高技术通讯（英文版）

基　　金：Supported by the National High Technology Research and Development Programme of China （No. 2007AA01Z268）, National Natural Science Foundation of China （No. 60702028）and the Starting Ftmd for Science Research of NJUST （AIM1947）.

摘　　要：In cognitive radio, the detection probability of primary user affects the signal receiving performance for both primary and secondary users significantly. In this paper, a new Dempster-Shafer （D-S） algorithm with credit scale for decision fusion in spectrum sensing is proposed for the purpose to improve the performance of detection in cognitive radio. The validity of this method is established by simulation in the environment of multiple cognitive users who know their signal to noise ratios （SNR） and a central node. The channels between the cognitive users and the central node are considered to be additive white Ganssian noise （AWGN）. Compared with traditional data fusion rules, the proposed D-S algorithm with credit scale provides a better detection performance.

关 键 词：cognitive radio spectrum sensing cooperative commtmieation Dempster-Shafer （D-S） algorithm credit scale 

分 类 号：TN929.5[电子电信—通信与信息系统] TP274.2[电子电信—信息与通信工程]