DocumentCode
1412998
Title
Generalization of Gartner-Ellis theorem
Author
Chen, Po-Ning
Author_Institution
Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
Volume
46
Issue
7
fYear
2000
fDate
11/1/2000 12:00:00 AM
Firstpage
2752
Lastpage
2760
Abstract
A generalization of the Gartner-Ellis theorem for arbitrary random sequences is established. It is shown that the conventional formula of the large deviation rate function, based on the moment generating function techniques, fails to describe the general (possibly nonconvex) large deviation rate for an arbitrary random sequence. An (nonconvex) extension formula obtained by twisting the conventional large deviation rate function around a continuous functional is therefore proposed. As a result, a new Gartner-Ellis upper bound is proved. It is demonstrated by an example that a tight upper bound on the large deviation rate of an arbitrary random sequence can be obtained by choosing the right continuous functional, even if the true large deviation rate is not convex. Also proved is a parallel extension of the Gartner-Ellis lower bound with the introduction of a new notion of Gartner-Ellis set within which the upper bound coincides with the lower bound (for countably many points)
Keywords
channel capacity; information theory; sequences; Gartner-Ellis theorem; arbitrary random sequences; continuous functional; large deviation rate function; moment generating function techniques; nonconvex extension formula; parallel extension; upper bound; Channel coding; Error analysis; Probability; Random sequences; Shape; Statistics;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.887893
Filename
887893
Link To Document