On CNET: Updating your software just got easier
BNET Business Network:
BNET
TechRepublic
ZDNet

FREE Registration is required

Overview:

This paper studies the rate distortion function of the i.i.d sequence of multiplications of a Bernoulli p random variable and a gaussian random variable ~ N (0,1). The paper uses a new technique in the derivation of the lower bound in which they establish the duality between channel coding and lossy source coding in the strong sense. The paper improves the lower bound on the rate distortion function over the best known lower bound by plog21/2if distortion D is small. This has some interesting implications on sparse signals where p is small since the known gap between the lower and upper bound is H (p).

(Is this item miscategorized? Does it need more tags? Let us know.)

Format:PDFSize:329 KB
Date:Feb 2009
Pages:33
advertisement

White Papers, Webcasts, and Resources

Featured Training Courses

Returning users: Log In Here!

Already registered on BNET, TechRepublic, or ZDNet? Simply log in.

Free Membership: Sign Up Now!

Sign up for a free membership today and get instant and unlimited access to one of the largest databases of white papers, webcasts, and casestudies anywhere. Your FREE membership allows you to:

  • Download an unlimited amount of content, including classic and current white papers, case studies, webcasts and more
  • Track content on your chosen topics of interest
  • Receive targeted email alerts when your favorite content is added
  • Save content for future reading
  • Receive our member newsletter

When you register to access this library, you allow us to share your information with companies that produce products or services featured in the library--so that such companies may contact you with information and offers regarding their products and services. This enables us to keep the library a free service. As a library registrant, you will receive a complimentary subscription to the ZDNet white paper newsletter and e-mail Must-Read News Alerts. You can unsubscribe from these at any time. By clicking the Sign up button, you indicate that you agree to our Terms and Conditions and have read and understand our Privacy Policy (updated).