In the FAAD code he has used two methods for Huffman decoding the spectral values (2-step and binary) are there any other methods better than these two ? If no are these the only type of implementation possible ?

by Better.. do you mean, faster ?

Can you kindly refer some faster algorithms as well as some algorithms which require lesser memory(size of the tables)

If using a 3-step method instead of binary for some codebook. It maybe faster than binary and the table size is smaller than 2-step method.

I'm thinking about replacing the binary tables with 3 step tables, I'm not sure if it will be a lot faster and the rewriting of the tables takes a lot of time.

The least memory consuming method is probably the one used in the aac reference code, but it is quite slow.

Menno

im still struggling to understand the 2-step algorithm implemented in faad... can u direct me to a reference which describes the algorithm and explains the concept?