Hann function

Not to be confused with Hamming function.

The Hann function is named after the Austrian meteorologist Julius von Hann. It is a window function used to perform Hann smoothing.^[1] The function, with length ${\displaystyle L}$ and amplitude ${\displaystyle 1/L,}$ is given by:

${\displaystyle w_{0}(x)\triangleq \left\{{\begin{array}{ccl}{\tfrac {1}{L}}\left({\tfrac {1}{2}}+{\tfrac {1}{2}}\cos \left({\frac {2\pi x}{L}}\right)\right)={\tfrac {1}{L}}\cos ^{2}\left({\frac {\pi x}{L}}\right),\quad &\left|x\right|\leq L/2\\0,\quad &\left|x\right|>L/2\end{array}}\right\}.}$   ^[a]

Hann function (left), and its frequency response (right)

For digital signal processing, the function is sampled symmetrically (with spacing ${\displaystyle L/N}$ and amplitude ${\displaystyle 1}$):

${\displaystyle \left.{\begin{aligned}w[n]=L\cdot w_{0}\left({\tfrac {L}{N}}(n-N/2)\right)&={\tfrac {1}{2}}\left[1-\cos \left({\tfrac {2\pi n}{N}}\right)\right]\\&=\sin ^{2}\left({\tfrac {\pi n}{N}}\right)\end{aligned}}\right\},\quad 0\leq n\leq N,}$

which is a sequence of ${\displaystyle N+1}$ samples, and ${\displaystyle N}$ can be even or odd. It is also known as the raised cosine window, Hann filter, von Hann window, Hanning window, etc.^[2][3][4]

Fourier transform

Top: 16 sample DFT-even Hann window. Bottom: Its discrete-time Fourier transform (DTFT) and the 3 non-zero values of its discrete Fourier transform (DFT).

The Fourier transform of ${\displaystyle w_{0}(x)}$ is given by:

${\displaystyle W_{0}(f)={\frac {1}{2}}{\frac {\operatorname {sinc} (Lf)}{(1-L^{2}f^{2})}}={\frac {\sin(\pi Lf)}{2\pi Lf(1-L^{2}f^{2})}}}$   ^[b]

Derivation

Using Euler's formula to expand the cosine term in ${\displaystyle w_{0}(x),}$ we can write:

${\displaystyle w_{0}(x)={\tfrac {1}{L}}\left({\tfrac {1}{2}}\operatorname {rect} (x/L)+{\tfrac {1}{4}}e^{i2\pi x/L}\operatorname {rect} (x/L)+{\tfrac {1}{4}}e^{-i2\pi x/L}\operatorname {rect} (x/L)\right),}$

which is a linear combination of modulated rectangular windows:

${\displaystyle {\tfrac {1}{L}}\operatorname {rect} (x/L)\quad {\stackrel {\text{Fourier transform}}{\longleftrightarrow }}\quad \operatorname {sinc} (Lf)\triangleq {\frac {\sin(\pi Lf)}{\pi Lf}}.}$

Transforming each term:

${\displaystyle {\begin{aligned}W_{0}(f)&={\tfrac {1}{2}}\operatorname {sinc} (Lf)+{\tfrac {1}{4}}\operatorname {sinc} (L(f-1/L))+{\tfrac {1}{4}}\operatorname {sinc} (L(f+1/L))\\&={\tfrac {1}{2}}{\frac {\sin(\pi Lf)}{\pi Lf}}+{\tfrac {1}{4}}{\frac {\sin(\pi (Lf-1))}{\pi (Lf-1)}}+{\tfrac {1}{4}}{\frac {\sin(\pi (Lf+1))}{\pi (Lf+1)}}\\&={\frac {1}{2\pi }}\left({\frac {\sin(\pi Lf)}{Lf}}-{\tfrac {1}{2}}{\frac {\sin(\pi Lf)}{Lf-1}}-{\tfrac {1}{2}}{\frac {\sin(\pi Lf)}{Lf+1}}\right)\\&={\frac {\sin(\pi Lf)}{2\pi }}\left({\frac {1}{Lf}}+{\tfrac {1}{2}}{\frac {1}{1-Lf}}-{\tfrac {1}{2}}{\frac {1}{1+Lf}}\right)\\&={\frac {\sin(\pi Lf)}{2\pi }}\cdot {\frac {1}{Lf(1-Lf)(1+Lf)}}={\frac {1}{2}}{\frac {\operatorname {sinc} (Lf)}{(1-L^{2}f^{2})}}.\end{aligned}}}$

Discrete transforms

The Discrete-time Fourier transform (DTFT) of the ${\displaystyle N+1}$ length, time-shifted sequence is defined by a Fourier series, which also has a 3-term equivalent that is derived similarly to the Fourier transform derivation:

${\displaystyle {\begin{aligned}{\mathcal {F}}\{w[n]\}&\triangleq \sum _{n=0}^{N}w[n]\cdot e^{-i2\pi fn}\\&=e^{-i\pi fN}\left[{\tfrac {1}{2}}{\frac {\sin(\pi (N+1)f)}{\sin(\pi f)}}+{\tfrac {1}{4}}{\frac {\sin(\pi (N+1)(f-{\tfrac {1}{N}}))}{\sin(\pi (f-{\tfrac {1}{N}}))}}+{\tfrac {1}{4}}{\frac {\sin(\pi (N+1)(f+{\tfrac {1}{N}}))}{\sin(\pi (f+{\tfrac {1}{N}}))}}\right].\end{aligned}}}$

The truncated sequence ${\displaystyle \{w[n],\ 0\leq n\leq N-1\}}$ is a DFT-even (aka periodic) Hann window. Since the truncated sample has value zero, it is clear from the Fourier series definition that the DTFTs are equivalent. However, the approach followed above results in a significantly different-looking, but equivalent, 3-term expression:

${\displaystyle {\mathcal {F}}\{w[n]\}=e^{-i\pi f(N-1)}\left[{\tfrac {1}{2}}{\frac {\sin(\pi Nf)}{\sin(\pi f)}}+{\tfrac {1}{4}}e^{-i\pi /N}{\frac {\sin(\pi N(f-{\tfrac {1}{N}}))}{\sin(\pi (f-{\tfrac {1}{N}}))}}+{\tfrac {1}{4}}e^{i\pi /N}{\frac {\sin(\pi N(f+{\tfrac {1}{N}}))}{\sin(\pi (f+{\tfrac {1}{N}}))}}\right].}$

An N-length DFT of the window function samples the DTFT at frequencies ${\displaystyle f=k/N,}$ for integer values of ${\displaystyle k.}$ From the expression immediately above, it is easy to see that only 3 of the N DFT coefficients are non-zero. And from the other expression, it is apparent that all are real-valued. These properties are appealing for real-time applications that require both windowed and non-windowed (rectangularly windowed) transforms, because the windowed transforms can be efficiently derived from the non-windowed transforms by convolution.^[5][c][d]

Name

The function is named in honor of von Hann, who used the three-term weighted average smoothing technique on meteorological data.^[6][2] However, the term Hanning function is also conventionally used,^[7] derived from the paper in which the term hanning a signal was used to mean applying the Hann window to it.^[4][8] It is distinct from the similarly-named Hamming function, named after Richard Hamming.

See also

• Window function
• Apodization
• Raised cosine distribution
• Raised-cosine filter

Page citations

1. Nuttall 1981, p 84 (3)
2. Nuttall 1981, p 86 (17)
3. Nuttall 1981, p 85
4. Harris 1978, p 62