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

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

View Full Document Right Arrow Icon
Optimal Merging Of Runs 4 3 6 9 4 3 6 9 7 15 22 7 13 22
Background image of page 1

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

View Full DocumentRight Arrow Icon
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
Background image of page 2
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
Background image of page 3

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

View Full DocumentRight Arrow Icon
Other Applications Message coding and decoding. Lossless data compression.
Background image of page 4
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.
Background image of page 5

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

View Full DocumentRight Arrow Icon
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.
Background image of page 6
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
Background image of page 7

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

View Full DocumentRight Arrow Icon
Example Every binary tree with n external nodes defines a code set for n messages.
Background image of page 8
Image of page 9
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 Right Arrow Icon
Ask a homework question - tutors are online