摘要 :
In this paper, we derive the exact pairwise error probabilities (PEPs) of various quasi-orthogonal space-time block codes (QO-STBCs) using the moment generating function. By classifying the exact PEPs of QO-STBCs into three types,...
展开
In this paper, we derive the exact pairwise error probabilities (PEPs) of various quasi-orthogonal space-time block codes (QO-STBCs) using the moment generating function. By classifying the exact PEPs of QO-STBCs into three types, we derive the closed-form expression for each type of PEP. Based on these closed-form expressions, we obtain the union bounds on the symbol error probability and bit error probability for QPSK modulation. Through simulation, it is shown that these union bounds are quite tight.
收起
摘要 :
We address the problem of communicating over channels subject to intentional interference. The problem is described in terms of a two-person zero-sum game with the probability of error as the pay-off function. We give upper and lo...
展开
We address the problem of communicating over channels subject to intentional interference. The problem is described in terms of a two-person zero-sum game with the probability of error as the pay-off function. We give upper and lower bounds on the error probability for antijamming codes when used over the Euclidean channel.
收起
摘要 :
Quantum illumination is a technique for detecting the presence of a target in a noisy environment by means of a quantum probe.We prove that the two-mode squeezed vacuum state is the optimal probe for quantum illumination in the sc...
展开
Quantum illumination is a technique for detecting the presence of a target in a noisy environment by means of a quantum probe.We prove that the two-mode squeezed vacuum state is the optimal probe for quantum illumination in the scenario of asymmetric discrimination, where the goal is to minimize the decay rate of the probability of a false positive with a given probability of a false negative. Quantum illumination with two-mode squeezed vacuum states offers a 6 dB advantage in the error probability exponent compared to illumination with coherent states. Whether more advanced quantum illumination strategiesmay offer further improvements had been a longstanding open question. Our fundamental result proves that nothing can be gained by considering more exotic quantum states, such as, e.g., multimode entangled states. Our proof is based on a fundamental entropic inequality for the noisy quantum Gaussian attenuators.We also prove that without access to a quantum memory, the optimal probes for quantum illumination are the coherent states.
收起
摘要 :
Radiation-induced soft error is a significant reliability issue in nanoscale technology nodes. As the sequential registers are major contributors to the system soft error rate, accurate analysis of their vulnerabilities at early d...
展开
Radiation-induced soft error is a significant reliability issue in nanoscale technology nodes. As the sequential registers are major contributors to the system soft error rate, accurate analysis of their vulnerabilities at early design phases is essential for cost-efficient error mitigation. In this paper, a novel approach is proposed to quantify the soft error vulnerabilities of the registers in control paths at Register-Transfer Level (RTL). By modeling the control path as a state transition system, formal probabilistic model checking is adopted to compute the register vulnerabilities by taking the workload dependency into consideration. Efficient RTL abstraction and model simplification techniques are proposed to achieve an exponential reduction of the state space, enabling our methodology to analyze large control modules in a typical embedded processor. The experimental results show the effectiveness of the proposed techniques, which can successfully quantify the non-uniform register vulnerabilities in RTL designs.
收起
摘要 :
The evaluation of error probabilities in digital communication systems is often amenable to computing a probability of the form P(/spl Delta//spl les/0), where /spl Delta/ is a random variable whose probability distribution is kno...
展开
The evaluation of error probabilities in digital communication systems is often amenable to computing a probability of the form P(/spl Delta//spl les/0), where /spl Delta/ is a random variable whose probability distribution is known. As an example, the pairwise error probability of coded modulations can be expressed in this form. The authors advocate an exceedingly general numerical method for the calculation of P(/spl Delta//spl les/0) based on Gauss-Chebyshev quadratures, which combines simplicity with accuracy.
收起
摘要 :
A novel, mathematically tractable expression for evaluation of the average chip error probability (CEP) in the networks based on 1EEE802.15.4 standard, operating in the 2450 MHz band, in the presence of α-η-μ fading, interferen...
展开
A novel, mathematically tractable expression for evaluation of the average chip error probability (CEP) in the networks based on 1EEE802.15.4 standard, operating in the 2450 MHz band, in the presence of α-η-μ fading, interference and additive white Gaussian noise (AWGN) is presented. The expression is validated by Monte Carlo simulations and represents the foundation for performance evaluation of the mentioned type of networks operating over any type of non-line-of-sight (NLoS) channel. In addition, we have demonstrated practical usage of the derived average CEP expression by evaluating the average packet error probability (PEP) for the above-described network operating conditions.
收起
摘要 :
We study the problem of mismatched binary hypothesis testing between i.i.d. distributions. We analyze the tradeoff between the pairwise error probability exponents when the actual distributions generating the observation are diffe...
展开
We study the problem of mismatched binary hypothesis testing between i.i.d. distributions. We analyze the tradeoff between the pairwise error probability exponents when the actual distributions generating the observation are different from the distributions used in the likelihood ratio test, sequential probability ratio test, and Hoeffding’s generalized likelihood ratio test in the composite setting. When the real distributions are within a small divergence ball of the test distributions, we find the deviation of the worst-case error exponent of each test with respect to the matched error exponent. In addition, we consider the case where an adversary tampers with the observation, again within a divergence ball of the observation type. We show that the tests are more sensitive to distribution mismatch than to adversarial observation tampering.
收起
摘要 :
In erasures-and-errors decoding, we are concerned not only with the erasure probability and undetected-error probability but with its complexity. There are situations for erasrues-and-errors decoding given different decision stati...
展开
In erasures-and-errors decoding, we are concerned not only with the erasure probability and undetected-error probability but with its complexity. There are situations for erasrues-and-errors decoding given different decision statistics and given different tolerable complexities, and the interrelationships between decision schemes have not been considered seriously. In this report we try to compare decision scheme with simulation for a BSC. As a result, it seems that the decision schemes give basically the same tradeoffs between the erasure and undetected-error probabilities.
收起
摘要 :
We define the first match function where is a finite alphabet. For two copies of , this function gives the minimum number of steps one has to slide one copy of to get a match with the other one. For ergodic positive entropy pro...
展开
We define the first match function where is a finite alphabet. For two copies of , this function gives the minimum number of steps one has to slide one copy of to get a match with the other one. For ergodic positive entropy processes, Saussol and coauthors proved the almost sure convergence of . We compute the large deviation properties of this function. We prove that this limit is related to the Rényi entropy function, which is also proved to exist. Our results hold under a condition easy to check which defines a large class of processes. We provide some examples.
收起
摘要 :
Necessary conditions of a digital modulation signal are investigated in order to estimate its maximum bit error probability (BEP) by using the amplitude probability distribution (APD) of an interfering noise. It was found that the...
展开
Necessary conditions of a digital modulation signal are investigated in order to estimate its maximum bit error probability (BEP) by using the amplitude probability distribution (APD) of an interfering noise. It was found that the waveform difference between any two symbols needs to be able to be normalized to have an identical APD and amplitude spectrum. Moreover, the spectrum needs to match the frequency selectivity for the APD measurement with a tolerable deviation. Some modulation schemes are discussed with respect to the conditions.
收起
原文获取