Probability of error, equivocation, and the Chernoff bound

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probability of error, equivocation, and the Chernoff bound

-I4 ET US consider the usual decision-theory problem of classifying an observation X ss coming from one of m possible classes (hypotheses) C,, CZ, * , C,. Let nl, .a * , 7~,,, denote the a priori probabilities on the hypotheses, and let p,(x), * * * , p,(x) denote the conditional probability density functions given the true hypothesis. Let us assume that these are known. Then it is well knoti t...

متن کامل

Chernoff Bound on the Probability of Error for Combined Linear-decision Feedback Sequence Estimation

Decision feedback sequence estimation (DFSE) is a reduced state alternative to maximum likelihood sequence estimation (MLSE). One of the most popular technique to improve the performance of DFSE is to process the received signal by a linear pre-filter prior to DFSE. This technique is referred to as combinedlinear DFSE (CLDFSE). In this paper, we derive a tight upper bound on the error performan...

متن کامل

3 Chernoff Bound

Before we venture into Chernoff bound, let us recall Chebyshev's inequality which gives a simple bound on the probability that a random variable deviates from its expected value by a certain amount.

متن کامل

On an Improvement over Rényi's Equivocation Bound

We consider the problem of estimating the probability of error in multi-hypothesis testing when MAP criterion is used. This probability, which is also known as the Bayes risk is an important measure in many communication and information theory problems. In general, the exact Bayes risk can be difficult to obtain. Many upper and lower bounds are known in literature. One such upper bound is the e...

متن کامل

A Reversion of the Chernoff Bound

This paper describes the construction of a lower bound for the tails of general random variables, using solely knowledge of their moment generating function. The tilting procedure used allows for the construction of lower bounds that are tighter and more broadly applicable than existing tail approximations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 1970

ISSN: 0018-9448

DOI: 10.1109/tit.1970.1054466