Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

Adaptive Huffman codes

Status
Not open for further replies.
F

fm_com_28

Full Member level 1
Joined
Feb 2, 2006
Messages
99
Helped
11
Reputation
22
Reaction score
7
Trophy points
1,288
Location
Fayoum, Egypt
Activity points
1,916
Dear,
I know what Huffman code is. But what is the adaptive huffman code? does it has other names than "adaptive huffman"? what is the difference between it and Lemplel-Ziv codes?
 

adaptive Huffman is adaptive Huffman (also called Dynamic Huffman coding)
**broken link removed**
we could just re-make the Huffman tree every time a symbol is sent

but more effective for implementation is "arithmetic coding" as "adaptive Huffman" for implementation is simply a binary tree, but binary tree is not so fast with respect to "add node" operation

LZW is not the same :)
**broken link removed**
 

    F

    fm_com_28

    Points: 2
    Helpful Answer Positive Rating
Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top