On Fri, 21 Apr 2000, Adam Whitehead wrote:
Hi,
I've made the document available on the web at
http://www.audiophilez.com/layer3.doc
for those who want it.
Probably Adam will do it also, but if you want it in zip (228K):
http://telin.rug.ac.be/~pds/mpeg_audio/xlame/layer3.zip
But
On Tue, 18 Apr 2000 [EMAIL PROTECTED] wrote:
For those that care
I do, IMHO layer II is still high(est) quality, high yet nicely
reduced kbps, rel. fast, and, no lots-of-options compression ;)
toolame02f layer II encoder released. Did a little bit of code
cleaning and
On Wed, 15 Dec 1999, Gabriel Bouvigne wrote:
Page 21 of the iso doc: "The decoder is also not required to support
bitrates higher than 4482kbps, 384kbps, 320kbps in respect to Layer I, II
and III when in free format mode"
Does this mean than constant bitrates higher than 320kbps can be
On Fri, 3 Dec 1999, Mathew Hendry wrote:
From: "Acy Stapp" [EMAIL PROTECTED]
I unfortunately can't get VTune to work reliably on LAME.
If someone wants to point me toward any other math-intensive
inner loops I will be glad to optimize those as well.
The other big one is the FFT
On Mon, 8 Nov 1999, Bill Eldridge wrote:
I was reading in one source that you can
1) convert MP L3 to MP L2 in the digital
domain without going analog
2) that MP L2 (l3?) gain cross-fades can be
done in digital domain by adjusting sub-band
parameters.
Anyone have more info on how this
Hi,
I did not really get to do what I wanted to this weekend :( , and this
week I will have very little time left, and next week I will be in Japan
for one week,
but my patches, or rather comments ((#):see below), to tooLAME
**which, I hope, could/should also be useful for LAME** are on:
On Fri, 15 Oct 1999, Richard A. Smith wrote:
Also as reply to: Gabriel Bouvigne - France
[...]
I think this is true (for a single pointer loop, for multiple/too many
pointers I think Takehiro is right, see earlier postings; pointers
can no longer be alloc'ed to registers, so memory is needed
On Mon, 18 Oct 1999 [EMAIL PROTECTED] wrote:
Hi all, (A bunch of stuff on FFTs)
Has anyone done any speed comparisons between
- the FHT based code lame has now (which is damn fine)
- "fastest fourier transform in the west" fftw (www.fftw.org)
- pentium
On Sat, 16 Oct 1999, Mathew Hendry wrote:
As a suggestion keep the subject relevant so that people can filter if
they
want.
Sorry, copied from answer in other thread (toolame1d):
http://www.oreilly.com/catalog/hpc2/toc.html
Quite a good page:
On Mon, 18 Oct 1999, DAVID BALAZIC wrote:
From: Takehiro Tominaga [EMAIL PROTECTED]
[...]
An input file (like .wav file) has only 16 bit precision and dynamic
range(this value is selected from human hearing ability). And the
IEEE768 says single precision has 24 bit precision.
Current
On Fri, 15 Oct 1999, Gabriel Bouvigne wrote:
With modern compilers, you don't generally need to bother with replacing
for (i = 0; i len; ++i)
sum += array[i];
with
for (p = array, endp = array + len; p endp; ++p)
sum += *p;
Any compiler worth its salt will do
On Thu, 14 Oct 1999, Takehiro Tominaga wrote:
[...]
P Also, and I haven't seen this anywhere (did not really look ?)
P the enwindow is "almost symmetrical" ! ie c[0..256] = -
P c[512..256] + some special cases (@ 64*n-values) check the
P table you'll see.
This is also
On Thu, 14 Oct 1999 [EMAIL PROTECTED] wrote:
hey all,
just tidied up the source a bit, renamed some things for easier viewing
and released toolame01d (optimized layerII) code. www.cryogen.com/mikecheng
Anyone who wants a break from hardcore LAME coding is welcome to chill
to
On Tue, 12 Oct 1999, Mark Taylor wrote:
Hi Patrick,
Please read http://telin.rug.ac.be/~pds/mpeg_audio/xlame/
((Might become)) not only interesting for toolame but also for lame in the
future, well, I hope so,
A couple of quick thoughts:
I believe CRC is working correctly.
On Wed, 13 Oct 1999 [EMAIL PROTECTED] wrote:
On 12-Oct-99 Patrick De Smet wrote:
On Tue, 12 Oct 1999 [EMAIL PROTECTED] wrote:
layer II bitalloc related:
- II_a_bit_allocation: replace the exhaustive loop search for a
maximum value. some sort of tree or list? (I tried putting
15 matches
Mail list logo