Differences between room, plate, hall algorithms?
Posted: Fri Nov 21, 2008 2:07 pm
Hi all:
I was going through the example code for the FV-1, and trying to figure out why different algorithms have their titles. A few questions:
- Are the Room, Hall, Plate algorithms defined by their sound, or by their algorithm topologies?
- If defined by sound, what are the identifying characteristics for their sounds? Is it based on speed of diffusion buildup, coloration, perceived size?
- If defined by algorithm topology, what are these? Is it based on num of allpasses, allpass coefficients, number of predelay taps, number of ring output taps?
From what I can tell, the plate algorithms in the FV-1 examples tend to use more loop allpasses, and possibly more loop inputs, than the Hall algorithms. The Room algorithms seem closer to the Plate algorithms, with the loop allpass coefficients (maybe) being set to lower values.
Any thoughts on this topic welcome.
Thanks,
Sean Costello
I was going through the example code for the FV-1, and trying to figure out why different algorithms have their titles. A few questions:
- Are the Room, Hall, Plate algorithms defined by their sound, or by their algorithm topologies?
- If defined by sound, what are the identifying characteristics for their sounds? Is it based on speed of diffusion buildup, coloration, perceived size?
- If defined by algorithm topology, what are these? Is it based on num of allpasses, allpass coefficients, number of predelay taps, number of ring output taps?
From what I can tell, the plate algorithms in the FV-1 examples tend to use more loop allpasses, and possibly more loop inputs, than the Hall algorithms. The Room algorithms seem closer to the Plate algorithms, with the loop allpass coefficients (maybe) being set to lower values.
Any thoughts on this topic welcome.
Thanks,
Sean Costello