An efficient algorithm for robust fractional QCQP and its applications to multiuser beamforming with bounded channel uncertainties
In this paper, we investigate a nonconvex robust fractional quadratically constrained
quadratic problem (Robust Fractional QCQP), which has a wide application to the worst-cast …
quadratic problem (Robust Fractional QCQP), which has a wide application to the worst-cast …
Quantized radio map estimation using tensor and deep generative models
Spectrum cartography (SC), also known as radio map estimation (RME), aims at crafting
multi-domain (eg, frequency and space) radio power propagation maps from limited sensor …
multi-domain (eg, frequency and space) radio power propagation maps from limited sensor …
Power spectra separation via structured matrix factorization
Power spectra separation aims at extracting the individual power spectra of multiple emitters
from the received mixtures. Traditional spectrum sensing for dynamic spectrum sharing is …
from the received mixtures. Traditional spectrum sensing for dynamic spectrum sharing is …
Low-rate denial-of-service attack detection: Defense strategy based on spectral estimation for CV-QKD
Although continuous-variable quantum key distribution (CVQKD) systems have
unconditional security in theory, there are still many cyber attacking strategies proposed that …
unconditional security in theory, there are still many cyber attacking strategies proposed that …
Deep spectrum cartography using quantized measurements
Spectrum cartography (SC) techniques craft multi-domain (eg, space and frequency) radio
maps from limited measurements, which is an ill-posed inverse problem. Recent works used …
maps from limited measurements, which is an ill-posed inverse problem. Recent works used …
New results on generalized fractional programming problems with Toeplitz quadratics
We develop a polynomial-time procedure to handle a class of generalized fractional
programming (GFP) problems with Toeplitz-Hermitian quadratics exploiting the linear matrix …
programming (GFP) problems with Toeplitz-Hermitian quadratics exploiting the linear matrix …
Hidden convexity in QCQP with Toeplitz-Hermitian quadratics
Quadratically Constrained Quadratic Programming (QCQP) has a broad spectrum of
applications in engineering. The general QCQP problem is NP-Hard. This article considers …
applications in engineering. The general QCQP problem is NP-Hard. This article considers …
Comprehensive survey on quality of service provisioning approaches in cognitive radio networks: Part one
Abstract Much interest in Cognitive Radio Networks (CRNs) has been raised recently by
enabling unlicensed (secondary) users to utilize the unused portions of the licensed …
enabling unlicensed (secondary) users to utilize the unused portions of the licensed …
One-bit compressive sampling with time-varying thresholds: The Cramér-Rao bound, maximum likelihood, and sparse estimation
CD Gianelli - 2019 - search.proquest.com
This work considers the problem of estimating the parameters of a noisy signal which has
been quantized to one-bit via a time-varying thresholding operation. This problem is …
been quantized to one-bit via a time-varying thresholding operation. This problem is …
On solving quadratically constrained quadratic programming problem with one non-convex constraint
In this paper we consider a quadratically constrained quadratic programming problem with
convex objective function and many constraints in which only one of them is non-convex …
convex objective function and many constraints in which only one of them is non-convex …