title: Is there an FFT that uses a logarithmic division of frequency?
body: <p>Wikipedia's <a href="http://en.wikipedia.org/wiki/Wavelet#Comparisons_with_Fourier_Transform_.28Continuous-Time.29" rel="noreferrer">Wavelet article</a> contains this text:</p>
  
  <blockquote>
    <p>The discrete wavelet transform is also less computationally complex, taking O(N) time as compared to O(N log N) for the <a href="http://en.wikipedia.org/wiki/Fast_Fourier_transform" rel="noreferrer">fast Fourier transform</a>. This computational advantage is not inherent to the transform, but reflects the choice of a logarithmic division of frequency, in contrast to the equally spaced frequency divisions of the FFT.</p>
  </blockquote>
  
  <p>Does this imply that there's also an FFT-like algorithm that uses a logarithmic division of frequency instead of linear?  Is it also O(N)?  This would obviously be preferable for a lot of applications.</p>