From the original SynthMaker forum (2004–2014), with its members’ names and dates.
MyCo ·
Hi!
The reverb delivered with Synthmaker uses fixed delay times, so on higher samplerates the reverb time is shorter and the overall frequency is higher.
Haven't found a solution for this, because you need prime numbers depending on samplerate.
Maik
Acrobat ·
MyCo wrote: Hi!
The reverb delivered with Synthmaker uses fixed delay times, so on higher samplerates the reverb time is shorter and the overall frequency is higher.
Haven't found a solution for this, because you need prime numbers depending on samplerate.
Maik
Probably the original Jezar work didn't put higher sample rates on count... yours is far better, SM 1.1 could be delivered with, IMO. But then also other effects and modules would need a hard revision and GUI alignment.
For example, Delays still use the basic delay primitive instead of coded or ASM versions that are already available in the wiki for more experienced users...
oddson ·
I have a solution for this.... I started my own advanced reverb but as usual I didn't complete it.
Here's the getPrime function from it set up on its own:
getPrime.osm
It finds a near prime (not always the closest but one in the ballpark) to whatever number you give it as long as the input is near the largest of the first 10,000 primes (or 104729).
If anyone was really keen they could iterate from the near guess and search up/down the list until they find the actual nearest value but for an application like reverb I would think the guess is close enough. (It tends to underestimate for small values and overestimate for large.)
MyCo ·
nice... that's what I've tried before, but on a iterative way...
oddson ·
If you want the nearest I think the estimate-first approach will work better. Even on the highest values the log-guess approach is within 150 steps and on the values likely with reverb you're normally within 5 primes.
oddson ·
Here's a version that gets the nearest prime (although I've not tested that the thing that checks whether the higher or lower prime is closer is actually working):
getPrimeNearest.osm
It's pretty quick and since the primes would normally be calculated only at loading it's speed should be adequate (unless you have hundreds or thousands of primes to calculate). [The estimate seems to be within 10 primes up to about 15000 and it's sweet spot goes up to about 11000 where it's usually only a few steps away. So the iterative part usually doesn't have far to go to find the nearest prime.]
Wrote something here? To have a post removed or your name hidden, write to [email protected].
SynthMaker