Huffman Coding - EEL 3531: Information Theory Spring 2009...

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

View Full Document Right Arrow Icon
EEL 3531: Huffman Coding Page 1 Dr. Mark Llewellyn © EEL 3531: Information Theory Spring 2009 Huffman Coding School of Electrical Engineering and Computer Science University of Central Florida Instructor : Dr. Mark Llewellyn [email protected] HEC 236, 407-823-2790 http://www.cs.ucf.edu/courses/eel3531/spr2009
Background image of page 1

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

View Full DocumentRight Arrow Icon
EEL 3531: Huffman Coding Page 2 Dr. Mark Llewellyn © Huffman Coding Huffman coding is an entropy encoding algorithm used for lossless data compression codes. Huffman codes were developed by David A. Huffman while he was a Ph.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum- Redundancy Codes". Huffman coding is optimal for a symbol-by-symbol coding (i.e. a stream of unrelated symbols) with a known input probability distribution. As such, Huffman codes play an important role in data communications, speech coding, and video and image compression.
Background image of page 2
EEL 3531: Huffman Coding Page 3 Dr. Mark Llewellyn © Huffman Coding Huffman codes are optimal in the sense that they can deliver code word sequences which asymptotically approach the source entropy. They also have practical implementations for both the encoder and decoder. Huffman codes generally have variable-length code words. Huffman codes belong to a class of data compression codes known as prefix codes . A prefix code has, among other properties, the ability to be self-punctuating.
Background image of page 3

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

View Full DocumentRight Arrow Icon
EEL 3531: Huffman Coding Page 4 Dr. Mark Llewellyn © Huffman Coding To understand what this means, consider the following
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 / 13

Huffman Coding - EEL 3531: Information Theory Spring 2009...

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