Muze Plugin Updated to v. 1.1.3

Updated the Muze plugin to version 1.1.3, adding a fourth reverb algorithm called Indigo to the selection.


New Features:

  • Indigo: A shimmer & frequency-echo reverb effect for adding both harmonically rich transpositions and inharmonic distortions into your mix.
  • Pitch-Shift and slider knobs control one-octave transposition range and carrier frequency per step.
  • Echo knob controls the diffusion rate of reflections between steps.
  • Minor performance improvements in Reverb-Twister.
  • Minor icon change to Reverb-Lime patterns.
  • Added 10+ more presets

Maintenance patch v. 1.1.3a
-Fixed random project startup crash in FLStudio if reverb set to Indigo
-Leveled off shimmer when pitch-shift nears 0 in Reverb-Indigo

Muze Plugin Updated to v. 1.1.2

Unleash the Twister! Our third reverb algorithm for the Muze plugin!


New features / changes

  • Twister is an amplitude-delay modulation effect for mixing sound reflections into washy reverb tails
    • Create whoosh sounds, chorus/buzz/swarm, and wind effects
    • Rate, depth, wind controls are automatable
  • Enabled pan knob for Lime when spatialization is disabled
  • Added icons for Lime early reflection patterns
  • Extended reverb algorithm descriptions in manual
  • Added 10+ more presets

Release notes:
v. 1.1.2a
-Fixed FLStudio automation clip-GUI parameter change deadlock (No longer need to disable “Notify about parameter change” setting)

Muze Plugin Updated to v. 1.1.1

The next iteration of the Muze plugin is live! Screen shot and workflow video below:


New features / changes

  • Added new echo-blender reverb algorithm (second of nine) and selector for changing modes (see GUI + manual for details)
  • Sound-sources are now draggable in XY plane in sound-stage
  • Right-click on sound-source toggles mute button
  • Enable wrap-around mouse wheel scrolling on source and orientation knobs
  • Forum link added to top right
  • Lower left displays registered user name only
  • Added 10 new presets

Those who have already purchased can update their full version via their Fastspring link (if you were a beta-tester, contact us). The demo links have also been updated.

Release notes:
v. 1.1.1
-Fixed crash on certain mac DAWs when switching between reverb modes
-Added version numbering to upper-right corner

Muze: Binaural Reverb/ 3D Panner-Mixer Plugin

Muze is multi-purpose VST/AU reverb plugin that combines a 3D audio mixer with a high quality binaural near & far field model. The mixer component enables tight control over the early spatial impression of the acoustic field while psychoacoustic models add essential directional cues to help localize sound; our reverb designs integrate with the binaural cues, giving appropriate contrast for the early spatial impression to sit in.

lime lime twister
indigo solarium

Muze supports up to 8 input channels with an additional ninth summation channel that doubles as a delay unit. Channels are associated with point sound-sources in an interactive graphical display and have separate processing paths that come together in a shared reverb component. Create whisper effects, wide impressions, impossible spaces. Up-mix mono sources into stereo/binaural. Virtualize 5.1+ to headphones by placing virtual speakers on the sound-stage. Switch to the panning mode for speaker setups.


  • Multiple reverb algorithms (Velvet, Lime, Twister, Indigo, Solarium) model¬†characteristics of specular/diffuse, discrete/echo, modulated, shimmered, and swelling reflections.
  • 8 channel virtualization, each with automatable azimuth, elevation, and distance controls
  • Adjustable listener controls for scaling interaural time delay and aligning yaw/pitch orientations
  • Spin knob enables automatic head-rotation, unleashing new possibilities for different modulation effects
  • Unique spatial-reverb designs integrate with the HRTF model, producing an immersive reverberant field.
  • Reverb characteristics such as room size, sound depth, high frequency dampening/reverb times are automatable
  • Delay unit integrates with the reverb, creating DUB-type effects
  • Rendering modes togglable between binaural/panning processing
  • All sampling rates supported for HRTFs
  • Graphical display for visualizing sound-sources & listener position and orientations
  • Updates are free
  • 90+ presets to get you started


  • Vocals by the talented Stephanie Kay (Stars Collide): Dry first, followed by alternating rotations along yaw and pitch axes for no-verb, no-verb near-field, small room, hall, diffuse hall, and cave
  • Jazz instrumental by¬†Maurizio Pagnutti (All The Gin Is Gone’ & ‘Bess): Dancing around instruments!
  • Loopy spatial effects! (Dry-Reverb)
  • Workflow / Automation / Mono-Source Demo:

Demo & Specifications:

  • Windows 7+: VST2 Win32 + x64, SSE2 enabled processor
  • Mac OSX 10.7+: VST2/AU, SSE2 enabled processor
  • Download Link¬†(Demo restriction is brief silence every 30 sec)
  • Alternative Link


  • Visit our storefront¬†for pricing info on all our products. To directly order, click below!

Geometric Audio 2: Gauss Circle Problem for Integer Sized Room Models

