huffman.m

Huffman

Description

[CODE,COMPRESSION]=HUFFMAN5(P)

 P is the probability (or number of occurences) of each alphabet symbol
 CODE gives the huffman code in a string format of ones and zeros
 COMPRESSION gives the compression rate

 Huffman5 works by first building up a binary tree (eg p =[ .5 .2 .15 .15])

 Such that the tree always terminates at an alphabet symbol and the symbols furthest away from the root have the lowest probability. The branches at each level are labeled 0 and 1.
 
For this example CODE would be
     1
     00
     010
     011
 and the compression rate 1.1111

• MATLAB release: MATLAB 5.2 (R10)

[Santhosh Nadig]

Its a very good and straight forward implementation. Lacks a few comments in 'getcodes2' funciton.

[kapil chaudhari]

This is a great code. It helped me very
much.

[anon anon]

good

[Sridhar Bhat]

 

[Yong Li]

A small bug in it.
line37 should be:
compression=ceil(log(length(p))/log(2))/ (sum(code' ~= ' ',1)*p);
in case of only [0;1] in code

[vinay A.P.]

itz good filter design.it would be still wonderful if i would get the "CODE FOR ADAPTIVE NOISE CANCELLER IN MATLAB"
 which we are using it in voice password system
     thx sir
          vinay