This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 193.83 156.64 138.06 118.96 Figure 2. Variance change of DCT coefficient ( , and k= 0, 1,…, 7) 3 II. Huffman Coding in a Channel with Errors (2b) Once a Huffman decoder loses sync, the decoder will of course continue to decode symbols. These symbols will be random, but will have the same PDF as the original symbol set (assuming the source statistics are accurately modeled). This means that common (short) codewords will be frequently generated at the decoder output, and that the “start of codeword” pointer will generally advance in small steps. In a relatively short amount of time (several codewords) this pointer will by chance fall at the correct location, and resynchronization will be re-established. Assuming no more errors, all subsequent codes will be correctly decoded. Average resync time: about 2-3 symbols Average resync time in terms of symbol offset: about 2 symbols (2c) p(symbol)...
View Full Document
This note was uploaded on 04/19/2011 for the course EE 211A taught by Professor Villasenor during the Fall '10 term at UCLA.
- Fall '10