Arithmetic Distribution Matching
نویسندگان
چکیده
In this work, arithmetic distribution matching (ADM) is presented. ADM invertibly transforms a discrete memoryless source (DMS) into a target DMS. ADM can be used for probabilistic shaping and for rate adaption. Opposed to existing algorithms for distribution matching, ADM works online and can transform arbitrarily long input sequences. It is shown analytically that as the input length tends to infinity, the ADM output perfectly emulates the target DMS with respect to the normalized informational divergence and the entropy rate. Numerical results are presented that confirm the analytical bounds.
منابع مشابه
Exact Analysis of Pattern Matching Algorithms with Probabilistic Arithmetic Automata
We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer-Moore, Horspool, Backward DAWG Matching, Backward Oracle Matching, and more. In particular, we show how to efficiently obtain the distribution of such an algorithm’s running time cost for any given pattern in a random text model, which can be quite general, from simple uniform ...
متن کاملAn Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms
We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer–Moore, Horspool, Backward DAWG Matching, Backward Oracle Matching, and more. In particular, we develop an algorithm that efficiently computes the distribution of a pattern matching algorithm’s running time cost (such as the number of text character accesses) for any given patte...
متن کاملExact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata
We define deterministic arithmetic automata (DAAs) and connect them to a framework called probabilistic arithmetic automata (PAAs) [9]. We use DAAs and PAAs to compute the entire exact probability distribution (in contrast to, e.g., asymptotic expectation and variance) of the number X of text characters accessed by the Horspool or Sunday pattern matching algorithms when matching a fixed pattern...
متن کاملArithmetization of distributions and linear goal programming
Linear goal programming can be used as a complementary technique when local moment matching method up to the second moment gives some negative mass. This could happen when manipulating a discrete or mixed type severity distribution. In that case we can avoid a simple retreat to the first moment and look for an arithmetic distribution with equal mean and the second moment closest to that of the ...
متن کاملA Lower Bound for Noncommutative Monotone Arithmetic Circuits
We consider arithmetic circuits over the semiring ((; min; concat) and show that such circuits require super-polynomial size to compute the lexicographically minimum perfect matching of a bipartite graph. By deening monotone analogues of optimization classes such as OptP, OptL and OptSAC 1 using the monotone analogues of their arithmetic circuit characterizations 13, 1], our lower bound implies...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1408.3931 شماره
صفحات -
تاریخ انتشار 2014