GLRT-Based Spectrum Sensing with Blindly Learned Feature under Rank-1 Assumption

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectrum Sensing Based on Blindly Learned Signal Feature

Spectrum sensing is the major challenge in the cognitive radio (CR). We propose to learn local feature and use it as the prior knowledge to improve the detection performance. We define the local feature as the leading eigenvector derived from the received signal samples. A feature learning algorithm (FLA) is proposed to learn the feature blindly. Then, with local feature as the prior knowledge,...

متن کامل

Demonstration of Spectrum Sensing with Blindly Learned Feature

Spectrum sensing is essential in cognitive radio. By defining leading eigenvector as feature, we introduce a blind feature learning algorithm (FLA) and a feature template matching (FTM) algorithm using learned feature for spectrum sensing. We implement both algorithms on Lyrtech software defined radio platform. Hardware experiment is performed to verify that feature can be learned blindly. We c...

متن کامل

Matrix Approximation under Local Low-Rank Assumption

Matrix approximation is a common tool in machine learning for building accurate prediction models for recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the partially observed matrix is of low-rank. We propose a new matrix approximation model where we assume instead that the matrix is only locally of low-rank, leading t...

متن کامل

Compressed sensing based cyclic feature spectrum sensing for cognitive radios

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi

متن کامل

Theorem 1 : Under assumption ( A 1 ) ( W̃ ?

This paper provides the duality structure of the optimal two-block H∞ problem. The dual description leads naturally to a numerical solution based on convex programming for LTI (including infinite dimensional) systems. Alignment conditions are obtained and show that the optimal solution is flat in general, and unique in the SISO case. It is also proved that under specific conditions a wellknown ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2013

ISSN: 0090-6778

DOI: 10.1109/tcomm.2012.100912.120162