No abstract

Abstract-Spectrum sensing is a key ingredient of the dynamic spectrum access paradigm, but it needs powerful detectors operating at SNRs well below the decodability levels of primary signals. Noise uncertainty poses a significant challenge to the development of such schemes, requiring some degree of diversity (spatial, temporal, or in distribution) for identifiability of the noise level. Multiantenna detectors exploit spatial independence of receiver thermal noise. We review this class of schemes and propose a novel detector trading off performance and complexity. However, most of these methods assume that the noise power, though unknown, is the same at all antennas. As it turns out, calibration errors have a substantial impact on these detectors. Another novel detector is proposed, based on an approximation to the Generalized Likelihood Ratio, outperforming previous schemes for uncalibrated multiantenna receivers.

Power spectral density (PSD) maps providing the distribution of RF power across space and frequency are constructed using power measurements collected by a network of low-cost sensors. By introducing linear compression and quantization to a small number of bits, sensor measurements can be communicated to the fusion center with minimal bandwidth requirements. Strengths of data-and model-driven approaches are combined to develop estimators capable of incorporating multiple forms of spectral and propagation prior information while fitting the rapid variations of shadow fading across space. To this end, novel nonparametric and semiparametric formulations are investigated. It is shown that PSD maps can be obtained using support vector machine-type solvers. In addition to batch approaches, an online algorithm attuned to real-time operation is developed. Numerical tests assess the performance of the novel algorithms.

No abstract

Abstract-The class of complex random vectors whose covariance matrix is linearly parameterized by a basis of Hermitian Toeplitz (HT) matrices is considered, and the maximum compression ratios that preserve all second-order information are derived -the statistics of the uncompressed vector must be recoverable from a set of linearly compressed observations. This kind of vectors arises naturally when sampling widesense stationary random processes and features a number of applications in signal and array processing.Explicit guidelines to design optimal and nearly optimal schemes operating both in a periodic and non-periodic fashion are provided by considering two of the most common linear compression schemes, which we classify as dense or sparse. It is seen that the maximum compression ratios depend on the structure of the HT subspace containing the covariance matrix of the uncompressed observations. Compression patterns attaining these maximum ratios are found for the case without structure as well as for the cases with circulant or banded structure. Universal samplers are also proposed to compress unknown HT subspaces. I. PRELIMINARIES Consider the problem of estimating the second-order statistics of a zero-mean random vector x ∈ C L from a set of K linear observations collected in the vector y ∈ C K given bywhereΦ ∈ C K×L is a known matrix and several realizations of y may be available. This matrix may be referred to as the compression matrix, measurement matrix or sampler, where compression is achieved by setting K < L (typically K L). The covariance matrix Σ = E xx H contains the second-order statistics of x and is assumed to be a linear combination of the Hermitian Toeplitz (HT) matrices in a given set This problem arises in inference operations over the secondorder statistics of a random vector with a Toeplitz covariance matrix. Operating on the compressed observations y entails multiple advantages due to their smaller dimension. In fact, many research efforts in the last decades have been pointed towards designing compression methods and reconstruction algorithms that allow for sampling rate reductions. While most efforts have been focused on reconstructing x, there were also important advances when only the second-order statistics of this vector are of interest. This paper is concerned with problems of the second kind.The compression ratio ρ = L/K measures how much x is compressed. The maximum compression ratio remains an open problem in many cases of interest; and most existing results rely on the usage of specific reconstruction algorithms (see Sec. I-D). This paper presents a general and unifying framework built on abstract criteria where the maximum compression ratio is defined and computed for most relevant settings. The proofs involved in this theory are constructive, resulting in several methods for designing optimal compression matrices. A. Covariance Matching FormulationThe prior information restricts the structure of Σ, thus determining how much x can be compressed. When no information at all is a...

No abstract

No abstract

Although full-duplex relaying schemes are appealing in order to improve spectral efficiency, simultaneous reception and transmission in the same frequency results in selfinterference, distorting the retransmitted signal and making the relay prone to oscillation. Current feedback cancellation techniques by means of adaptive filters are hampered by the fact that the useful and interference signals are highly correlated. We present a new adaptive algorithm which effectively and blindly restores the spectral shape of the desired signal. In contrast with previous schemes, the novel adaptive feedback canceller has low complexity, does not introduce additional delay in the relay station, and partly compensates for multipath propagation.