Group 7 - Cliff Knuelle Marc Jesse Devin Coons...

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

View Full Document Right Arrow Icon
Cliff Knuelle Marc Jesse Devin Coons
Background image of page 1

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

View Full DocumentRight Arrow Icon
Data Compression Compression is useful because it helps reduce the consumption of resources, such as disk space or bandwidth. l Lossless compression allows the exact original data to be reconstructed from the compressed data, without any data loss. l Encoding algorithms rely on statistical probability that certain data will occur.
Background image of page 2
Static Coding Static coding uses a static dictionary, which means each item in the file is encoded the same way. l Typical implementations send the encoding table to the decoder as part of the encoded file, which cannot be modified later. l The tree must be sent at the beginning of the compressed file, causing some overhead. l If a section of code uses a character more heavily than another section, it will not be able to adjust during that section. l If information is streaming in live, the entire file will not be available to analyze for character frequency.
Background image of page 3

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

View Full DocumentRight Arrow Icon
Adaptive Coding The solution to these problems is adaptive coding.
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/24/2011 for the course EEL 3531 taught by Professor Llewelyn during the Spring '09 term at University of Florida.

Page1 / 10

Group 7 - Cliff Knuelle Marc Jesse Devin Coons...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online