---
title: Hann function
slug: hann-function
qid: 
snapshot: enwiki-001328890910
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1328890910
tags: [107702204, 23118434, 23603337, 29572944, 7692542]
---

# Hann function

> [!note] Provenance
> Snapshot `enwiki-001328890910` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1328890910> · Licensed CC BY-SA 4.0

The Hann function is named after the Austrian meteorologist Julius von Hann. It is a window function used to perform Hann smoothing or hanning. The function, with length L and amplitude 1/L, is given by: : 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\}. For digital signal processing, the function is sampled symmetrically (with spacing L/N and amplitude 1 ): : \left . \begin{align} 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{align} \right \},\quad 0 \leq n \leq N, which is a sequence of N+1 samples, and N can be even or odd. It is also known as the raised cosine window, Hann filter, von Hann window, Hanning window, etc.

The Hann function is named after the Austrian meteorologist Julius von Hann. It is a window function used to perform Hann smoothing or hanning. The function, with length L and amplitude 1/L, is given by: 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\}. &nbsp; For digital signal processing, the function is sampled symmetrically (with spacing L/N and amplitude 1 ): \left . \begin{align} 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{align} \right \},\quad 0 \leq n \leq N, which is a sequence of N+1 samples, and N can be even or odd. It is also known as the raised cosine window, Hann filter, von Hann window, Hanning window, etc. W_0(f) = \frac{1}{2}\frac{\operatorname{sinc}(Lf)}{(1 - L^2f^2)} = \frac{\sin(\pi Lf)}{2\pi L f(1 - L^2f^2)} &nbsp; {{math proof|title=Derivation|proof= Using Euler's formula to expand the cosine term in w_0(x), we can write: w_0(x)= \tfrac{1}{L} \left(\tfrac{1}{2}\operatorname{rect}(x/L) +\tfrac{1}{4} e^{i 2\pi x/L} \operatorname{rect}(x/L) + \tfrac{1}{4}e^{-i 2\pi x/L} \operatorname{rect}(x/L)\right), which is a linear combination of modulated rectangular windows: \tfrac{1}{L} \operatorname{rect}(x/L)\quad \stackrel{\text{Fourier transform}}{\longleftrightarrow}\quad \operatorname{sinc}(Lf) \triangleq \frac{\sin(\pi L f)}{\pi L f}. Transforming each term: \begin{align} 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^2f^2)}. \end{align} }} \mathcal{F}\{w[n]\} &\triangleq \sum_{n=0}^{N} w[n]\cdot e^{-i 2 \pi f n}\\ &= e^{-i \pi f N}\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{align} The truncated sequence \{w[n],\ 0 \le n \le 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: \mathcal{F}\{w[n]\} = e^{-i \pi f (N-1)}\left[\tfrac{1}{2} \frac{\sin(\pi N f)}{\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 f = k/N, for integer values of 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.
