Downsampling (signal processing)
In digital signal processing, downsampling, compression, and decimation are terms associated with the process of resampling in a multirate digital signal processing system. Both downsampling and decimation can be synonymous with compression, or they can describe an entire process of bandwidth reduction (filtering) and samplerate reduction.[1][2] When the process is performed on a sequence of samples of a signal or other continuous function, it produces an approximation of the sequence that would have been obtained by sampling the signal at a lower rate (or density, as in the case of a photograph).
Decimation is a term that historically means the removal of every tenth one.[upperalpha 1] But in signal processing, decimation by a factor of 10 actually means keeping only every tenth sample. This factor multiplies the sampling interval or, equivalently, divides the sampling rate. For example, if compact disc audio at 44,100 samples/second is decimated by a factor of 5/4, the resulting sample rate is 35,280. A system component that performs decimation is called a decimator. Decimation by an integer factor is also called compression.[3][4]
Downsampling by an integer factor
Rate reduction by an integer factor M can be explained as a twostep process, with an equivalent implementation that is more efficient:[5]
 Reduce highfrequency signal components with a digital lowpass filter.
 Decimate the filtered signal by M; that is, keep only every M^{th} sample.
Step 2 alone allows highfrequency signal components to be misinterpreted by subsequent users of the data, which is a form of distortion called aliasing. Step 1, when necessary, suppresses aliasing to an acceptable level. In this application, the filter is called an antialiasing filter, and its design is discussed below. Also see undersampling for information about decimating bandpass functions and signals.
When the antialiasing filter is an IIR design, it relies on feedback from output to input, prior to the second step. With FIR filtering, it is an easy matter to compute only every M^{th} output. The calculation performed by a decimating FIR filter for the n^{th} output sample is a dot product:[upperalpha 2]
where the h[•] sequence is the impulse response, and K is its length. x[•] represents the input sequence being downsampled. In a general purpose processor, after computing y[n], the easiest way to compute y[n+1] is to advance the starting index in the x[•] array by M, and recompute the dot product. In the case M=2, h[•] can be designed as a halfband filter, where almost half of the coefficients are zero and need not be included in the dot products.
Impulse response coefficients taken at intervals of M form a subsequence, and there are M such subsequences (phases) multiplexed together. The dot product is the sum of the dot products of each subsequence with the corresponding samples of the x[•] sequence. Furthermore, because of downsampling by M, the stream of x[•] samples involved in any one of the M dot products is never involved in the other dot products. Thus M loworder FIR filters are each filtering one of M multiplexed phases of the input stream, and the M outputs are being summed. This viewpoint offers a different implementation that might be advantageous in a multiprocessor architecture. In other words, the input stream is demultiplexed and sent through a bank of M filters whose outputs are summed. When implemented that way, it is called a polyphase filter.
For completeness, we now mention that a possible, but unlikely, implementation of each phase is to replace the coefficients of the other phases with zeros in a copy of the h[•] array, process the original x[•] sequence at the input rate (which means lots of multiplying by zeros), and decimate the output by a factor of M. The equivalence of this inefficient method and the implementation described above is known as the first Noble identity.[6][upperalpha 3]
Antialiasing filter
The requirements of the antialiasing filter can be deduced from any of the three pairs of graphs in Fig. 1. Note that all three pairs are identical, except for the units of the abscissa variables. The upper graph of each pair is an example of the periodic frequency distribution of a sampled function, x(t), with Fourier transform, X(f). The lower graph is the new distribution that results when x(t) is sampled three times slower, or (equivalently) when the original sample sequence is decimated by a factor of M=3.[upperalpha 4] In all three cases, the condition that ensures the copies of X(f) do not overlap each other is the same: where T is the interval between samples, 1/T is the samplerate, and 1/(2T) is the Nyquist frequency. The antialiasing filter that can ensure the condition is met has a cutoff frequency less than times the Nyquist frequency.[upperalpha 5]
The abscissa of the top pair of graphs represents the discretetime Fourier transform (DTFT), which is a Fourier series representation of a periodic summation of X(f):[upperalpha 6]

(Eq.1)
When T has units of seconds, has units of hertz. Replacing T with MT in the formulas above gives the DTFT of the decimated sequence, x[nM]:
The periodic summation has been reduced in amplitude and periodicity by a factor of M, as depicted in the second graph of Fig. 1. Aliasing occurs when adjacent copies of X(f) overlap. The purpose of the antialiasing filter is to ensure that the reduced periodicity does not create overlap.
In the middle pair of graphs, the frequency variable, has been replaced by normalized frequency, which creates a periodicity of 1 and a Nyquist frequency of ½.[upperalpha 7] A common practice in filter design programs is to assume those values and request only the corresponding cutoff frequency in the same units. In other words, the cutoff frequency is normalized to The units of this quantity are (seconds/sample)×(cycles/second) = cycles/sample.
The bottom pair of graphs represent the Ztransforms of the original sequence and the decimated sequence, constrained to values of complexvariable, z, of the form Then the transform of the x[n] sequence has the form of a Fourier series. By comparison with Eq.1, we deduce:[upperalpha 8]
which is depicted by the fifth graph in Fig. 1. Similarly, the sixth graph depicts:[upperalpha 9]
By a rational factor
Let M/L denote the decimation factor,[upperalpha 10] where: M, L ∈ ℤ; M > L.
 Increase (resample) the sequence by a factor of L. This is called Upsampling, or interpolation.
 Decimate by a factor of M
