Search for: All records

Modulation Classification (MC) is the problem of classifying the modulation format of a wireless signal. In the wireless communications pipeline, MC is the first operation performed on the received signal and is critical for reliable decoding. This paper considers the problem of secure MC, where a transmitter (Alice) wants to maximize MC accuracy at a legitimate receiver (Bob) while minimizing MC accuracy at an eavesdropper (Eve). This work introduces novel adversarial learning techniques for secure MC. We present adversarial filters in which Alice uses a carefully designed adversarial filter to mask the transmitted signal, that can maximize MC accuracy at Bob while minimizing MC accuracy at Eve. We present two filtering-based algorithms, namely gradient ascent filter (GAF), and a fast gradient filter method (FGFM), with varying levels of complexity. Our proposed adversarial filtering-based approaches significantly outperform additive adversarial perturbations (used in the traditional machine learning (ML) community and other prior works on secure MC) and have several other desirable properties. In particular, GAF and FGFM algorithms are a) computational efficient (allow fast decoding at Bob), b) power-efficient (do not require excessive transmit power at Alice); and c) SNR efficient (i.e., perform well even at low SNR values at Bob). 

A description is presented of the algorithms used to reconstruct energy deposited in the CMS hadron calorimeter during Run 2 (2015–2018) of the LHC. During Run 2, the characteristic bunch-crossing spacing for proton-proton collisions was 25 ns, which resulted in overlapping signals from adjacent crossings. The energy corresponding to a particular bunch crossing of interest is estimated using the known pulse shapes of energy depositions in the calorimeter, which are measured as functions of both energy and time. A variety of algorithms were developed to mitigate the effects of adjacent bunch crossings on local energy reconstruction in the hadron calorimeter in Run 2, and their performance is compared.

 

A search for decays to invisible particles of Higgs bosons produced in association with a top-antitop quark pair or a vector boson, which both decay to a fully hadronic final state, has been performed using proton-proton collision data collected at$${\sqrt{s}=13\,\text {Te}\hspace{-.08em}\text {V}}$$$\sqrt{s}=13\text{Te}\text{V}$by the CMS experiment at the LHC, corresponding to an integrated luminosity of 138$$\,\text {fb}^{-1}$$${\text{fb}}^{-1}$. The 95% confidence level upper limit set on the branching fraction of the 125$$\,\text {Ge}\hspace{-.08em}\text {V}$$$\text{Ge}\text{V}$Higgs boson to invisible particles,$${\mathcal {B}({\textrm{H}} \rightarrow \text {inv})}$$$B(\text{H}\to \text{inv})$, is 0.54 (0.39 expected), assuming standard model production cross sections. The results of this analysis are combined with previous$${\mathcal {B}({\textrm{H}} \rightarrow \text {inv})}$$$B(\text{H}\to \text{inv})$searches carried out at$${\sqrt{s}=7}$$$\sqrt{s}=7$, 8, and 13$$\,\text {Te}\hspace{-.08em}\text {V}$$$\text{Te}\text{V}$in complementary production modes. The combined upper limit at 95% confidence level on$${\mathcal {B}({\textrm{H}} \rightarrow \text {inv})}$$$B(\text{H}\to \text{inv})$is 0.15 (0.08 expected).