Browsing by Keywords "Time-sharing"
Now showing items 1-6 of 6
-
Convexity properties of detection probability under additive Gaussian noise: optimal signaling and jamming strategies
(IEEE, 2013)In this correspondence, we study the convexity properties for the problem of detecting the presence of a signal emitted from a power constrained transmitter in the presence of additive Gaussian noise under the Neyman-Pearson ... -
A game theoretic approach to channel switching in the presence of jamming
(IEEE, 2021-10-14)In this letter, a channel switching problem is investigated in the presence of jamming based on a game theoretic approach. First, a convex formulation of the optimal channel switching problem is proposed for a given jamming ... -
Optimal channel switching for average capacity maximization
(IEEE, 2014-05)Optimal channel switching is proposed for average capacity maximization in the presence of average and peak power constraints. A necessary and sufficient condition is derived in order to determine when the proposed optimal ... -
Optimal detector randomization for multiuser communications systems
(IEEE, 2013)Optimal detector randomization is studied for the downlink of a multiuser communications system, in which users can perform time-sharing among multiple detectors. A formulation is provided to obtain optimal signal amplitudes, ... -
Optimal randomization of signal constellations on downlink of a multiuser DS-CDMA system
(IEEE, 2013-10)In this study, the jointly optimal power control with signal constellation randomization is proposed for the downlink of a multiuser communications system. Unlike a conventional system in which a fixed signal constellation ... -
Polar coding for the Slepian-Wolf problem based on monotone chain rules
(IEEE, 2012)We give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions. © 2012 IEEE.
