[linux-audio-dev] Re: [Jackit-devel] Re: [linux-audio-user] [ANNOUNCE] jack_convolve-0.0.1
29 Jan
2005
29 Jan
'05
1:48 a.m.
On Fri, 28 Jan 2005 21:26:46 -0800 (PST)
R Parker <rtp405(a)yahoo.com> wrote:
Florian,
Just gave your dry and wet sample a quick listen. It
sounds promising. I'm looking forward to giving it a
more serious run.
Hi,
make sure you get the newest version.. homepage here:
http://www.affenbande.org/~tapas/wiki/admin.php?jack_convolve
tarball[s] here [minor optimization attempts since last tarball]:
http://affenbande.org/~tapas/jack_convolve/
I also created another example file where i use a different response
file [the one used for the other two examples was noisy]. hear you hear
the convolution result get mixed in and out:
http://affenbande.org/~tapas/jack_conv_ex3.ogg
Flo
--
Palimm Palimm!
http://affenbande.org/~tapas/
29 Jan
29 Jan
2:13 a.m.
New subject: [linux-audio-dev] Re: [Jackit-devel] Re: [linux-audio-user] [ANNOUNCE] jack_convolve-0.0.1
On Sat, 29 Jan 2005 06:55:31 +0100
Florian Schmidt <mista.tapas(a)gmx.net> wrote:
tarball[s] here [minor optimization attempts since
last tarball]:
http://affenbande.org/~tapas/jack_convolve/
about optimizations: like Anders Torger notes in his docs to brutefir:
http://www.ludd.luth.se/~torger/brutefir.html#bruteconv_4
the cycle burner is the complex multiplication. So if anyone has SIMD
assembler routines for complex multiplication of two float buffers
(fftwf_complex *) in his cupboard, please bring it out :)
jack_convolve uses complex data format, not half-complex like brutefir.
so i suppose i can't simply rip his code ;)
Flo
--
Palimm Palimm!
http://affenbande.org/~tapas/
3:44 p.m.
New subject: [linux-audio-dev] Re: [Jackit-devel] Re: [linux-audio-user] [ANNOUNCE] jack_convolve-0.0.1
On Sat, Jan 29, 2005 at 07:20:39 +0100, Florian Schmidt wrote:
On Sat, 29 Jan 2005 06:55:31 +0100
Florian Schmidt <mista.tapas(a)gmx.net> wrote:
I'd recommend the half-complex format, it makes hte FFT much faster and
reduces the ammount of memory you have to touch. The only pain is that the
format is a bit wierd to work with.
- Steve
tarball[s] here [minor optimization attempts
since last tarball]:
http://affenbande.org/~tapas/jack_convolve/
about optimizations: like Anders Torger notes in his docs to brutefir:
http://www.ludd.luth.se/~torger/brutefir.html#bruteconv_4
the cycle burner is the complex multiplication. So if anyone has SIMD
assembler routines for complex multiplication of two float buffers
(fftwf_complex *) in his cupboard, please bring it out :)
jack_convolve uses complex data format, not half-complex like brutefir.
so i suppose i can't simply rip his code ;)
3:56 p.m.
New subject: [linux-audio-dev] Re: [Jackit-devel] Re: [linux-audio-user] [ANNOUNCE] jack_convolve-0.0.1
On Sat, 29 Jan 2005 19:44:47 +0000
Steve Harris <S.W.Harris(a)ecs.soton.ac.uk> wrote:
I'd recommend the half-complex format, it makes
hte FFT much faster and
reduces the ammount of memory you have to touch. The only pain is that the
format is a bit wierd to work with.
I see. Plus the simultaenous forward and backward memory access during
the complex multiply [as noted in brutefir docs]. This can be pretty
easily plugged in when i have my head free to grok how to do the
multiplication in the half complex format [some days from now on].
Flo
--
Palimm Palimm!
http://affenbande.org/~tapas/
9:27 a.m.
On Sat, 29 Jan 2005 06:55:31 +0100
Florian Schmidt <mista.tapas(a)gmx.net> wrote:
make sure you get the newest version.. homepage here:
http://www.affenbande.org/~tapas/wiki/admin.php?jack_convolve
oops:
http://www.affenbande.org/~tapas/wiki/index.php?jack_convolve
flo
--
Palimm Palimm!
http://affenbande.org/~tapas/
7034
days inactive
7034
days old
linux-audio-dev@lists.linuxaudio.org
4 comments
2 participants
participants (2)
-
Florian Schmidt -
Steve Harris