Computer Science – Information Theory
Scientific paper
2011-07-15
Computer Science
Information Theory
21 pages, submitted for publication
Scientific paper
Motivated by the Markov chain Monte Carlo (MCMC) approach to the compression of discrete sources developed by Jalali and Weissman, we propose a lossy compression algorithm for analog sources that relies on a finite reproduction alphabet, which grows with the input length. The algorithm achieves, in an appropriate asymptotic sense, the optimum Shannon theoretic tradeoff between rate and distortion, universally for stationary ergodic continuous amplitude sources. We further propose an MCMC-based algorithm that resorts to a reduced reproduction alphabet when such reduction does not prevent achieving the Shannon limit. The latter algorithm is advantageous due to its reduced complexity and improved rates of convergence when employed on sources with a finite and small optimum reproduction alphabet.
Baron Dror
Weissman Tsachy
No associations
LandOfFree
An MCMC Approach to Universal Lossy Compression of Analog Sources does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An MCMC Approach to Universal Lossy Compression of Analog Sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An MCMC Approach to Universal Lossy Compression of Analog Sources will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-225741