A New Computationally Efficient Nystrom Feature Subspace Matching Algorithm for the Primary User Spectrum Sensing

CHEN Ruo-nan; SUN Xiao-ying; LIU Guo-hong

doi:10.3969/j.issn.0372-2112.2017.07.002

您当前的位置：

首页 >

文章列表页 >

A New Computationally Efficient Nystrom Feature Subspace Matching Algorithm for the Primary User Spectrum Sensing

更新时间：2025-07-16

- A New Computationally Efficient Nystrom Feature Subspace Matching Algorithm for the Primary User Spectrum Sensing
- Acta Electronica Sinica Vol. 45, Issue 7, Pages: 1553-1558(2017)
- 作者机构：
  
  吉林大学通信工程学院,吉林,长春,130022
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61171137);National Key Research and Development Program of China (No.2016YFB1001304)
- DOI：10.3969/j.issn.0372-2112.2017.07.002
  CLC： TN92
- Published Online：25 July 2017，
  
  Published：2017
- 稿件说明：
移动端阅览
CHEN Ruo-nan, SUN Xiao-ying, LIU Guo-hong. A New Computationally Efficient Nystrom Feature Subspace Matching Algorithm for the Primary User Spectrum Sensing[J]. Acta Electronica Sinica, 2017, 45(7): 1553-1558.
DOI：

CHEN Ruo-nan, SUN Xiao-ying, LIU Guo-hong. A New Computationally Efficient Nystrom Feature Subspace Matching Algorithm for the Primary User Spectrum Sensing[J]. Acta Electronica Sinica, 2017, 45(7): 1553-1558. DOI： 10.3969/j.issn.0372-2112.2017.07.002.

摘要

针对核（kernel）空间下主用户频谱感知算法存在的计算任务繁重这一共性问题，提出一种低计算复杂度的Nystrom特征子空间匹配（NSM）新算法.该算法依据数据样本维的独立同分布特性随机地选择数据子集.在高维核空间下应用Nystrom近似获得主特征向量，用以分别构建主用户特征信号与次用户接收信号的Nystrom特征子空间.以此为基础计算相应的Frobenius距离，实现主用户检测.计算机仿真结果表明：与代表性的核空间下主用户频谱感知算法相比，所提算法在保证检测性能较为理想的前提下，可将相应的计算复杂度降低近66%.

Abstract

Considering the high computational burden of the previous kernel spectrum sensing methods

this paper proposes a computationally more efficient Nystrom subspace matching (NSM) algorithm.Based on the independent identically distributed observations

the subset is randomly chosen to implement the Nystrom approximation and reconstruct the related kernel features in a high-dimensional Euclidean space.Then

the related Nystrom subspaces respectively for the primary users and the secondary users are modified

and the Frobenius range between these two subspaces can be computed to determine whether the primary users exist or not.Compared to the previous kernel subspace matching methods

the novel version reduces the computational complexity by 66% while provides almost the same detection performance.Computer simulations are conducted to evaluate the performance of the proposed algorithm.

关键词

Keywords

references

Views

302

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Research on Spectrum Sensing Based on Graphical Feature of the Autocorrelation

A Truncated SPRT Algorithm Based on Signal Segmental Processing

An Algorithm of Adaptive Cooperative Spectrum Sensing Based on Optimal Relay

A Spectrum Sensing Method and Performance Analysis Based on Stochastic Resonance Under Low SNR

Related Author

HU Guo-bing

ZHAO Dun-bo

YANG Li

ZHAO Pin-jiao

CHEN Chen

LI Jian-dong

LI Zan

WU Li-ping

Related Institution

School of Electronic and Information Engineering， Jinling Institute of Technology

College of Electronic and Optical Engineering & College of Flexible Electronics （Future Technology）， Nanjing University of Posts and Telecommunications

State Key Laboratory of ISN,Xidian University

南京邮电大学电子科学与工程学院

江苏省射频集成与微组装工程实验室

⁰