Linear Minimum Error Probability Detection for Massive MU-MIMO With Imperfect CSI in URLLC

2019 ◽  
Vol 68 (11) ◽  
pp. 11384-11388
Author(s):  
Jie Zeng ◽  
Tiejun Lv ◽  
Ren Ping Liu ◽  
Xin Su ◽  
Norman C. Beaulieu ◽  
...  
2015 ◽  
Vol 15 (9&10) ◽  
pp. 737-758
Author(s):  
Weien Chen ◽  
Yongzhi Cao ◽  
Hanpin Wang ◽  
Yuan Feng

Error probability is a popular and well-studied optimization criterion in discriminating non-orthogonal quantum states. It captures the threat from an adversary who can only query the actual state once. However, when the adversary is able to use a brute-force strategy to query the state, discrimination measurement with minimum error probability does not necessarily minimize the number of queries to get the actual state. In light of this, we take Massey's guesswork as the underlying optimization criterion and study the problem of minimum guesswork discrimination. We show that this problem can be reduced to a semidefinite programming problem. Necessary and sufficient conditions when a measurement achieves minimum guesswork are presented. We also reveal the relation between minimum guesswork and minimum error probability. We show that the two criteria generally disagree with each other, except for the special case with two states. Both upper and lower information-theoretic bounds on minimum guesswork are given. For geometrically uniform quantum states, we provide sufficient conditions when a measurement achieves minimum guesswork. Moreover, we give the necessary and sufficient condition under which making no measurement at all would be the optimal strategy.


Author(s):  
Thomas P. W. Cope ◽  
Stefano Pirandola

AbstractThe class of quantum states known as Werner states have several interesting properties, which often serve to illuminate unusual properties of quantum information. Closely related to these states are the Holevo- Werner channels whose Choi matrices are Werner states. Exploiting the fact that these channels are teleportation covariant, and therefore simulable by teleportation, we compute the ultimate precision in the adaptive estimation of their channel-defining parameter. Similarly, we bound the minimum error probability affecting the adaptive discrimination of any two of these channels. In this case, we prove an analytical formula for the quantum Chernoff bound which also has a direct counterpart for the class of depolarizing channels. Our work exploits previous methods established in [Pirandola and Lupo, PRL


2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Arshed Ahmed ◽  
Muhammad Sajjad Khan ◽  
Noor Gul ◽  
Irfan Uddin ◽  
Su Min Kim ◽  
...  

In a cognitive radio (CR), opportunistic secondary users (SUs) periodically sense the primary user’s (PU’s) existence in the network. Spectrum sensing of a single SU is not precise due to wireless channels and hidden terminal issues. One promising solution is cooperative spectrum sensing (CSS) that allows multiple SUs’ cooperation to sense the PU’s activity. In CSS, the misdetection of the PU signal by the SU causes system inefficiency that increases the interference to the system. This paper introduces a new category of a malicious user (MU), i.e., a lazy malicious user (LMU) with two operating modes such as an awakened mode and sleeping mode. In the awakened mode, the LMU reports accurately the PU activity like other normal cooperative users, while in the sleeping mode, it randomly reports abnormal sensing data similar to an always yes malicious user (AYMU) or always no malicious user (ANMU). In this paper, statistical analysis is carried out to detect the behavior of different abnormal users and mitigate their harmful effects. Results are collected for the different hard combination schemes in the presence of the LMU and opposite categories of malicious users (OMUs). Simulation results collected for the error probability, detection probability, and false alarm at different levels of the signal-to-noise ratios (SNRs) and various contributions of the LMUs and OMUs confirmed that out of the many outlier detection tests, the median test performs better in MU detection by producing minimum error probability results in the CSS. The results are further compared by keeping minimum SNR values with the mean test, quartile test, Grubbs test, and generalized extreme studentized deviate (GESD) test. Similarly, performance gain of the median test is examined further separately in the AND, OR, and voting schemes that show minimum error probability results of the proposed test as compared with all other outlier detection tests in discarding abnormal sensing reports.


1977 ◽  
Vol 25 (10) ◽  
pp. 1120-1127 ◽  
Author(s):  
Yih-Chyun Jenq ◽  
J. Thomas ◽  
B. Liu

2014 ◽  
Vol 556-562 ◽  
pp. 4293-4296 ◽  
Author(s):  
Lv Jun Li

We present a bound for estimating the minimum-error probability of ambiguous discrimination between any m quantum operations. There are only Kraus-operators and aprioriprobabilities of the discriminated quantum operations in this bound, and which has nothing to do with the input states. To a certain extent, we generalize the bound on the minimum-error probability for ambiguous discrimination from mixed states to quantum operations.


Sign in / Sign up

Export Citation Format

Share Document