title: Multidelay block frequency domain adaptive filter
text: # Multidelay block frequency domain adaptive filter
  
  The multidelay block frequency domain adaptive filter (MDF) algorithm is a block-based frequency domain implementation of the (normalised) Least mean squares filter (LMS) algorithm.
  
  ## Introduction
  
  The MDF algorithm is based on the fact that convolutions may be efficiently computed in the frequency domain (thanks to the fast Fourier transform). However, the algorithm differs from the fast LMS algorithm in that block size it uses may be smaller than the filter length. If both are equal, then MDF reduces to the FLMS algorithm.
  
  The advantages of MDF over the (N)LMS algorithm are:
  
  * Lower algorithmic complexity
  * Partial de-correlation of the input (which 'may' lead to faster convergence)
  
  ## Variable definitions
  
  Let $N$ be the length of the processing blocks, $K$ be the number of blocks and $\mathbf {F}$ denote the 2Nx2N Fourier transform matrix. The variables are defined as:
  
      ${\underline {\mathbf {e} }}(\ell )=\mathbf {F} \left[\mathbf {0} _{1xN},e(\ell N),\dots ,e(\ell N-N-1)\right]^{T}$
      ${\underline {\mathbf {x} }}_{k}(\ell )=\mathrm {diag} \left\{\mathbf {F} \left[x((\ell -k+1)N),\dots ,x((\ell -k-1)N-1)\right]^{T}\right\}$
      ${\underline {\mathbf {X} }}(\ell )=\left[{\underline {\mathbf {x} }}_{0}(\ell ),{\underline {\mathbf {x} }}_{1}(\ell ),\dots ,{\underline {\mathbf {x} }}_{K-1}(\ell )\right]$
      ${\underline {\mathbf {d} }}(\ell )=\mathbf {F} \left[\mathbf {0} _{1xN},d(\ell N),\dots ,d(\ell N-N-1)\right]^{T}$
  
  With normalisation matrices $\mathbf {G} _{1}$ and $\mathbf {G} _{2}$:
  
      $\mathbf {G} _{1}=\mathbf {F} {\begin{bmatrix}\mathbf {0} _{N\times N}&\mathbf {0} _{N\times N}\\\mathbf {0} _{N\times N}&\mathbf {I} _{N\times N}\\\end{bmatrix}}\mathbf {F} ^{H}$
      ${\tilde {\mathbf {G} }}_{2}=\mathbf {F} {\begin{bmatrix}\mathbf {I} _{N\times N}&\mathbf {0} _{N\times N}\\\mathbf {0} _{N\times N}&\mathbf {0} _{N\times N}\\\end{bmatrix}}\mathbf {F} ^{H}$
      $\mathbf {G} _{2}=\operatorname {diag} \left\{{\tilde {\mathbf {G} }}_{2},{\tilde {\mathbf {G} }}_{2},\dots ,{\tilde {\mathbf {G} }}_{2}\right\}$
  
  In practice, when multiplying a column vector $\mathbf {x}$ by $\mathbf {G} _{1}$, we take the inverse FFT of $\mathbf {x}$, set the first $N$ values in the result to zero and then take the FFT. This is meant to remove the effects of the circular convolution.
  
  ## Algorithm description
  
  For each block, the MDF algorithm is computed as:
  
      ${\underline {\hat {\mathbf {y} }}}(\ell )=\mathbf {G} _{1}{\underline {\mathbf {X} }}(\ell ){\underline {\hat {\mathbf {h} }}}(\ell -1)$
      ${\underline {\mathbf {e} }}(\ell )={\underline {\mathbf {d} }}(\ell )-{\underline {\hat {\mathbf {y} }}}(\ell )$
      $\mathbf {\Phi } _{\mathbf {xx} }(\ell )={\underline {\mathbf {X} }}^{H}(\ell ){\underline {\mathbf {X} }}(\ell )$
      ${\underline {\hat {\mathbf {h} }}}(\ell )={\underline {\hat {\mathbf {h} }}}(\ell -1)+\mu \mathbf {G} _{2}\mathbf {\Phi } _{\mathbf {xx} }^{-1}(\ell ){\underline {\mathbf {X} }}^{H}(\ell ){\underline {\mathbf {e} }}(\ell )$
  
  It is worth noting that, while the algorithm is more easily expressed in matrix form, the actual implementation requires no matrix multiplications. For instance the normalisation matrix computation $\mathbf {\Phi } _{\mathbf {xx} }={\underline {\mathbf {X} }}^{H}(\ell ){\underline {\mathbf {X} }}(\ell )$ reduces to an element-wise vector multiplication because ${\underline {\mathbf {X} }}(\ell )$ is block-diagonal. The same goes for other multiplications.
  
  