In the previous post on image-sources for room modeling, we made the observations that

  1. There exist a unique path from each image-source coordinate that can be back-traced to a receiver
  2. The distance and direction between image-source coordinate and listener are equal sum total of the back-traced ray lengths and the final leg of the back-traced path respectively.
  3. Image-source coordinates in 2D orthotopes has one-to-one mapping to integer lattice points
  4. The number of image-sources with respect to reflection order K and dimension D is O(K^D)

For large K or¬†large D, the number of image-sources¬†becomes too large to process individually for any practical real-time applications. Instead, we ought to take a density estimation approach by making the following query: How many image-sources lie between a hypersphere of radius k_1 and k_2 centered about a receiver L? i.e. what is the difference in¬†“lattice volume” or number of lattice points ¬†contained between two hyperspheres of different radii? If we can quickly solve for such queries, then¬†it should be possible to design a multi-tap finite impulse response (FIR)¬†where each sample¬†is a¬†weighted function of the differences in lattice¬†volumes at successive radius¬†k=t \frac{v}{Fs} ¬†in meters (v is the velocity of sound, Fs is the sample-rate, and t is the integer sample index). To attack this problem, let us consider the classic Gauss Circle Problem¬†posed¬†simply as the determination of the number of integer lattice points within a circle of radius k (see animation below).

Gauss Circle.gif
2D Gauss circle problem

The exact solution is known and given by S(k) = 1+4\left \lfloor k \right \rfloor + 4\sum_{i=1}^{\left \lfloor k \right \rfloor} \left \lfloor \sqrt{k^2 - i^2} \right \rfloor, requiring an expensive summation over the positive integers less than k. i.e. we must numerically count despite the fact that the lattice volume approaches the area of a circle as k grows large if we want to model high-frequencies in our FIR.

Unfortunately, mapping our image-source density problem to the Gauss circle problem introduces many unsatisfactory constraints:

  1. Number of dimensions restricted to D = 2
  2. The room must be a unit square
  3. Emitter and receiver are coincident to the origin
  4. Each lattice point contributes only one unit to the summation (they are unweighted)
  5. Area is a quadratic function of k so later summations will be huge

Let us generalize the Gauss circle problem so that these constraints can be either removed or relaxed. For reference, Euclidean or L_2 distance in D dimensions is given by

  1. Recurrence relation for lattice volume S(k,D) in arbitrary dimensions:
    The base case for D=1 assumes that positive and negative lattice points coordinates are symmetric. For higher dimensional cases,  we do a form of recursive integration over the positive integers of each dimension (see animation below).

    high dim.gif
    Purple region represents lattice volume at \sqrt{k^2 - i^2} in D=1 as i increases in D=2.

    This proof follows from the observation that if ||\nu||_2 \in \mathcal{R}^D \leq k and \nu_D = i, then \sum_{d=1}^{D-1} \nu_d^2 \leq k^2 - i^2 .

  2. Memorization in quadratic space:
    Lower dimensional solutions of the original recursive formulation can be stored in memory by mapping integer space k to the quadratic space k^2. i.e. We compute and store \hat{S}(q, D) for 0 \leq q \leq K^2 where K is the max radius of interest (in practical terms, K is a meter distance quantity converted from a desired reverb time). The trade-off is that memory requirements undergo quadratic scaling with respect to max radius.
  3. Integer scaling of room boundaries and receiver offset:
    where integer scalar \ell_D determines the size of room along dimension D and integer scalar \Delta_D: 0 \leq \Delta_D \leq \left \lfloor \frac{\ell_D}{2} \right \rfloor is the emitter offset in dimension D from the origin. The proof follows from the constraint that q - (\Delta_D + \ell_D i)^2 \geq 0 implies \sqrt{q} \geq \Delta_D + \ell_D i and -\sqrt{q} \leq \Delta_D + \ell_D i.
  4. Exponential decaying lattice point contributions:
    where w_D: 0 \leq w_D \leq 1 is a real value representing in physical terms a conversion of dB loss to magnitude due to a reflection off a boundary. Proof of the case of l \leq h, D=1 follows the application of the geometric series.

With the generalization of the Gauss circle problem into a dynamic programming problem, we have expanded the parameter space to include arbitrary dimensional orthotopes of integer boundary sizes, integer receiver offsets, and real reflection gain/loss coefficients. Prefiguring these parameters beforehand and accounting for attenuation loss due to a generalization of the inverse square law of sound-fields into higher dimensions, an RT60 or FIR length and subsequent max meters K terms can be specified beforehand.

The cost of directly computing \hat{S}(q, D) at q is given by O(\sqrt{q}/\ell_D) flops. Summing over all 0 \leq q \leq K^2 gives a cost of O(D K^3) flops and is most expensive when the boundary size  \ell_D =1 is minimized. This is certainly a large improvement over directly processing O(K^D) individual image-sources where the asymptotic costs of the two methods match for D=3. However, we can make one last improvement by observing that the access patterns of q, i \in \hat{S}(q - (\Delta_D + \ell_D i)^2, D-1) resembles that of the convolution operation, allowing us to achieve even lower asymptotic cost of O(D K^2 \log K) via the fast Fourier transform. Implementation details will be covered in the next post!


Notes: Equations were lifted from a draft paper¬†that I’m writing. Animations were done with GeoGebra.