






Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A class agenda for a data compression lecture at the university of michigan. It covers the lz78/lzw encoding and decoding techniques using huffman tree and trie. The process of creating minheap, trie, and compressing code table, as well as the encoding and decoding methods.
Typology: Exams
1 / 11
This page cannot be seen from the preview
Don't miss anything!







z
Questions on anything
z
Quick Huffman Review
z
z
Specific questions
Review of what we need to do (remem1.) Create minheap class: can have <k2.) Create trie class3.) Read in input data (M&Ms) 4.) Put input data into minheap “keyed
5.) Construct trie (keep pulling off the
6.) When trie is built, we can create the7.) Create compressed code table8.) For encoded data, just use the code
ber this is ONE way):
key,object> paird” by frequency
root of minheap to get pairs)
b
ack onto minheap sometimes!
e codes for each symbol e table to determine what goes where
z
−
Quick review of exam question
z
Magic Cookie: 16-bits
z
z
Original Sym Size: 8-bits (If ASCII,
l S
h
b
l
z
Initial Sym Size*: It is the symbol sstring=256 ,
then initial sym size =
−
Size will increase dynamically
−
Use trie to do the encoding
−
Reserve 2^k-1 symbol for transi
then 8-bits)
h ( f
f
d
ize you start with (If your first code
ition to next symbol size
z
Visit this website for issues regardinstrings
htt
k
l
http://marknelson.us/1989/10/
Strings are stored in a reveRetrieve characters and sto
Retrieve characters and stothem to get the string
g use of stack for getting the decoded 01/l
d
t
i
01/lzw-data-compression/ erse order in our string bufferore them in our stack buffer and popore them in our stack buffer and pop