TY - GEN
T1 - Detection of unknown constant magnitude signals in time-varying channels
AU - Romero, Daniel
AU - López-Valcarce, Roberto
PY - 2012/8/13
Y1 - 2012/8/13
N2 - Spectrum sensing constitutes a key ingredient in many cognitive radio paradigms in order to detect and protect primary transmissions. Most sensing schemes in the literature assume a time-invariant channel. However, when operating in low Signal-to-Noise Ratio (SNR) conditions, observation times are necessarily long and may become larger than the coherence time of the channel. In this paper the problem of detecting an unknown constant-magnitude waveform in frequency-flat time-varying channels with noise background of unknown variance is considered. The channel is modeled using a basis expansion model (BEM) with random coefficients. Adopting a generalized likelihood ratio (GLR) approach in order to deal with nuisance parameters, a non-convex optimization problem results. We discuss different possibilities to circumvent this problem, including several low complexity approximations to the GLR test as well as an efficient fixed-point iterative method to obtain the true GLR statistic. The approximations exhibit a performance ceiling in terms of probability of detection as the SNR increases, whereas the true GLR test does not. Thus, the proposed fixed-point iteration constitutes the preferred choice in applications requiring a high probability of detection.
AB - Spectrum sensing constitutes a key ingredient in many cognitive radio paradigms in order to detect and protect primary transmissions. Most sensing schemes in the literature assume a time-invariant channel. However, when operating in low Signal-to-Noise Ratio (SNR) conditions, observation times are necessarily long and may become larger than the coherence time of the channel. In this paper the problem of detecting an unknown constant-magnitude waveform in frequency-flat time-varying channels with noise background of unknown variance is considered. The channel is modeled using a basis expansion model (BEM) with random coefficients. Adopting a generalized likelihood ratio (GLR) approach in order to deal with nuisance parameters, a non-convex optimization problem results. We discuss different possibilities to circumvent this problem, including several low complexity approximations to the GLR test as well as an efficient fixed-point iterative method to obtain the true GLR statistic. The approximations exhibit a performance ceiling in terms of probability of detection as the SNR increases, whereas the true GLR test does not. Thus, the proposed fixed-point iteration constitutes the preferred choice in applications requiring a high probability of detection.
UR - http://www.scopus.com/inward/record.url?scp=84864663985&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864663985&partnerID=8YFLogxK
U2 - 10.1109/CIP.2012.6232933
DO - 10.1109/CIP.2012.6232933
M3 - Conference contribution
AN - SCOPUS:84864663985
SN - 9781467318785
T3 - 2012 3rd International Workshop on Cognitive Information Processing, CIP 2012
BT - 2012 3rd International Workshop on Cognitive Information Processing, CIP 2012
T2 - 2012 3rd International Workshop on Cognitive Information Processing, CIP 2012
Y2 - 28 May 2012 through 30 May 2012
ER -