Huffman Coding : -

1.9kviews

Huffman Coding : -

written 8.1 years ago by

teamques10 ★ 69k

modified 2.4 years ago by

sagarkolekar ★ 11k

digital communication

ADD COMMENT EDIT

1 Answer

3views

written 8.1 years ago by

teamques10 ★ 69k

enter image description here

$l_{avg} = \sum\limits_{i = 1}^n f_i l_i$

Where $l_i$ = actual codeword length of symbol.

$L_{avg} = (0.4)1 + (0.19) \times 3 + (0.16) \times 3 + (0.15)3 + (0.1) \times 3\\ L_{avg} = 2.2 bit/symbol\\ H = \sum\limits_{i = 1}^{n = 5} P_i log = \bigg( \dfrac{1}{P_i} \bigg)\\ H …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.