> Does that means that:
> 
> a: if encoding time is not important, it should be possible to use a full
> brute search
> instead of the pre-computed tree?

Yes.  Brute forcing the LSP fit is the most beneficial part and actually not
likely to increase encoding time a huge amount (not a factor of 2 anyway).

> b: if using the pre-computed tree, the same codebook is always used?

I'm not sure what you mean... The pre-computed tree is just an optimization to
shorten search time on a given codebook.  Each codebook has a custom tree
generated for it.

> c: you're back from holidays?

Yes, hi :-)

Monty

--
MP3 ENCODER mailing list ( http://geek.rcc.se/mp3encoder/ )

Reply via email to