[Csnd] filterBank UDO
Date | 2009-12-26 23:05 |
From | UnUnUnium |
Subject | [Csnd] filterBank UDO |
Hello. I was just wondering if anyone could tell me what inum and icount do in the filterBank UDO documentation, as it does not appear be listed. I am assuming one or the other is the number of filters... Best, Jeremy |
Date | 2009-12-26 23:41 |
From | Victor Lazzarini |
Subject | [Csnd] Re: filterBank UDO |
Without looking at the code, I'd say inum is the total number of filters, icount is an internal counting variable/parameter to control recursion depth. On 26 Dec 2009, at 23:05, UnUnUnium wrote: > Hello. I was just wondering if anyone could tell me what inum and > icount do > in the filterBank UDO documentation, as it does not appear be > listed. I am > assuming one or the other is the number of filters... > > Best, Jeremy > -- > View this message in context: http://old.nabble.com/filterBank-UDO-tp26930630p26930630.html > Sent from the Csound - General mailing list archive at Nabble.com. > > > > Send bugs reports to this list. > To unsubscribe, send email sympa@lists.bath.ac.uk with body > "unsubscribe csound" Send bugs reports to this list. To unsubscribe, send email sympa@lists.bath.ac.uk with body "unsubscribe csound" |
Date | 2009-12-27 09:55 |
From | UnUnUnium |
Subject | [Csnd] Re: filterBank UDO |
Thank you Victor. Sorry to ask such basic questions, but what might recursion depth do in the context of this UDO? What affect would it have on the sound, number of filters, etc. Best, Jeremy Victor Lazzarini wrote: > > Without looking at the code, I'd say inum is the total number of > filters, icount is an internal counting variable/parameter to control > recursion depth. > > > On 26 Dec 2009, at 23:05, UnUnUnium wrote: >> Hello. I was just wondering if anyone could tell me what inum and >> icount do >> in the filterBank UDO documentation, as it does not appear be >> listed. I am >> assuming one or the other is the number of filters... >> >> Best, Jeremy >> -- >> View this message in context: >> http://old.nabble.com/filterBank-UDO-tp26930630p26930630.html >> Sent from the Csound - General mailing list archive at Nabble.com. >> >> >> >> Send bugs reports to this list. >> To unsubscribe, send email sympa@lists.bath.ac.uk with body >> "unsubscribe csound" > > > > Send bugs reports to this list. > To unsubscribe, send email sympa@lists.bath.ac.uk with body "unsubscribe > csound" > > |
Date | 2009-12-27 10:06 |
From | Victor Lazzarini |
Subject | [Csnd] Re: Re: filterBank UDO |
In this case, it's just the number of filters used. The UDO calls itself N times to produce the output, each one of the calls contains a filter. Recursion is used to create the filter bank. Victor On 27 Dec 2009, at 09:55, UnUnUnium wrote: > > Thank you Victor. Sorry to ask such basic questions, but what might > recursion > depth do in the context of this UDO? What affect would it have on > the sound, > number of filters, etc. > > Best, Jeremy > > Victor Lazzarini wrote: >> >> Without looking at the code, I'd say inum is the total number of >> filters, icount is an internal counting variable/parameter to control >> recursion depth. >> >> >> On 26 Dec 2009, at 23:05, UnUnUnium wrote: >>> Hello. I was just wondering if anyone could tell me what inum and >>> icount do >>> in the filterBank UDO documentation, as it does not appear be >>> listed. I am >>> assuming one or the other is the number of filters... >>> >>> Best, Jeremy >>> -- >>> View this message in context: >>> http://old.nabble.com/filterBank-UDO-tp26930630p26930630.html >>> Sent from the Csound - General mailing list archive at Nabble.com. >>> >>> >>> >>> Send bugs reports to this list. >>> To unsubscribe, send email sympa@lists.bath.ac.uk with body >>> "unsubscribe csound" >> >> >> >> Send bugs reports to this list. >> To unsubscribe, send email sympa@lists.bath.ac.uk with body >> "unsubscribe >> csound" >> >> > > -- > View this message in context: http://old.nabble.com/filterBank-UDO-tp26930630p26932934.html > Sent from the Csound - General mailing list archive at Nabble.com. > > > > Send bugs reports to this list. > To unsubscribe, send email sympa@lists.bath.ac.uk with body > "unsubscribe csound" Send bugs reports to this list. To unsubscribe, send email sympa@lists.bath.ac.uk with body "unsubscribe csound" |
Date | 2009-12-27 10:14 |
From | J |
Subject | [Csnd] Re: Re: Re: filterBank UDO |
I see, that makes sense, just like a for loop type of thingy . So icount = maximum number of filters, inum = current number of filters used, perhaps? Sorry, still slightly confused I think.... Best, Jeremy
On Sun, Dec 27, 2009 at 10:06 AM, Victor Lazzarini <Victor.Lazzarini@nuim.ie> wrote:
|
Date | 2009-12-27 10:25 |
From | Victor Lazzarini |
Subject | [Csnd] Re: Re: Re: Re: filterBank UDO |
Well, you only set inum, the number of filters you want to use. The icount parameter is used by UDO to stop recursing infinitely. Victor On 27 Dec 2009, at 10:14, J wrote: I see, that makes sense, just like a for loop type of thingy . So icount = maximum number of filters, inum = current number of filters used, perhaps? Sorry, still slightly confused I think.... |
Date | 2009-12-27 10:46 |
From | J |
Subject | [Csnd] Re: Re: Re: Re: Re: filterBank UDO |
Got it - so if icount is greater than inum, goto out. Makes perfect sense now. Thanks again! Best, Jeremy
On Sun, Dec 27, 2009 at 10:25 AM, Victor Lazzarini <Victor.Lazzarini@nuim.ie> wrote:
|
Date | 2009-12-27 13:43 |
From | Steven Yi |
Subject | [Csnd] Re: Re: Re: Re: Re: Re: filterBank UDO |
Hi Jeremy, Regarding recursion, I wrote an article in the Csound Journal a while back that covers it that might be helpful: http://www.csounds.com/journal/2006summer/controlFlow_part2.html Cheers! steven On Sun, Dec 27, 2009 at 5:46 AM, J |
Date | 2009-12-27 14:23 |
From | Graham Breed |
Subject | [Csnd] Re: Re: Re: Re: Re: Re: Re: filterBank UDO |
Steven Yi |
Date | 2009-12-27 20:15 |
From | J |
Subject | [Csnd] Re: Re: Re: Re: Re: Re: Re: filterBank UDO |
A very useful resource, thank you Steven! Cheers, Jeremy
On Sun, Dec 27, 2009 at 1:43 PM, Steven Yi <stevenyi@gmail.com> wrote: Hi Jeremy, |