Step 1 requires a lowpass filter after increasing (expanding) the data rate, and step 2 requires a lowpass filter before decimation. Therefore, both operations can be accomplished by a single filter with the lower of the two cutoff frequencies. For the M > L case, the antialiasing filter cutoff, cycles per intermediate sample, is the lower frequency.
Notes
 Harris. "6.1". p 128.
 Crochiere and Rabiner "2". p 32. eq 2.55a.
 Harris. "2.2.1". p 25.
 Harris. "2.2". p 22. fig 2.10. top and bottom graphs.
 Realizable lowpass filters have a "skirt", where the response diminishes from near one to near zero. So in practice the cutoff frequency is placed far enough below the theoretical cutoff that the filter's skirt is contained below the theoretical cutoff.
 Oppenheim and Schafer. "4.2". p 143. eq 4.6, where and .
 Some programs (such as MATLAB) that design filters with realvalued coefficients use the Nyquist frequency () as the normalization constant. That results in a Nyquist frequency of 1 and a periodicity of 2.
 Oppenheim and Schafer. "4.6.1". p 168. eq 4.72, where and .
 Oppenheim and Schafer. "4.6.1". p 168. eq 4.74, where and .
 General techniques for samplerate conversion by factor R ∈ ℝ^{+} include polynomial interpolation and the Farrow structure.[7]
References
 Oppenheim, Alan V.; Schafer, Ronald W.; Buck, John R. (1999). "4". DiscreteTime Signal Processing (PDF) (2nd ed.). Prentice Hall. p. 168. ISBN 0137549202.

Tan, Li (20080421). "Upsampling and downsampling". eetimes.com. EE Times. Retrieved 20170410.
The process of reducing a sampling rate by an integer factor is referred to as downsampling of a data sequence. We also refer to downsampling as decimation. The term decimation used for the downsampling process has been accepted and used in many textbooks and fields.
 Crochiere, R.E.; Rabiner, L.R. (1983). "2". Multirate Digital Signal Processing. Englewood Cliffs, NJ: PrenticeHall. p. 32. ISBN 0136051626.
 Poularikas, Alexander D. (September 1998). Handbook of Formulas and Tables for Signal Processing (1 ed.). CRC Press. pp. 42–48. ISBN 0849385792.
 Harris, Frederic J. (20040524). "2.2". Multirate Signal Processing for Communication Systems. Upper Saddle River, NJ: Prentice Hall PTR. pp. 20–21. ISBN 0131465112.
The process of down sampling can be visualized as a twostep progression. The process starts as an input series x(n) that is processed by a filter h(n) to obtain the output sequence y(n) with reduced bandwidth. The sample rate of the output sequence is then reduced Qto1 to a rate commensurate with the reduced signal bandwidth. In reality the processes of bandwidth reduction and sample rate reduction are merged in a single process called a multirate filter.
 Strang, Gilbert; Nguyen, Truong (19961001). Wavelets and Filter Banks (2 ed.). Wellesley,MA: WellesleyCambridge Press. pp. 100–101. ISBN 0961408871.
 Milić, Ljiljana (2009). Multirate Filtering for Digital Signal Processing. New York: Hershey. p. 192. ISBN 9781605661780.
Generally, this approach is applicable when the ratio Fy/Fx is a rational, or an irrational number, and is suitable for the sampling rate increase and for the sampling rate decrease.
Further reading
 Proakis, John G. (2000). Digital Signal Processing: Principles, Algorithms and Applications (3rd ed.). India: PrenticeHall. ISBN 8120311299.
 Lyons, Richard (2001). Understanding Digital Signal Processing. Prentice Hall. p. 304. ISBN 0201634678.
Decreasing the sampling rate is known as decimation.
 Antoniou, Andreas (2006). Digital Signal Processing. McGrawHill. p. 830. ISBN 0071454241.
Decimators can be used to reduce the sampling frequency, whereas interpolators can be used to increase it.
 Milic, Ljiljana (2009). Multirate Filtering for Digital Signal Processing. New York: Hershey. p. 35. ISBN 9781605661780.
Sampling rate conversion systems are used to change the sampling rate of a signal. The process of sampling rate decrease is called decimation, and the process of sampling rate increase is called interpolation.
 T. Schilcher. RF applications in digital signal processing//” Digital signal processing”. Proceedings, CERN Accelerator School, Sigtuna, Sweden, May 31June 9, 2007.  Geneva, Switzerland: CERN (2008).  P. 258.  DOI: 10.5170/CERN2008003.
 Sliusar I.I., Slyusar V.I., Voloshko S.V., Smolyar V.G. Next Generation Optical Access based on NOFDM with decimation.// Third International ScientificPractical Conference “Problems of Infocommunications. Science and Technology (PIC S&T’2016)”. – Kharkiv.  October 3 –6, 2016.
 Saska Lindfors, Aarno Pärssinen, Kari A. I. Halonen. A 3V 230MHz CMOS Decimation Subsampler.// IEEE transactions on circuits and systems— Vol. 52, No. 2, February 2005. – P. 110.