Paper Info
Title
Signature-assisted rendezvous in OFDM-based cognitive networks using sub-Nyquist samples
Abstract
In this paper, the problem of rendezvous in cognitive networks from sub-Nyquist samples is studied and demonstrated. Rendezvous refers to the task of secondary user (SU) sensing and network identification, including possibly multiple simultaneous secondary networks in a certain geographical area. Furthermore, when different networks may deploy different frequency bands, identifying the cognitive network(s) of interest via ordinary sensing receivers and classical Nyquist rate sampling results in substantial hardware complexity and costs for SU devices. In this paper, we exploit the cyclostationary embedded signatures in general OFDM/OFDMA waveform context to efficiently identify the networks using sub-Nyquist samples and joint sparse recovery methods. The proposed method does not require the spectrum itself to be sparse but relies on the sparse nature of spectral correlation function of OFDM(A) waveforms, and is shown through extensive simulations to enable efficient and reliable network identification under low Signal-to-Interference-plus-Noise Ratios (SINRs).
Year
DOI
Venue
2014
10.1109/SAM.2014.6882427
Sensor Array and Multichannel Signal Processing Workshop
Keywords
Field
DocType
OFDM modulation,cognitive radio,frequency division multiple access,OFDM-based cognitive networks,cyclostationary embedded signatures,general OFDM-OFDMA waveform,joint sparse recovery method,multiple simultaneous secondary networks,network identification,secondary user sensing,signal-to-interference-plus-noise ratio,signature-assisted rendezvous,subNyquist samples,substantial hardware complexity
Computer science,Computer network,Rendezvous,Nyquist–Shannon sampling theorem,Orthogonal frequency-division multiplexing,Cognitive network
Conference
ISSN
Citations 
PageRank 
1551-2282
2
0.36
References 
Authors
7
3
Name
Order
Citations
PageRank
Seyed Alireza Razavi1427.77
Mikko Valkama21567175.51
Danijela Cabric3795101.37