# DFT Processing Gain There are two types of processing gains associated with the DFT. One is simply know as *processing gain*, which is the inherent correlation gain that takes place in an $N$-point DFT. The *processing gain* of a single DFT is a function of the number of input samples $N$. It can be useful to think of each DFT bin as a bandpass filter for frequencies near the bin center. As the number of input samples increases, the gain of the bandpass filter increases and the bandwidth of the filter decreases. The other type of processing gain is the *integration gain* that is possible when the output of multiple DFT's are averaged together. It is possible in theory to increase the number of samples used to calculate the DFT, but the number of multiplications required to calculate the DFT increases proporionally to $N^2$, so this is not computationally efficient in practice. We can quantify the idea of DFT *processing gain* by defining a signal-to-noise ratio (SNR), as the ratio of the DFT's *output signal-power level* to the *average output noise-power level*. In practice we see that the DFT's output SNR will increase as $N$ increases. This is due to the fact that a DFT bins output noise standard deviation (RMS) value is proportional to $\sqrt N$, and the DFT's output magnitude for a signal close to bin center is proportional to $N$. In general, for real inputs when $N > N'$, an $N$-point DFT's output ${SNR}_N$ increase over an $N'$- point DFT's ${SNR}_{N'}$ by the following relationship: $${SNR}_N = {SNR}_{N'} + 10 \, {log}_{10} \left(\frac{N}{N'}\right) dB$$ When the DFT size increases by a factor of $2N$, the processing gain increases by *approximately* 3 dB (approximate since noise variation is random in nature). This is illustrated in the example below.