DOC PREVIEW
Berkeley ELENG 122 - Source Coding

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

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 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 16 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 16 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 16 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 16 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Source CodingOutlineCompressionHuffman EncodingHuffman Encoding(continued)Slide 6Lempel-ZivLempel-Ziv(continued)AudioAudio (c’d)Slide 11Slide 12Slide 13Slide 14VideoVideo (cd)UCBSource CodingJean WalrandEECSUCBOutlineCompressionLosless:HuffmanLempel-ZivAudio:ExamplesDifferentialADPCMSUBBANDCELPVideo:Discrete Cosine TransformMotion CompensationUCBCompressionGoal:Reduce the number of bits to encode sourceLossless: For dataLossy: For voice, videoApproaches:UCBHuffman EncodingLosslessKey Idea: Use shorter code words for more frequent symbolsEX1:UCBHuffman Encoding(continued)EX2:UCBHuffman Encoding(continued)If the symbols are independent and identically distributed, the Huffman encoding is the prefix-free code with the minimum average number of bits.Note: The Shannon encoding requires fewer bits, but requires encoding large blocks of symbols.Both codes assume that the distribution is known.UCBLempel-ZivLosslessSymbols are not independentDistribution is not knownWant to minimize the average number of bitsTypical application: any fileApproach: Build dictionary and replace string with location of prefix in the dictionaryUCBLempel-Ziv(continued)Example:UCBAudioExamples:Speech:PCM 64kbpsADPCM 32-64kbpsSBC 16-32kbpsVSELP-CELP 2.4-8kbpsAudio:PCM 1400kbpsMPEG 48-384kbpsUCBAudio (c’d)Differential Encoding (also used for Video): Key Idea is that differences between successive samples may be smallDifficulty: Error PropagationUCBAudio (c’d)Differential Encoding (c’d)UCBAudio (c’d)ADPCM: Adaptive Differential PCMPredict next value, encode errorUCBAudio (c’d)Sub-Band Coding: Improves performanceUCBAudio (c’d)CELP (Code Excited Linear Predictor)UCBVideoDiscrete Cosine TransformObjective: Extract “Visible Information”f(x, y) = m,n F(m, n) cos(mx) cos(ny)UCBVideo (cd)Motion CompensationIdea: Track motion of pictureEncode (motion vector,


View Full Document

Berkeley ELENG 122 - Source Coding

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 Source Coding
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 Source Coding 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 Source Coding 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?