DOC PREVIEW
Berkeley ELENG 122 - Lecture notes

This preview shows page 1-2-3-4 out of 11 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Claude Shannon – In MemoriamOutlineClaude ShannonEntropySource CodingSource Coding (c’d)Slide 7Channel CapacityChannel Capacity (c’d)Slide 10Separation TheoremUCBClaude Shannon – In MemoriamJean WalrandU.C. Berkeleywww.eecs.berkeley.edu/~wlrUCBOutlineClaude ShannonEntropySource CodingChannel CodingSeparation TheoremUCBClaude Shannon4/30/1916 – 2/24/200137: Boolean Algebra  Logical Circuits48: Mathematical Theory of CommunicationsUCBEntropyHow much information is required to convey the value of a random variable?Key insight: The quantity of information is related to the uncertainty of that value.Example 1: Coin Flip = One bit of informationExample 2: Two coin flips = 2 bitsExample 3: N equally likely values = log2(N) bitsUCBSource CodingHow do we encode the values to be able to convey them with the minimum number of bits?Key idea: Look at sequence of outcomesX(1), X(2), …, X(n) where X(m) is in {1, 2, …, K}For n large, there are only 2nH equally likely sequences where H is smaller than log2KIn fact, H = -  pi log2(pi)UCBSource Coding (c’d)Example:P(1) = p = 1 – P(0)H = - p log2p – (1 – p)log2 (1 – p)Hp100.5 10UCBSource Coding (c’d)Thus, for large n:2n n-bit words2nH equallylikely n-bit words.UCBChannel CapacityQuestion: How fast can one transmit bits reliably through a noisy channel?Naïve answer: No reliable transmission is possible.Shannon’s formulation: What is the possible rate, in the long term, if one wants the bit error rate to be arbitrarily small?Shannon’ s answer: Channel CapacityUCBChannel Capacity (c’d)Example:0101Sent Receivedpp1 - p1 - pCp100.5 10UCBChannel Capacity (c’d)Justification: Choose 2nK n-bit words (fair coin flips)2n equally likelyn-bit words2nH equallylikely n-bit words forone wordsent.=> 2n/2nH = 2n(1 – H) = 2nC distinguishable codewordsUCBSeparation TheoremSource with Entropy H bits per symbolChannel with Capacity C bpsCan send C/H symbols per secondsFirst code symbols (n symbols => nH bits)Then code channel(send bits with suitable codewords)Hence: Separate source and channel


View Full Document

Berkeley ELENG 122 - Lecture notes

Documents in this Course
Lecture 6

Lecture 6

22 pages

Wireless

Wireless

16 pages

Links

Links

21 pages

Ethernet

Ethernet

10 pages

routing

routing

11 pages

Links

Links

7 pages

Switches

Switches

30 pages

Multicast

Multicast

36 pages

Switches

Switches

18 pages

Security

Security

16 pages

Switches

Switches

18 pages

Lecture 1

Lecture 1

56 pages

OPNET

OPNET

5 pages

Lecture 4

Lecture 4

16 pages

Ethernet

Ethernet

65 pages

Models

Models

30 pages

TCP

TCP

16 pages

Wireless

Wireless

48 pages

Load more
Download Lecture notes
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture notes 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?