Data Compression

3 downloads 287 Views 66KB Size Report
Data Compression. Page 2. Huffman Example. ASCII. A 01000001. B 01000010. C 01000011. D 01000100. E 01000101. A 01. B 00
Data Compression

ASCII A B C D E

01000001 01000010 01000011 01000100 01000101

Huffman Example A B C D E

01 0000 0001 001 1

Prefix Property

A B C D

0 1 01 11

A B C D

0 10 110 111

Step 1: Frequency Analysis String: “ECEABEADCAEDEEEECEADEEEEEDB AAEABDBBAAEAAACDDCCEABEEDCB EEDEAEEEEEAEEDBCEBEEADEAEEDA EBCDEDEAEEDCEEAEEE” character

A

B

C

D

E

frequency

0.2

0.1

0.1

0.15

0.45

Step 2: Forest of Single Trees

B

0.1

C

0.1

D 0.15

A

0.2

E

0.45

Step 3: Combine Trees

0.2

B

0.1

C

0.1

D 0.15

A

0.2

E

0.45

Step 3: Combine Trees

0.35

0.2

B

0.1

C

0.1

D 0.15

A

0.2

E

0.45

Step 3: Combine Trees 0.55

0.35

0.2

B

0.1

C

0.1

D 0.15

A

0.2

E

0.45

Step 3: Combine Trees

1.0

0.55

0.35

0.2

B

0.1

C

0.1

D 0.15

A

0.2

E

0.45

Step 4: Traverse Tree

1.0

0 0.55

0

1

0.35

0

1

0.2

0 B

1

1 0.1

C

0.1

D 0.15

A

0.2

E

0.45