Constant-Q transform

In mathematics and signal processing, the constant-Q transform transforms a data series to the frequency domain. It is related to the Fourier transform^[1] and very closely related to the complex Morlet wavelet transform.^[2]

The transform can be thought of as a series of logarithmically spaced filters, with the k-th filter having a spectral width some multiple of the previous filter's width:

{\begin{aligned}\delta f_{k}&=2^{1/n}\cdot \delta f_{k-1}\\&=\left(2^{1/n}\right)^{k}\cdot \delta f_{\text{min}},\end{aligned}}

where δf_k is the bandwidth of the k-th filter, f_min is the central frequency of the lowest filter, and n is the number of filters per octave.

Calculation

The short-time Fourier transform of x[n] for a frame shifted to sample m is calculated as follows:

X[k,m]=\sum _{n=0}^{N-1}W[n-m]x[n]e^{-j2\pi kn/N}.

Given a data series sampled at f_s = 1/T, T being the sampling period of our data, for each frequency bin we can define the following:

Filter width, δf_k.
Q, the "quality factor":

Q={\frac {f_{k}}{\delta f_{k}}}.

This is shown below to be the integer number of cycles processed at a center frequency f_k. As such, this somewhat defines the time complexity of the transform.

Window length for the k-th bin:

N[k]={\frac {f_{\text{s}}}{\delta f_{k}}}={\frac {S}{f_{k}}}Q.

Since S/f_k is the number of samples processed per cycle at frequency f_k, Q is the number of integer cycles processed at this central frequency.

The equivalent transform kernel can be found by using the following substitutions:

The window length of each bin is now a function of the bin number:

N=N[k]=Q{\frac {f_{\text{s}}}{f_{k}}}.

The relative power of each bin will decrease at higher frequencies, as these sum over fewer terms. To compensate for this, we normalize by N[k].
Any windowing function will be a function of window length, and likewise a function of window number. For example, the equivalent Hamming window would be

W[k,n]=\alpha -(1-\alpha )\cos {\frac {2\pi n}{N[k]}},\quad \alpha =25/46,\quad 0\leqslant n\leqslant N[k]-1.

Our digital frequency, ${\frac {2\pi k}{N}}$ , becomes ${\frac {2\pi Q}{N[k]}}$ .

After these modifications, we are left with

X[k]={\frac {1}{N[k]}}\sum _{n=0}^{N[k]-1}W[k,n]x[n]e^{\frac {-j2\pi Qn}{N[k]}}.

Fast calculation using FFT

The direct calculation of the constant-Q transform is slow when compared against the fast Fourier transform (FFT). However, the FFT can itself be employed, in conjunction with the use of a kernel, to perform the equivalent calculation but much faster.^[3]

Comparison with the Fourier transform

In general, the transform is well suited to musical data, and this can be seen in some of its advantages compared to the fast Fourier transform. As the output of the transform is effectively amplitude/phase against log frequency, fewer frequency bins are required to cover a given range effectively, and this proves useful where frequencies span several octaves. As the range of human hearing covers approximately ten octaves from 20 Hz to around 20 kHz, this reduction in output data is significant.

The transform exhibits a reduction in frequency resolution with higher frequency bins, which is desirable for auditory applications. The transform mirrors the human auditory system, whereby at lower-frequencies spectral resolution is better, whereas temporal resolution improves at higher frequencies. At the bottom of the piano scale (about 30 Hz), a difference of 1 semitone is a difference of approximately 1.5 Hz, whereas at the top of the musical scale (about 5 kHz), a difference of 1 semitone is a difference of approximately 200 Hz.^[4] So for musical data the exponential frequency resolution of constant-Q transform is ideal.

In addition, the harmonics of musical notes form a pattern characteristic of the timbre of the instrument in this transform. Assuming the same relative strengths of each harmonic, as the fundamental frequency changes, the relative position of these harmonics remains constant. This can make identification of instruments much easier. The constant Q transform can also be used for automatic recognition of musical keys based on accumulated chroma content.^[5]

Relative to the Fourier transform, implementation of this transform is more tricky. This is due to the varying number of samples used in the calculation of each frequency bin, which also affects the length of any windowing function implemented.^[6]

Also note that because the frequency scale is logarithmic, there is no true zero-frequency / DC term present, perhaps limiting possible utility of the transform.

References

↑ Judith C. Brown, Calculation of a constant Q spectral transform, J. Acoust. Soc. Am., 89(1):425–434, 1991.
↑ Continuous Wavelet Transform "When the mother wavelet can be interpreted as a windowed sinusoid (such as the Morlet wavelet), the wavelet transform can be interpreted as a constant-Q Fourier transform. Before the theory of wavelets, constant-Q Fourier transforms (such as obtained from a classic third-octave filter bank) were not easy to invert, because the basis signals were not orthogonal."
↑ Judith C. Brown and Miller S. Puckette, An efficient algorithm for the calculation of a constant Q transform, J. Acoust. Soc. Am., 92(5):2698–2701, 1992.
↑ http://newt.phys.unsw.edu.au/jw/graphics/notes.GIF
↑ Hendrik Purwins, Benjamin Blankertz and Klaus Obermayer, A New Method for Tracking Modulations in Tonal Music in Audio Data Format, International Joint Conference on Neural Network (IJCNN’00)., 6:270-275, 2000.
↑ Benjamin Blankertz, The Constant Q Transform, 1999.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.