# lec07 - Optimal Merging Of Runs 22 22 13 7 4 3 6 15 9 4 7 3...

This preview shows pages 1–9. Sign up to view the full content.

Optimal Merging Of Runs 4 3 6 9 4 3 6 9 7 15 22 7 13 22

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Weighted External Path Length 4 3 6 9 WEPL(T) = Σ (weight of external node i) * (distance of node i from root of T) WEPL(T) = 4 * 2 + 3*2 + 6*2 + 9*2 = 44 7 15 22
Weighted External Path Length WEPL(T) = Σ (weight of external node i) * (distance of node i from root of T) WEPL(T) = 4 * 3 + 3*3 + 6*2 + 9*1 = 42 4 3 6 9 7 13 22

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Other Applications Message coding and decoding. Lossless data compression.
Message Coding & Decoding Messages M 0 , M 1 , M 2 , …, M n-1 are to be transmitted. The messages do not change. Both sender and receiver know the messages. So, it is adequate to transmit a code that identifies the message (e.g., message index). M i is sent with frequency f i . Select message codes so as to minimize transmission and decoding times.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Example n = 4 messages. The frequencies are [2, 4, 8, 100] . Use 2 -bit codes [00, 01, 10, 11] . Transmission cost = 2*2 + 4*2 + 8*2 + 100*2 = 228 . Decoding is done using a binary tree.
Example Decoding cost = 2*2 + 4*2 + 8*2 + 100*2 = 228 = transmission cost = WEPL 2 4 8 100 0 1 1 0 M 3 M 0 M 1 M 2

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Example Every binary tree with n external nodes defines a code set for n messages.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/07/2010 for the course COT 5536 taught by Professor Sartajsahani during the Spring '10 term at University of Florida.

### Page1 / 25

lec07 - Optimal Merging Of Runs 22 22 13 7 4 3 6 15 9 4 7 3...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online