Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Rate–distortion theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Connecting rate-distortion theory to channel capacity == Suppose we want to transmit information about a source to the user with a distortion not exceeding ''D''. Rate–distortion theory tells us that at least <math>R(D)</math> bits/symbol of information from the source must reach the user. We also know from Shannon's channel coding theorem that if the source entropy is ''H'' bits/symbol, and the [[channel capacity]] is ''C'' (where <math>C < H</math>), then <math>H-C</math> bits/symbol will be lost when transmitting this information over the given channel. For the user to have any hope of reconstructing with a maximum distortion ''D'', we must impose the requirement that the information lost in transmission does not exceed the maximum tolerable loss of <math>H-R(D)</math> bits/symbol. This means that the channel capacity must be at least as large as <math>R(D)</math>.<ref name="BergerRateDistortion">{{cite book |title=Rate Distortion Theory: A Mathematical Basis for Data Compression |publisher=Prentice Hall |first=Toby |last=Berger |year=1971 |url=https://archive.org/details/ratedistortionth0000berg/ |url-access=registration |lccn=75-148254 |isbn=978-0-13-753103-5 |oclc=156968}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)